./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dbea62dc4a872959247118f049e63d406eb1e848bb1ed8397f1082fdec77074c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 16:35:36,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 16:35:36,164 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 16:35:36,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 16:35:36,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 16:35:36,196 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 16:35:36,198 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 16:35:36,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 16:35:36,199 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 16:35:36,199 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 16:35:36,200 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 16:35:36,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 16:35:36,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 16:35:36,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 16:35:36,202 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 16:35:36,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 16:35:36,203 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 16:35:36,205 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 16:35:36,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 16:35:36,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 16:35:36,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 16:35:36,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 16:35:36,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 16:35:36,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 16:35:36,207 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 16:35:36,210 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 16:35:36,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 16:35:36,210 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 16:35:36,211 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 16:35:36,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 16:35:36,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 16:35:36,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 16:35:36,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 16:35:36,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 16:35:36,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 16:35:36,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 16:35:36,212 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 16:35:36,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 16:35:36,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 16:35:36,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 16:35:36,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 16:35:36,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 16:35:36,214 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dbea62dc4a872959247118f049e63d406eb1e848bb1ed8397f1082fdec77074c [2024-10-14 16:35:36,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 16:35:36,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 16:35:36,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 16:35:36,463 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 16:35:36,467 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 16:35:36,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i [2024-10-14 16:35:37,796 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 16:35:38,052 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 16:35:38,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i [2024-10-14 16:35:38,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a44f0cf5/8a49d61a085b46aaa21af037d46dc3c5/FLAG690f6d0a5 [2024-10-14 16:35:38,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a44f0cf5/8a49d61a085b46aaa21af037d46dc3c5 [2024-10-14 16:35:38,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 16:35:38,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 16:35:38,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 16:35:38,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 16:35:38,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 16:35:38,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:35:38" (1/1) ... [2024-10-14 16:35:38,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37f4e185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:35:38, skipping insertion in model container [2024-10-14 16:35:38,105 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:35:38" (1/1) ... [2024-10-14 16:35:38,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 16:35:38,494 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i[37019,37032] [2024-10-14 16:35:38,584 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i[47352,47365] [2024-10-14 16:35:38,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 16:35:38,604 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 16:35:38,639 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i[37019,37032] [2024-10-14 16:35:38,676 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i[47352,47365] [2024-10-14 16:35:38,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 16:35:38,722 INFO L204 MainTranslator]: Completed translation [2024-10-14 16:35:38,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:35:38 WrapperNode [2024-10-14 16:35:38,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 16:35:38,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 16:35:38,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 16:35:38,724 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 16:35:38,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:35:38" (1/1) ... [2024-10-14 16:35:38,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:35:38" (1/1) ... [2024-10-14 16:35:38,809 INFO L138 Inliner]: procedures = 208, calls = 227, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1302 [2024-10-14 16:35:38,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 16:35:38,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 16:35:38,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 16:35:38,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 16:35:38,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:35:38" (1/1) ... [2024-10-14 16:35:38,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:35:38" (1/1) ... [2024-10-14 16:35:38,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:35:38" (1/1) ... [2024-10-14 16:35:38,883 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2024-10-14 16:35:38,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:35:38" (1/1) ... [2024-10-14 16:35:38,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:35:38" (1/1) ... [2024-10-14 16:35:38,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:35:38" (1/1) ... [2024-10-14 16:35:38,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:35:38" (1/1) ... [2024-10-14 16:35:38,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:35:38" (1/1) ... [2024-10-14 16:35:38,939 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:35:38" (1/1) ... [2024-10-14 16:35:38,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 16:35:38,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 16:35:38,947 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 16:35:38,947 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 16:35:38,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:35:38" (1/1) ... [2024-10-14 16:35:38,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 16:35:38,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 16:35:38,989 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 16:35:39,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 16:35:39,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 16:35:39,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 16:35:39,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-14 16:35:39,035 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 16:35:39,035 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 16:35:39,035 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-14 16:35:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 16:35:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 16:35:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 16:35:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 16:35:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 16:35:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 16:35:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 16:35:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 16:35:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 16:35:39,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 16:35:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 16:35:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 16:35:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 16:35:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 16:35:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 16:35:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 16:35:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 16:35:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 16:35:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 16:35:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 16:35:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 16:35:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 16:35:39,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 16:35:39,208 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 16:35:39,210 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 16:35:40,407 INFO L? ?]: Removed 302 outVars from TransFormulas that were not future-live. [2024-10-14 16:35:40,407 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 16:35:40,432 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 16:35:40,433 INFO L314 CfgBuilder]: Removed 54 assume(true) statements. [2024-10-14 16:35:40,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:35:40 BoogieIcfgContainer [2024-10-14 16:35:40,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 16:35:40,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 16:35:40,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 16:35:40,439 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 16:35:40,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:35:38" (1/3) ... [2024-10-14 16:35:40,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616140c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:35:40, skipping insertion in model container [2024-10-14 16:35:40,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:35:38" (2/3) ... [2024-10-14 16:35:40,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616140c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:35:40, skipping insertion in model container [2024-10-14 16:35:40,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:35:40" (3/3) ... [2024-10-14 16:35:40,441 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test2-1.i [2024-10-14 16:35:40,453 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 16:35:40,453 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 16:35:40,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 16:35:40,537 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@330f136a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 16:35:40,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 16:35:40,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 376 states, 363 states have (on average 1.6308539944903582) internal successors, (592), 370 states have internal predecessors, (592), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 16:35:40,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 16:35:40,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:35:40,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:35:40,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 16:35:40,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:35:40,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1655798104, now seen corresponding path program 1 times [2024-10-14 16:35:40,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:35:40,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591321772] [2024-10-14 16:35:40,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:35:40,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:35:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:35:40,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:35:40,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:35:40,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591321772] [2024-10-14 16:35:40,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591321772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:35:40,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:35:40,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 16:35:40,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702458781] [2024-10-14 16:35:40,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:35:40,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 16:35:40,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:35:40,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 16:35:40,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 16:35:40,792 INFO L87 Difference]: Start difference. First operand has 376 states, 363 states have (on average 1.6308539944903582) internal successors, (592), 370 states have internal predecessors, (592), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:35:40,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:35:40,846 INFO L93 Difference]: Finished difference Result 751 states and 1220 transitions. [2024-10-14 16:35:40,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 16:35:40,848 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 16:35:40,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:35:40,857 INFO L225 Difference]: With dead ends: 751 [2024-10-14 16:35:40,857 INFO L226 Difference]: Without dead ends: 374 [2024-10-14 16:35:40,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 16:35:40,863 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 16:35:40,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 544 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 16:35:40,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-14 16:35:40,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2024-10-14 16:35:40,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 362 states have (on average 1.4640883977900552) internal successors, (530), 368 states have internal predecessors, (530), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 16:35:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 546 transitions. [2024-10-14 16:35:40,935 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 546 transitions. Word has length 8 [2024-10-14 16:35:40,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:35:40,935 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 546 transitions. [2024-10-14 16:35:40,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:35:40,936 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 546 transitions. [2024-10-14 16:35:40,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 16:35:40,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:35:40,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:35:40,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 16:35:40,940 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 16:35:40,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:35:40,941 INFO L85 PathProgramCache]: Analyzing trace with hash 901411986, now seen corresponding path program 1 times [2024-10-14 16:35:40,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:35:40,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236711884] [2024-10-14 16:35:40,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:35:40,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:35:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:35:41,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:35:41,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:35:41,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236711884] [2024-10-14 16:35:41,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236711884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:35:41,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:35:41,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 16:35:41,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208090057] [2024-10-14 16:35:41,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:35:41,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 16:35:41,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:35:41,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 16:35:41,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 16:35:41,267 INFO L87 Difference]: Start difference. First operand 374 states and 546 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:35:41,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:35:41,432 INFO L93 Difference]: Finished difference Result 912 states and 1341 transitions. [2024-10-14 16:35:41,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 16:35:41,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 16:35:41,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:35:41,439 INFO L225 Difference]: With dead ends: 912 [2024-10-14 16:35:41,439 INFO L226 Difference]: Without dead ends: 737 [2024-10-14 16:35:41,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 16:35:41,441 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 517 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 16:35:41,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1563 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 16:35:41,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-10-14 16:35:41,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 376. [2024-10-14 16:35:41,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 364 states have (on average 1.4615384615384615) internal successors, (532), 370 states have internal predecessors, (532), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 16:35:41,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 548 transitions. [2024-10-14 16:35:41,464 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 548 transitions. Word has length 63 [2024-10-14 16:35:41,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:35:41,464 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 548 transitions. [2024-10-14 16:35:41,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:35:41,464 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 548 transitions. [2024-10-14 16:35:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 16:35:41,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:35:41,468 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:35:41,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 16:35:41,468 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 16:35:41,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:35:41,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1489663091, now seen corresponding path program 1 times [2024-10-14 16:35:41,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:35:41,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607286484] [2024-10-14 16:35:41,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:35:41,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:35:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:35:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:35:41,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:35:41,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607286484] [2024-10-14 16:35:41,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607286484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:35:41,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:35:41,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 16:35:41,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390628043] [2024-10-14 16:35:41,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:35:41,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 16:35:41,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:35:41,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 16:35:41,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 16:35:41,712 INFO L87 Difference]: Start difference. First operand 376 states and 548 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:35:41,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:35:41,777 INFO L93 Difference]: Finished difference Result 752 states and 1096 transitions. [2024-10-14 16:35:41,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 16:35:41,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2024-10-14 16:35:41,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:35:41,779 INFO L225 Difference]: With dead ends: 752 [2024-10-14 16:35:41,780 INFO L226 Difference]: Without dead ends: 379 [2024-10-14 16:35:41,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 16:35:41,781 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 105 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 16:35:41,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1454 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 16:35:41,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-14 16:35:41,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2024-10-14 16:35:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 364 states have (on average 1.4423076923076923) internal successors, (525), 370 states have internal predecessors, (525), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 16:35:41,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 541 transitions. [2024-10-14 16:35:41,792 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 541 transitions. Word has length 139 [2024-10-14 16:35:41,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:35:41,793 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 541 transitions. [2024-10-14 16:35:41,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:35:41,793 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 541 transitions. [2024-10-14 16:35:41,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 16:35:41,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:35:41,797 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:35:41,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 16:35:41,797 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 16:35:41,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:35:41,801 INFO L85 PathProgramCache]: Analyzing trace with hash -531782657, now seen corresponding path program 1 times [2024-10-14 16:35:41,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:35:41,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461197282] [2024-10-14 16:35:41,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:35:41,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:35:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:35:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:35:42,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:35:42,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461197282] [2024-10-14 16:35:42,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461197282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:35:42,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:35:42,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 16:35:42,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139257131] [2024-10-14 16:35:42,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:35:42,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 16:35:42,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:35:42,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 16:35:42,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 16:35:42,002 INFO L87 Difference]: Start difference. First operand 376 states and 541 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:35:42,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:35:42,066 INFO L93 Difference]: Finished difference Result 1025 states and 1492 transitions. [2024-10-14 16:35:42,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 16:35:42,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2024-10-14 16:35:42,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:35:42,071 INFO L225 Difference]: With dead ends: 1025 [2024-10-14 16:35:42,073 INFO L226 Difference]: Without dead ends: 652 [2024-10-14 16:35:42,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 16:35:42,074 INFO L432 NwaCegarLoop]: 731 mSDtfsCounter, 346 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 16:35:42,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1254 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 16:35:42,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-10-14 16:35:42,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 650. [2024-10-14 16:35:42,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 633 states have (on average 1.4612954186413902) internal successors, (925), 644 states have internal predecessors, (925), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 16:35:42,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 951 transitions. [2024-10-14 16:35:42,102 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 951 transitions. Word has length 139 [2024-10-14 16:35:42,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:35:42,104 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 951 transitions. [2024-10-14 16:35:42,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:35:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 951 transitions. [2024-10-14 16:35:42,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-14 16:35:42,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:35:42,112 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:35:42,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 16:35:42,112 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 16:35:42,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:35:42,114 INFO L85 PathProgramCache]: Analyzing trace with hash -601126351, now seen corresponding path program 1 times [2024-10-14 16:35:42,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:35:42,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88825040] [2024-10-14 16:35:42,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:35:42,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:35:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:35:42,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 16:35:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:35:42,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 16:35:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:35:42,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 16:35:42,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:35:42,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88825040] [2024-10-14 16:35:42,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88825040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:35:42,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:35:42,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 16:35:42,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291362321] [2024-10-14 16:35:42,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:35:42,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 16:35:42,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:35:42,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 16:35:42,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 16:35:42,390 INFO L87 Difference]: Start difference. First operand 650 states and 951 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 16:35:42,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:35:42,671 INFO L93 Difference]: Finished difference Result 887 states and 1304 transitions. [2024-10-14 16:35:42,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 16:35:42,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2024-10-14 16:35:42,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:35:42,674 INFO L225 Difference]: With dead ends: 887 [2024-10-14 16:35:42,675 INFO L226 Difference]: Without dead ends: 568 [2024-10-14 16:35:42,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:35:42,676 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 37 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 16:35:42,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1620 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 16:35:42,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-10-14 16:35:42,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 566. [2024-10-14 16:35:42,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 549 states have (on average 1.4043715846994536) internal successors, (771), 560 states have internal predecessors, (771), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 16:35:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 797 transitions. [2024-10-14 16:35:42,691 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 797 transitions. Word has length 152 [2024-10-14 16:35:42,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:35:42,691 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 797 transitions. [2024-10-14 16:35:42,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 16:35:42,692 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 797 transitions. [2024-10-14 16:35:42,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-14 16:35:42,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:35:42,697 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:35:42,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 16:35:42,697 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 16:35:42,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:35:42,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1772640475, now seen corresponding path program 1 times [2024-10-14 16:35:42,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:35:42,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546062401] [2024-10-14 16:35:42,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:35:42,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:35:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:35:42,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 16:35:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:35:42,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 16:35:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:35:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 16:35:42,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:35:42,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546062401] [2024-10-14 16:35:42,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546062401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:35:42,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:35:42,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:35:42,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572884200] [2024-10-14 16:35:42,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:35:42,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:35:42,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:35:42,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:35:42,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:35:42,990 INFO L87 Difference]: Start difference. First operand 566 states and 797 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 16:35:43,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:35:43,419 INFO L93 Difference]: Finished difference Result 1081 states and 1515 transitions. [2024-10-14 16:35:43,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 16:35:43,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2024-10-14 16:35:43,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:35:43,423 INFO L225 Difference]: With dead ends: 1081 [2024-10-14 16:35:43,423 INFO L226 Difference]: Without dead ends: 647 [2024-10-14 16:35:43,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:35:43,424 INFO L432 NwaCegarLoop]: 628 mSDtfsCounter, 956 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 16:35:43,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [963 Valid, 2002 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 16:35:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-10-14 16:35:43,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 463. [2024-10-14 16:35:43,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 451 states have (on average 1.4057649667405765) internal successors, (634), 457 states have internal predecessors, (634), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 16:35:43,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 650 transitions. [2024-10-14 16:35:43,437 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 650 transitions. Word has length 152 [2024-10-14 16:35:43,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:35:43,438 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 650 transitions. [2024-10-14 16:35:43,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 16:35:43,438 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 650 transitions. [2024-10-14 16:35:43,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 16:35:43,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:35:43,439 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:35:43,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 16:35:43,440 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 16:35:43,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:35:43,440 INFO L85 PathProgramCache]: Analyzing trace with hash -697554279, now seen corresponding path program 1 times [2024-10-14 16:35:43,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:35:43,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607116679] [2024-10-14 16:35:43,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:35:43,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:35:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:35:43,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 16:35:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:35:43,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 16:35:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:35:43,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 16:35:43,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:35:43,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607116679] [2024-10-14 16:35:43,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607116679] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 16:35:43,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342247421] [2024-10-14 16:35:43,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:35:43,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 16:35:43,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 16:35:43,993 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 16:35:43,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 16:35:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:35:44,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 16:35:44,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 16:35:44,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 16:35:44,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-14 16:35:44,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 16:35:44,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 16:35:44,493 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 16:35:44,661 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 16:35:44,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342247421] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 16:35:44,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 16:35:44,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2024-10-14 16:35:44,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658418381] [2024-10-14 16:35:44,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 16:35:44,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 16:35:44,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:35:44,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 16:35:44,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-14 16:35:44,664 INFO L87 Difference]: Start difference. First operand 463 states and 650 transitions. Second operand has 12 states, 12 states have (on average 27.0) internal successors, (324), 11 states have internal predecessors, (324), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 16:35:45,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:35:45,159 INFO L93 Difference]: Finished difference Result 1472 states and 2063 transitions. [2024-10-14 16:35:45,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 16:35:45,160 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 27.0) internal successors, (324), 11 states have internal predecessors, (324), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 162 [2024-10-14 16:35:45,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:35:45,164 INFO L225 Difference]: With dead ends: 1472 [2024-10-14 16:35:45,164 INFO L226 Difference]: Without dead ends: 1339 [2024-10-14 16:35:45,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 320 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-10-14 16:35:45,166 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 2564 mSDsluCounter, 3080 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2582 SdHoareTripleChecker+Valid, 3550 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 16:35:45,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2582 Valid, 3550 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 16:35:45,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2024-10-14 16:35:45,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 893. [2024-10-14 16:35:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 877 states have (on average 1.402508551881414) internal successors, (1230), 883 states have internal predecessors, (1230), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 16:35:45,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1252 transitions. [2024-10-14 16:35:45,190 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1252 transitions. Word has length 162 [2024-10-14 16:35:45,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:35:45,191 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1252 transitions. [2024-10-14 16:35:45,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.0) internal successors, (324), 11 states have internal predecessors, (324), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 16:35:45,191 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1252 transitions. [2024-10-14 16:35:45,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2024-10-14 16:35:45,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:35:45,195 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:35:45,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 16:35:45,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 16:35:45,396 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 16:35:45,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:35:45,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1751181792, now seen corresponding path program 1 times [2024-10-14 16:35:45,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:35:45,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358757865] [2024-10-14 16:35:45,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:35:45,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:35:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:35:48,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 16:35:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:35:48,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 16:35:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:35:48,449 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 16:35:48,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:35:48,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358757865] [2024-10-14 16:35:48,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358757865] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 16:35:48,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427708646] [2024-10-14 16:35:48,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:35:48,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 16:35:48,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 16:35:48,453 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 16:35:48,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 16:35:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:35:48,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 16:35:48,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 16:35:48,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 16:35:49,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-14 16:35:49,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-14 16:35:49,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-14 16:35:49,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-14 16:35:49,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 16:35:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 16:35:49,390 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 16:35:49,811 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 16:35:49,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427708646] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 16:35:49,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 16:35:49,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 21 [2024-10-14 16:35:49,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040976010] [2024-10-14 16:35:49,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 16:35:49,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 16:35:49,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:35:49,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 16:35:49,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2024-10-14 16:35:49,814 INFO L87 Difference]: Start difference. First operand 893 states and 1252 transitions. Second operand has 21 states, 21 states have (on average 37.42857142857143) internal successors, (786), 20 states have internal predecessors, (786), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 16:35:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:35:51,036 INFO L93 Difference]: Finished difference Result 2966 states and 4175 transitions. [2024-10-14 16:35:51,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 16:35:51,037 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 37.42857142857143) internal successors, (786), 20 states have internal predecessors, (786), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 390 [2024-10-14 16:35:51,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:35:51,052 INFO L225 Difference]: With dead ends: 2966 [2024-10-14 16:35:51,056 INFO L226 Difference]: Without dead ends: 2833 [2024-10-14 16:35:51,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 775 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=229, Invalid=527, Unknown=0, NotChecked=0, Total=756 [2024-10-14 16:35:51,061 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 4373 mSDsluCounter, 5770 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4418 SdHoareTripleChecker+Valid, 6240 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 16:35:51,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4418 Valid, 6240 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 16:35:51,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2833 states. [2024-10-14 16:35:51,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2833 to 2009. [2024-10-14 16:35:51,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2009 states, 1987 states have (on average 1.4071464519375945) internal successors, (2796), 1993 states have internal predecessors, (2796), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 16:35:51,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 2830 transitions. [2024-10-14 16:35:51,170 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 2830 transitions. Word has length 390 [2024-10-14 16:35:51,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:35:51,171 INFO L471 AbstractCegarLoop]: Abstraction has 2009 states and 2830 transitions. [2024-10-14 16:35:51,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 37.42857142857143) internal successors, (786), 20 states have internal predecessors, (786), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 16:35:51,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2830 transitions. [2024-10-14 16:35:51,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2024-10-14 16:35:51,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:35:51,189 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:35:51,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 16:35:51,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-14 16:35:51,390 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 16:35:51,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:35:51,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1407602350, now seen corresponding path program 2 times [2024-10-14 16:35:51,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:35:51,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732128676] [2024-10-14 16:35:51,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:35:51,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms