/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-pthread/cs_queue-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 11:35:45,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 11:35:45,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 11:35:45,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 11:35:45,335 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 11:35:45,361 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 11:35:45,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 11:35:45,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 11:35:45,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 11:35:45,366 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 11:35:45,366 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 11:35:45,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 11:35:45,367 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 11:35:45,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 11:35:45,369 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 11:35:45,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 11:35:45,369 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 11:35:45,370 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 11:35:45,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 11:35:45,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 11:35:45,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 11:35:45,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 11:35:45,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 11:35:45,371 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 11:35:45,371 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 11:35:45,371 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 11:35:45,372 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 11:35:45,372 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 11:35:45,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 11:35:45,372 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 11:35:45,373 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 11:35:45,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 11:35:45,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 11:35:45,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 11:35:45,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 11:35:45,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 11:35:45,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 11:35:45,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 11:35:45,374 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 11:35:45,375 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 11:35:45,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 11:35:45,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 11:35:45,375 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 11:35:45,375 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 11:35:45,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 11:35:45,376 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 11:35:45,376 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 [2023-12-25 11:35:45,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 11:35:45,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 11:35:45,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 11:35:45,641 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 11:35:45,642 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 11:35:45,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-pthread/cs_queue-2.i [2023-12-25 11:35:46,841 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 11:35:47,098 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 11:35:47,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_queue-2.i [2023-12-25 11:35:47,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18ee6c809/36f8f3b9504a412bbc1c5094b4cdc9fa/FLAG6658049cb [2023-12-25 11:35:47,149 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18ee6c809/36f8f3b9504a412bbc1c5094b4cdc9fa [2023-12-25 11:35:47,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 11:35:47,152 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 11:35:47,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 11:35:47,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 11:35:47,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 11:35:47,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 11:35:47" (1/1) ... [2023-12-25 11:35:47,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79b65da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:47, skipping insertion in model container [2023-12-25 11:35:47,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 11:35:47" (1/1) ... [2023-12-25 11:35:47,219 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 11:35:47,612 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_queue-2.i[34556,34569] [2023-12-25 11:35:47,790 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 11:35:47,819 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 11:35:47,858 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_queue-2.i[34556,34569] [2023-12-25 11:35:47,967 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 11:35:48,018 INFO L206 MainTranslator]: Completed translation [2023-12-25 11:35:48,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:48 WrapperNode [2023-12-25 11:35:48,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 11:35:48,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 11:35:48,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 11:35:48,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 11:35:48,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:48" (1/1) ... [2023-12-25 11:35:48,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:48" (1/1) ... [2023-12-25 11:35:48,167 INFO L138 Inliner]: procedures = 252, calls = 531, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1070 [2023-12-25 11:35:48,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 11:35:48,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 11:35:48,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 11:35:48,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 11:35:48,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:48" (1/1) ... [2023-12-25 11:35:48,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:48" (1/1) ... [2023-12-25 11:35:48,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:48" (1/1) ... [2023-12-25 11:35:48,247 INFO L175 MemorySlicer]: Split 294 memory accesses to 19 slices as follows [2, 2, 8, 2, 8, 20, 12, 44, 4, 8, 8, 46, 0, 6, 68, 8, 40, 2, 6]. 23 percent of accesses are in the largest equivalence class. The 26 initializations are split as follows [2, 0, 3, 0, 3, 6, 6, 0, 0, 2, 2, 0, 0, 0, 0, 2, 0, 0, 0]. The 85 writes are split as follows [0, 0, 2, 0, 2, 8, 3, 23, 2, 4, 4, 0, 0, 0, 34, 3, 0, 0, 0]. [2023-12-25 11:35:48,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:48" (1/1) ... [2023-12-25 11:35:48,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:48" (1/1) ... [2023-12-25 11:35:48,318 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:48" (1/1) ... [2023-12-25 11:35:48,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:48" (1/1) ... [2023-12-25 11:35:48,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:48" (1/1) ... [2023-12-25 11:35:48,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:48" (1/1) ... [2023-12-25 11:35:48,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 11:35:48,379 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 11:35:48,380 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 11:35:48,380 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 11:35:48,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:48" (1/1) ... [2023-12-25 11:35:48,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 11:35:48,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 11:35:48,407 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) [2023-12-25 11:35:48,432 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 [2023-12-25 11:35:48,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-25 11:35:48,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-25 11:35:48,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-25 11:35:48,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-25 11:35:48,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-25 11:35:48,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-25 11:35:48,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2023-12-25 11:35:48,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2023-12-25 11:35:48,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2023-12-25 11:35:48,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2023-12-25 11:35:48,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2023-12-25 11:35:48,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2023-12-25 11:35:48,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2023-12-25 11:35:48,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2023-12-25 11:35:48,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2023-12-25 11:35:48,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2023-12-25 11:35:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#16 [2023-12-25 11:35:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#17 [2023-12-25 11:35:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#18 [2023-12-25 11:35:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-25 11:35:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-25 11:35:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-25 11:35:48,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-25 11:35:48,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-25 11:35:48,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-12-25 11:35:48,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2023-12-25 11:35:48,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2023-12-25 11:35:48,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2023-12-25 11:35:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2023-12-25 11:35:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2023-12-25 11:35:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2023-12-25 11:35:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2023-12-25 11:35:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2023-12-25 11:35:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2023-12-25 11:35:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2023-12-25 11:35:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#16 [2023-12-25 11:35:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#17 [2023-12-25 11:35:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#18 [2023-12-25 11:35:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 11:35:48,449 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 11:35:48,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-25 11:35:48,449 INFO L130 BoogieDeclarations]: Found specification of procedure empty [2023-12-25 11:35:48,449 INFO L138 BoogieDeclarations]: Found implementation of procedure empty [2023-12-25 11:35:48,449 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2023-12-25 11:35:48,449 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2023-12-25 11:35:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-25 11:35:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-25 11:35:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-25 11:35:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-12-25 11:35:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-12-25 11:35:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-12-25 11:35:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-12-25 11:35:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-12-25 11:35:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-12-25 11:35:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-12-25 11:35:48,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-12-25 11:35:48,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-12-25 11:35:48,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2023-12-25 11:35:48,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2023-12-25 11:35:48,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2023-12-25 11:35:48,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2023-12-25 11:35:48,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2023-12-25 11:35:48,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2023-12-25 11:35:48,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2023-12-25 11:35:48,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-25 11:35:48,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-25 11:35:48,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-25 11:35:48,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-25 11:35:48,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-25 11:35:48,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-25 11:35:48,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2023-12-25 11:35:48,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2023-12-25 11:35:48,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2023-12-25 11:35:48,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2023-12-25 11:35:48,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2023-12-25 11:35:48,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2023-12-25 11:35:48,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2023-12-25 11:35:48,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2023-12-25 11:35:48,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2023-12-25 11:35:48,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2023-12-25 11:35:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#16 [2023-12-25 11:35:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#17 [2023-12-25 11:35:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#18 [2023-12-25 11:35:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-25 11:35:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-25 11:35:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-25 11:35:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-25 11:35:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-25 11:35:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-25 11:35:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-12-25 11:35:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2023-12-25 11:35:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2023-12-25 11:35:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2023-12-25 11:35:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2023-12-25 11:35:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2023-12-25 11:35:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2023-12-25 11:35:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2023-12-25 11:35:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2023-12-25 11:35:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2023-12-25 11:35:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2023-12-25 11:35:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#16 [2023-12-25 11:35:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#17 [2023-12-25 11:35:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#18 [2023-12-25 11:35:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-25 11:35:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-25 11:35:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-25 11:35:48,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-12-25 11:35:48,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-12-25 11:35:48,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-12-25 11:35:48,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-12-25 11:35:48,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-12-25 11:35:48,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-12-25 11:35:48,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2023-12-25 11:35:48,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2023-12-25 11:35:48,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2023-12-25 11:35:48,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2023-12-25 11:35:48,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2023-12-25 11:35:48,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2023-12-25 11:35:48,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2023-12-25 11:35:48,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2023-12-25 11:35:48,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2023-12-25 11:35:48,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2023-12-25 11:35:48,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 11:35:48,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 11:35:48,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-25 11:35:48,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-25 11:35:48,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-25 11:35:48,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-25 11:35:48,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2023-12-25 11:35:48,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2023-12-25 11:35:48,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2023-12-25 11:35:48,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2023-12-25 11:35:48,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2023-12-25 11:35:48,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2023-12-25 11:35:48,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2023-12-25 11:35:48,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2023-12-25 11:35:48,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2023-12-25 11:35:48,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2023-12-25 11:35:48,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#16 [2023-12-25 11:35:48,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#17 [2023-12-25 11:35:48,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#18 [2023-12-25 11:35:48,462 INFO L130 BoogieDeclarations]: Found specification of procedure enqueue [2023-12-25 11:35:48,462 INFO L138 BoogieDeclarations]: Found implementation of procedure enqueue [2023-12-25 11:35:48,462 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2023-12-25 11:35:48,462 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2023-12-25 11:35:48,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 11:35:48,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-25 11:35:48,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-25 11:35:48,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-25 11:35:48,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-12-25 11:35:48,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-12-25 11:35:48,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-12-25 11:35:48,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-12-25 11:35:48,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-12-25 11:35:48,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-12-25 11:35:48,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-12-25 11:35:48,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-12-25 11:35:48,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-12-25 11:35:48,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2023-12-25 11:35:48,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2023-12-25 11:35:48,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2023-12-25 11:35:48,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2023-12-25 11:35:48,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2023-12-25 11:35:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2023-12-25 11:35:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2023-12-25 11:35:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2023-12-25 11:35:48,473 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2023-12-25 11:35:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2023-12-25 11:35:48,473 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2023-12-25 11:35:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-12-25 11:35:48,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-12-25 11:35:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2023-12-25 11:35:48,474 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2023-12-25 11:35:48,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 11:35:48,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 11:35:48,783 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 11:35:48,785 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 11:35:48,852 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:35:48,853 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:35:48,853 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);#res := 0bv32; [2023-12-25 11:35:48,853 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);#res := 0bv32; [2023-12-25 11:35:49,723 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L1097: SUMMARY for call __CS_cs(); srcloc: null [2023-12-25 11:35:49,723 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L1097-1: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);t2_#res#1.base, t2_#res#1.offset := 0bv32, 0bv32; [2023-12-25 11:35:49,723 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L1097-1: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:35:49,724 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L1132: SUMMARY for call __CS_cs(); srcloc: null [2023-12-25 11:35:49,724 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L1132-1: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv32, 0bv32;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2023-12-25 11:35:49,724 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L1132-1: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:35:49,724 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075: SUMMARY for call __CS_cs(); srcloc: null [2023-12-25 11:35:49,724 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075-1: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);t1_#res#1.base, t1_#res#1.offset := 0bv32, 0bv32; [2023-12-25 11:35:49,724 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075-1: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:35:49,724 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:35:49,724 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);t2_#res#1.base, t2_#res#1.offset := 0bv32, 0bv32; [2023-12-25 11:35:49,724 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:35:49,725 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);t2_#res#1.base, t2_#res#1.offset := 0bv32, 0bv32; [2023-12-25 11:35:49,725 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##79: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:35:49,725 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##78: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);dequeue_#res#1 := 0bv32; [2023-12-25 11:35:49,725 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##129: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:35:49,725 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##128: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);t1_#res#1.base, t1_#res#1.offset := 0bv32, 0bv32; [2023-12-25 11:35:49,725 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:35:49,725 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv32, 0bv32;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2023-12-25 11:35:49,725 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:35:49,726 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##23: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv32, 0bv32;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2023-12-25 11:35:49,726 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##166: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);t1_#res#1.base, t1_#res#1.offset := 0bv32, 0bv32; [2023-12-25 11:35:49,726 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##169: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:35:49,726 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##168: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);t1_#res#1.base, t1_#res#1.offset := 0bv32, 0bv32; [2023-12-25 11:35:49,726 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##167: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:35:49,726 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##104: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);t2_#res#1.base, t2_#res#1.offset := 0bv32, 0bv32; [2023-12-25 11:35:49,727 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:35:49,727 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##118: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:35:49,727 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##117: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);t1_#res#1.base, t1_#res#1.offset := 0bv32, 0bv32; [2023-12-25 11:35:49,782 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:35:49,782 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);#res := 0bv32; [2023-12-25 11:35:56,534 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 11:35:56,693 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 11:35:56,693 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 11:35:56,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 11:35:56 BoogieIcfgContainer [2023-12-25 11:35:56,694 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 11:35:56,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 11:35:56,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 11:35:56,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 11:35:56,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 11:35:47" (1/3) ... [2023-12-25 11:35:56,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c0ce44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 11:35:56, skipping insertion in model container [2023-12-25 11:35:56,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:48" (2/3) ... [2023-12-25 11:35:56,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c0ce44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 11:35:56, skipping insertion in model container [2023-12-25 11:35:56,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 11:35:56" (3/3) ... [2023-12-25 11:35:56,701 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_queue-2.i [2023-12-25 11:35:56,715 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 11:35:56,715 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 11:35:56,778 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 11:35:56,784 INFO L357 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, mHoare=true, 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;@403d2631, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 11:35:56,784 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 11:35:56,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 337 states, 190 states have (on average 1.5052631578947369) internal successors, (286), 192 states have internal predecessors, (286), 136 states have call successors, (136), 9 states have call predecessors, (136), 9 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2023-12-25 11:35:56,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2023-12-25 11:35:56,820 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:35:56,821 INFO L195 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:35:56,824 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:35:56,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:35:56,832 INFO L85 PathProgramCache]: Analyzing trace with hash -123109884, now seen corresponding path program 1 times [2023-12-25 11:35:56,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:35:56,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464270793] [2023-12-25 11:35:56,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:35:56,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:35:56,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:35:56,852 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:35:56,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 11:35:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:35:58,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 11:35:58,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:35:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 1614 proven. 0 refuted. 0 times theorem prover too weak. 3690 trivial. 0 not checked. [2023-12-25 11:35:58,192 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:35:58,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:35:58,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464270793] [2023-12-25 11:35:58,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464270793] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:35:58,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:35:58,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 11:35:58,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043372018] [2023-12-25 11:35:58,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:35:58,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 11:35:58,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:35:58,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 11:35:58,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 11:35:58,232 INFO L87 Difference]: Start difference. First operand has 337 states, 190 states have (on average 1.5052631578947369) internal successors, (286), 192 states have internal predecessors, (286), 136 states have call successors, (136), 9 states have call predecessors, (136), 9 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2023-12-25 11:36:02,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:02,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:02,638 INFO L93 Difference]: Finished difference Result 669 states and 1234 transitions. [2023-12-25 11:36:02,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 11:36:02,641 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) Word has length 321 [2023-12-25 11:36:02,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:02,652 INFO L225 Difference]: With dead ends: 669 [2023-12-25 11:36:02,652 INFO L226 Difference]: Without dead ends: 333 [2023-12-25 11:36:02,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 11:36:02,661 INFO L413 NwaCegarLoop]: 540 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:02,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 540 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2023-12-25 11:36:02,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-12-25 11:36:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2023-12-25 11:36:02,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 188 states have (on average 1.4734042553191489) internal successors, (277), 189 states have internal predecessors, (277), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2023-12-25 11:36:02,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 547 transitions. [2023-12-25 11:36:02,734 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 547 transitions. Word has length 321 [2023-12-25 11:36:02,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:02,734 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 547 transitions. [2023-12-25 11:36:02,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2023-12-25 11:36:02,735 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 547 transitions. [2023-12-25 11:36:02,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2023-12-25 11:36:02,750 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:02,750 INFO L195 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:36:02,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 11:36:02,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:36:02,952 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:02,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:02,952 INFO L85 PathProgramCache]: Analyzing trace with hash -835447908, now seen corresponding path program 1 times [2023-12-25 11:36:02,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:02,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018197825] [2023-12-25 11:36:02,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:36:02,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:36:02,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:02,957 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:36:02,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 11:36:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:36:04,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 11:36:04,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2023-12-25 11:36:04,638 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:36:04,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:04,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018197825] [2023-12-25 11:36:04,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018197825] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:36:04,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:36:04,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 11:36:04,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530857661] [2023-12-25 11:36:04,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:36:04,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 11:36:04,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:04,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 11:36:04,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:36:04,648 INFO L87 Difference]: Start difference. First operand 333 states and 547 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2023-12-25 11:36:08,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:09,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:09,670 INFO L93 Difference]: Finished difference Result 661 states and 1086 transitions. [2023-12-25 11:36:09,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 11:36:09,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 321 [2023-12-25 11:36:09,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:09,674 INFO L225 Difference]: With dead ends: 661 [2023-12-25 11:36:09,674 INFO L226 Difference]: Without dead ends: 333 [2023-12-25 11:36:09,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:36:09,677 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 0 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:09,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1074 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2023-12-25 11:36:09,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-12-25 11:36:09,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2023-12-25 11:36:09,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 188 states have (on average 1.4680851063829787) internal successors, (276), 189 states have internal predecessors, (276), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2023-12-25 11:36:09,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 546 transitions. [2023-12-25 11:36:09,709 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 546 transitions. Word has length 321 [2023-12-25 11:36:09,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:09,709 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 546 transitions. [2023-12-25 11:36:09,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2023-12-25 11:36:09,709 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 546 transitions. [2023-12-25 11:36:09,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2023-12-25 11:36:09,715 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:09,715 INFO L195 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:36:09,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-25 11:36:09,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:36:09,939 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:09,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:09,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1904375142, now seen corresponding path program 1 times [2023-12-25 11:36:09,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:09,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034589681] [2023-12-25 11:36:09,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:36:09,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:36:09,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:09,942 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:36:09,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 11:36:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:36:11,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 1183 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 11:36:11,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2023-12-25 11:36:37,004 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:36:37,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:37,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034589681] [2023-12-25 11:36:37,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034589681] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:36:37,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:36:37,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 11:36:37,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2694148] [2023-12-25 11:36:37,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:36:37,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 11:36:37,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:37,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 11:36:37,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 11:36:37,010 INFO L87 Difference]: Start difference. First operand 333 states and 546 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (55), 3 states have call predecessors, (55), 3 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2023-12-25 11:36:41,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:45,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:50,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:33,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:37:33,580 INFO L93 Difference]: Finished difference Result 755 states and 1269 transitions. [2023-12-25 11:37:33,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 11:37:33,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (55), 3 states have call predecessors, (55), 3 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 339 [2023-12-25 11:37:33,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:37:33,591 INFO L225 Difference]: With dead ends: 755 [2023-12-25 11:37:33,592 INFO L226 Difference]: Without dead ends: 645 [2023-12-25 11:37:33,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-25 11:37:33,594 INFO L413 NwaCegarLoop]: 429 mSDtfsCounter, 610 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 490 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.6s IncrementalHoareTripleChecker+Time [2023-12-25 11:37:33,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1373 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 823 Invalid, 3 Unknown, 0 Unchecked, 55.6s Time] [2023-12-25 11:37:33,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2023-12-25 11:37:33,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 644. [2023-12-25 11:37:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 368 states have (on average 1.5733695652173914) internal successors, (579), 372 states have internal predecessors, (579), 254 states have call successors, (254), 18 states have call predecessors, (254), 21 states have return successors, (271), 256 states have call predecessors, (271), 254 states have call successors, (271) [2023-12-25 11:37:33,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1104 transitions. [2023-12-25 11:37:33,670 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1104 transitions. Word has length 339 [2023-12-25 11:37:33,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:37:33,671 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 1104 transitions. [2023-12-25 11:37:33,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (55), 3 states have call predecessors, (55), 3 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2023-12-25 11:37:33,672 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1104 transitions. [2023-12-25 11:37:33,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2023-12-25 11:37:33,683 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:37:33,683 INFO L195 NwaCegarLoop]: trace histogram [58, 58, 58, 6, 6, 6, 6, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:37:33,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 11:37:33,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:37:33,905 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:37:33,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:37:33,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1563006765, now seen corresponding path program 1 times [2023-12-25 11:37:33,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:37:33,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851241046] [2023-12-25 11:37:33,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:37:33,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:37:33,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:37:33,909 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:37:33,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 11:37:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:37:35,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 1405 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 11:37:35,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:37:35,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-25 11:37:35,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-25 11:37:36,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-12-25 11:37:36,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-12-25 11:37:38,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6680 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 6424 trivial. 0 not checked. [2023-12-25 11:37:38,060 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:37:38,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:37:38,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851241046] [2023-12-25 11:37:38,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [851241046] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:37:38,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:37:38,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 11:37:38,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86911744] [2023-12-25 11:37:38,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:37:38,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 11:37:38,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:37:38,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 11:37:38,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 11:37:38,065 INFO L87 Difference]: Start difference. First operand 644 states and 1104 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (64), 2 states have call predecessors, (64), 3 states have return successors, (64), 3 states have call predecessors, (64), 4 states have call successors, (64) [2023-12-25 11:37:42,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:46,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:03,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:38:03,943 INFO L93 Difference]: Finished difference Result 1938 states and 3337 transitions. [2023-12-25 11:38:03,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 11:38:03,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (64), 2 states have call predecessors, (64), 3 states have return successors, (64), 3 states have call predecessors, (64), 4 states have call successors, (64) Word has length 411 [2023-12-25 11:38:03,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:38:03,958 INFO L225 Difference]: With dead ends: 1938 [2023-12-25 11:38:03,958 INFO L226 Difference]: Without dead ends: 1297 [2023-12-25 11:38:03,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 11:38:03,969 INFO L413 NwaCegarLoop]: 520 mSDtfsCounter, 701 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 94 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.2s IncrementalHoareTripleChecker+Time [2023-12-25 11:38:03,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 1288 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 272 Invalid, 2 Unknown, 0 Unchecked, 25.2s Time] [2023-12-25 11:38:03,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2023-12-25 11:38:04,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 648. [2023-12-25 11:38:04,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 370 states have (on average 1.5702702702702702) internal successors, (581), 376 states have internal predecessors, (581), 254 states have call successors, (254), 18 states have call predecessors, (254), 23 states have return successors, (276), 256 states have call predecessors, (276), 254 states have call successors, (276) [2023-12-25 11:38:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1111 transitions. [2023-12-25 11:38:04,104 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1111 transitions. Word has length 411 [2023-12-25 11:38:04,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:38:04,105 INFO L495 AbstractCegarLoop]: Abstraction has 648 states and 1111 transitions. [2023-12-25 11:38:04,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (64), 2 states have call predecessors, (64), 3 states have return successors, (64), 3 states have call predecessors, (64), 4 states have call successors, (64) [2023-12-25 11:38:04,105 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1111 transitions. [2023-12-25 11:38:04,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2023-12-25 11:38:04,117 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:38:04,117 INFO L195 NwaCegarLoop]: trace histogram [58, 58, 58, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:38:04,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 11:38:04,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:38:04,341 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:38:04,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:38:04,341 INFO L85 PathProgramCache]: Analyzing trace with hash -260346736, now seen corresponding path program 1 times [2023-12-25 11:38:04,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:38:04,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986139881] [2023-12-25 11:38:04,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:38:04,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:38:04,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:38:04,343 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:38:04,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 11:38:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:38:05,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 1422 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 11:38:05,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:38:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6676 backedges. 1082 proven. 0 refuted. 0 times theorem prover too weak. 5594 trivial. 0 not checked. [2023-12-25 11:38:06,315 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:38:06,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:38:06,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986139881] [2023-12-25 11:38:06,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986139881] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:38:06,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:38:06,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 11:38:06,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26774384] [2023-12-25 11:38:06,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:38:06,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 11:38:06,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:38:06,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 11:38:06,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 11:38:06,318 INFO L87 Difference]: Start difference. First operand 648 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (64), 2 states have call predecessors, (64), 3 states have return successors, (64), 3 states have call predecessors, (64), 2 states have call successors, (64) [2023-12-25 11:38:10,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:14,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:18,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:20,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:38:20,261 INFO L93 Difference]: Finished difference Result 1279 states and 2195 transitions. [2023-12-25 11:38:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 11:38:20,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (64), 2 states have call predecessors, (64), 3 states have return successors, (64), 3 states have call predecessors, (64), 2 states have call successors, (64) Word has length 410 [2023-12-25 11:38:20,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:38:20,266 INFO L225 Difference]: With dead ends: 1279 [2023-12-25 11:38:20,266 INFO L226 Difference]: Without dead ends: 644 [2023-12-25 11:38:20,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 11:38:20,270 INFO L413 NwaCegarLoop]: 532 mSDtfsCounter, 0 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2023-12-25 11:38:20,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1583 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 3 Unknown, 0 Unchecked, 13.9s Time] [2023-12-25 11:38:20,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2023-12-25 11:38:20,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2023-12-25 11:38:20,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 368 states have (on average 1.5625) internal successors, (575), 374 states have internal predecessors, (575), 252 states have call successors, (252), 18 states have call predecessors, (252), 23 states have return successors, (274), 254 states have call predecessors, (274), 252 states have call successors, (274) [2023-12-25 11:38:20,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1101 transitions. [2023-12-25 11:38:20,328 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1101 transitions. Word has length 410 [2023-12-25 11:38:20,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:38:20,329 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 1101 transitions. [2023-12-25 11:38:20,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (64), 2 states have call predecessors, (64), 3 states have return successors, (64), 3 states have call predecessors, (64), 2 states have call successors, (64) [2023-12-25 11:38:20,329 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1101 transitions. [2023-12-25 11:38:20,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2023-12-25 11:38:20,335 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:38:20,335 INFO L195 NwaCegarLoop]: trace histogram [59, 59, 59, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:38:20,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 11:38:20,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:38:20,555 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:38:20,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:38:20,556 INFO L85 PathProgramCache]: Analyzing trace with hash -919453007, now seen corresponding path program 1 times [2023-12-25 11:38:20,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:38:20,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587667313] [2023-12-25 11:38:20,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:38:20,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:38:20,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:38:20,558 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:38:20,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 11:38:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:38:21,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 1432 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 11:38:21,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:38:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6932 backedges. 1482 proven. 0 refuted. 0 times theorem prover too weak. 5450 trivial. 0 not checked. [2023-12-25 11:38:34,516 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:38:34,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:38:34,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587667313] [2023-12-25 11:38:34,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587667313] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:38:34,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:38:34,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 11:38:34,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453483603] [2023-12-25 11:38:34,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:38:34,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:38:34,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:38:34,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:38:34,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:38:34,519 INFO L87 Difference]: Start difference. First operand 644 states and 1101 transitions. Second operand has 6 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 4 states have call successors, (64), 3 states have call predecessors, (64), 3 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2023-12-25 11:38:38,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:43,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:47,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:51,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:23,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:57,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:39:57,054 INFO L93 Difference]: Finished difference Result 1682 states and 2819 transitions. [2023-12-25 11:39:57,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 11:39:57,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 4 states have call successors, (64), 3 states have call predecessors, (64), 3 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) Word has length 418 [2023-12-25 11:39:57,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:39:57,062 INFO L225 Difference]: With dead ends: 1682 [2023-12-25 11:39:57,062 INFO L226 Difference]: Without dead ends: 1041 [2023-12-25 11:39:57,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 412 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-12-25 11:39:57,068 INFO L413 NwaCegarLoop]: 455 mSDtfsCounter, 673 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 895 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 79.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 895 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 81.1s IncrementalHoareTripleChecker+Time [2023-12-25 11:39:57,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 762 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [895 Valid, 1161 Invalid, 4 Unknown, 0 Unchecked, 81.1s Time] [2023-12-25 11:39:57,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2023-12-25 11:39:57,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 896. [2023-12-25 11:39:57,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 519 states have (on average 1.418111753371869) internal successors, (736), 512 states have internal predecessors, (736), 338 states have call successors, (338), 22 states have call predecessors, (338), 38 states have return successors, (393), 364 states have call predecessors, (393), 338 states have call successors, (393) [2023-12-25 11:39:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1467 transitions. [2023-12-25 11:39:57,187 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1467 transitions. Word has length 418 [2023-12-25 11:39:57,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:39:57,187 INFO L495 AbstractCegarLoop]: Abstraction has 896 states and 1467 transitions. [2023-12-25 11:39:57,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 4 states have call successors, (64), 3 states have call predecessors, (64), 3 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2023-12-25 11:39:57,188 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1467 transitions. [2023-12-25 11:39:57,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2023-12-25 11:39:57,196 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:39:57,197 INFO L195 NwaCegarLoop]: trace histogram [58, 58, 58, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:39:57,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 11:39:57,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:39:57,415 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:39:57,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:39:57,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1843946066, now seen corresponding path program 1 times [2023-12-25 11:39:57,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:39:57,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340362045] [2023-12-25 11:39:57,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:39:57,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:39:57,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:39:57,418 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:39:57,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 11:39:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:39:58,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 1427 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 11:39:58,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:40:06,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6676 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 6424 trivial. 0 not checked. [2023-12-25 11:40:06,634 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:40:06,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:40:06,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340362045] [2023-12-25 11:40:06,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340362045] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:40:06,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:40:06,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 11:40:06,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865115673] [2023-12-25 11:40:06,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:40:06,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 11:40:06,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:40:06,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 11:40:06,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-25 11:40:06,637 INFO L87 Difference]: Start difference. First operand 896 states and 1467 transitions. Second operand has 8 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 3 states have call successors, (64), 3 states have call predecessors, (64), 4 states have return successors, (64), 4 states have call predecessors, (64), 3 states have call successors, (64) [2023-12-25 11:40:10,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:15,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:19,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:23,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:28,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:41:25,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:41:27,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:36,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:42:36,811 INFO L93 Difference]: Finished difference Result 2091 states and 3362 transitions. [2023-12-25 11:42:36,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 11:42:36,812 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 3 states have call successors, (64), 3 states have call predecessors, (64), 4 states have return successors, (64), 4 states have call predecessors, (64), 3 states have call successors, (64) Word has length 412 [2023-12-25 11:42:36,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:42:36,822 INFO L225 Difference]: With dead ends: 2091 [2023-12-25 11:42:36,823 INFO L226 Difference]: Without dead ends: 1206 [2023-12-25 11:42:36,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-12-25 11:42:36,829 INFO L413 NwaCegarLoop]: 645 mSDtfsCounter, 907 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 749 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 145.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 3040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 749 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 148.2s IncrementalHoareTripleChecker+Time [2023-12-25 11:42:36,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1070 Valid, 1313 Invalid, 3040 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [749 Valid, 2286 Invalid, 5 Unknown, 0 Unchecked, 148.2s Time] [2023-12-25 11:42:36,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2023-12-25 11:42:36,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1181. [2023-12-25 11:42:36,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 681 states have (on average 1.3186490455212923) internal successors, (898), 671 states have internal predecessors, (898), 449 states have call successors, (449), 30 states have call predecessors, (449), 50 states have return successors, (520), 479 states have call predecessors, (520), 449 states have call successors, (520) [2023-12-25 11:42:36,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1867 transitions. [2023-12-25 11:42:36,996 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1867 transitions. Word has length 412 [2023-12-25 11:42:36,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:42:36,997 INFO L495 AbstractCegarLoop]: Abstraction has 1181 states and 1867 transitions. [2023-12-25 11:42:36,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 3 states have call successors, (64), 3 states have call predecessors, (64), 4 states have return successors, (64), 4 states have call predecessors, (64), 3 states have call successors, (64) [2023-12-25 11:42:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1867 transitions. [2023-12-25 11:42:37,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2023-12-25 11:42:37,008 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:42:37,009 INFO L195 NwaCegarLoop]: trace histogram [58, 58, 58, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:42:37,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 11:42:37,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:42:37,231 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:42:37,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:42:37,231 INFO L85 PathProgramCache]: Analyzing trace with hash -280305580, now seen corresponding path program 1 times [2023-12-25 11:42:37,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:42:37,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778509165] [2023-12-25 11:42:37,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:42:37,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:42:37,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:42:37,234 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:42:37,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 11:42:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:42:39,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 1418 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 11:42:39,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:42:39,844 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 22 [2023-12-25 11:42:40,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:42:40,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 9 [2023-12-25 11:42:43,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:42:43,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2023-12-25 11:42:43,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6676 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 6424 trivial. 0 not checked. [2023-12-25 11:42:43,707 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:42:43,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:42:43,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778509165] [2023-12-25 11:42:43,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778509165] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:42:43,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:42:43,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 11:42:43,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173033153] [2023-12-25 11:42:43,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:42:43,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 11:42:43,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:42:43,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 11:42:43,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 11:42:43,710 INFO L87 Difference]: Start difference. First operand 1181 states and 1867 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 4 states have call successors, (64), 3 states have call predecessors, (64), 3 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2023-12-25 11:42:47,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:52,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:56,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:43:46,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:43:46,411 INFO L93 Difference]: Finished difference Result 3564 states and 5640 transitions. [2023-12-25 11:43:46,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 11:43:46,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 4 states have call successors, (64), 3 states have call predecessors, (64), 3 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) Word has length 412 [2023-12-25 11:43:46,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:43:46,425 INFO L225 Difference]: With dead ends: 3564 [2023-12-25 11:43:46,426 INFO L226 Difference]: Without dead ends: 2380 [2023-12-25 11:43:46,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-25 11:43:46,431 INFO L413 NwaCegarLoop]: 353 mSDtfsCounter, 709 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 482 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 482 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 61.1s IncrementalHoareTripleChecker+Time [2023-12-25 11:43:46,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 1064 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [482 Valid, 814 Invalid, 3 Unknown, 0 Unchecked, 61.1s Time] [2023-12-25 11:43:46,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2023-12-25 11:43:46,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 2365. [2023-12-25 11:43:46,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2365 states, 1357 states have (on average 1.2851879145173175) internal successors, (1744), 1340 states have internal predecessors, (1744), 907 states have call successors, (907), 60 states have call predecessors, (907), 100 states have return successors, (1060), 965 states have call predecessors, (1060), 907 states have call successors, (1060) [2023-12-25 11:43:46,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 3711 transitions. [2023-12-25 11:43:46,778 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 3711 transitions. Word has length 412 [2023-12-25 11:43:46,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:43:46,778 INFO L495 AbstractCegarLoop]: Abstraction has 2365 states and 3711 transitions. [2023-12-25 11:43:46,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 4 states have call successors, (64), 3 states have call predecessors, (64), 3 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2023-12-25 11:43:46,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 3711 transitions. [2023-12-25 11:43:46,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2023-12-25 11:43:46,817 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:43:46,817 INFO L195 NwaCegarLoop]: trace histogram [58, 58, 58, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:43:46,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-25 11:43:47,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:43:47,042 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:43:47,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:43:47,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1532978114, now seen corresponding path program 1 times [2023-12-25 11:43:47,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:43:47,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727488825] [2023-12-25 11:43:47,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:43:47,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:43:47,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:43:47,045 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:43:47,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 11:43:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:43:49,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 1418 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 11:43:49,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:43:49,368 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 22 [2023-12-25 11:43:50,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:43:50,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 9 [2023-12-25 11:43:52,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:43:52,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2023-12-25 11:43:52,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6676 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 6424 trivial. 0 not checked. [2023-12-25 11:43:52,786 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:43:52,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:43:52,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727488825] [2023-12-25 11:43:52,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727488825] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:43:52,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:43:52,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 11:43:52,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118371496] [2023-12-25 11:43:52,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:43:52,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 11:43:52,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:43:52,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 11:43:52,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 11:43:52,789 INFO L87 Difference]: Start difference. First operand 2365 states and 3711 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 4 states have call successors, (64), 3 states have call predecessors, (64), 3 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2023-12-25 11:43:56,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:44:00,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:44:05,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:44:18,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:44:20,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:44:21,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:44:57,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:44:57,866 INFO L93 Difference]: Finished difference Result 4357 states and 6765 transitions. [2023-12-25 11:44:57,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 11:44:57,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 4 states have call successors, (64), 3 states have call predecessors, (64), 3 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) Word has length 412 [2023-12-25 11:44:57,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:44:57,877 INFO L225 Difference]: With dead ends: 4357 [2023-12-25 11:44:57,877 INFO L226 Difference]: Without dead ends: 1715 [2023-12-25 11:44:57,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-25 11:44:57,889 INFO L413 NwaCegarLoop]: 517 mSDtfsCounter, 681 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 428 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 428 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63.4s IncrementalHoareTripleChecker+Time [2023-12-25 11:44:57,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1396 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [428 Valid, 933 Invalid, 3 Unknown, 0 Unchecked, 63.4s Time] [2023-12-25 11:44:57,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2023-12-25 11:44:58,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1696. [2023-12-25 11:44:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 968 states have (on average 1.2458677685950412) internal successors, (1206), 958 states have internal predecessors, (1206), 658 states have call successors, (658), 44 states have call predecessors, (658), 69 states have return successors, (753), 693 states have call predecessors, (753), 658 states have call successors, (753) [2023-12-25 11:44:58,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2617 transitions. [2023-12-25 11:44:58,138 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2617 transitions. Word has length 412 [2023-12-25 11:44:58,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:44:58,138 INFO L495 AbstractCegarLoop]: Abstraction has 1696 states and 2617 transitions. [2023-12-25 11:44:58,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 4 states have call successors, (64), 3 states have call predecessors, (64), 3 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2023-12-25 11:44:58,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2617 transitions. [2023-12-25 11:44:58,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2023-12-25 11:44:58,151 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:44:58,151 INFO L195 NwaCegarLoop]: trace histogram [67, 67, 67, 15, 15, 15, 15, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:44:58,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 11:44:58,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:44:58,377 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:44:58,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:44:58,377 INFO L85 PathProgramCache]: Analyzing trace with hash 151858167, now seen corresponding path program 1 times [2023-12-25 11:44:58,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:44:58,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649725387] [2023-12-25 11:44:58,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:44:58,379 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:44:58,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:44:58,380 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:44:58,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 11:44:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:44:59,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 1626 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 11:44:59,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:45:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 9268 backedges. 3120 proven. 4 refuted. 0 times theorem prover too weak. 6144 trivial. 0 not checked. [2023-12-25 11:45:06,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:45:17,934 INFO L134 CoverageAnalysis]: Checked inductivity of 9268 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9264 trivial. 0 not checked. [2023-12-25 11:45:17,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:45:17,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649725387] [2023-12-25 11:45:17,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1649725387] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:45:17,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:45:17,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2023-12-25 11:45:17,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718628146] [2023-12-25 11:45:17,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:45:17,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 11:45:17,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:45:17,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 11:45:17,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-25 11:45:17,937 INFO L87 Difference]: Start difference. First operand 1696 states and 2617 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 7 states have call successors, (138), 4 states have call predecessors, (138), 4 states have return successors, (138), 5 states have call predecessors, (138), 7 states have call successors, (138) [2023-12-25 11:45:21,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:45:27,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:45:31,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:45:36,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:47:04,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:47:04,415 INFO L93 Difference]: Finished difference Result 4110 states and 6456 transitions. [2023-12-25 11:47:04,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 11:47:04,416 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 7 states have call successors, (138), 4 states have call predecessors, (138), 4 states have return successors, (138), 5 states have call predecessors, (138), 7 states have call successors, (138) Word has length 504 [2023-12-25 11:47:04,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:47:04,425 INFO L225 Difference]: With dead ends: 4110 [2023-12-25 11:47:04,425 INFO L226 Difference]: Without dead ends: 2455 [2023-12-25 11:47:04,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1010 GetRequests, 1002 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-25 11:47:04,431 INFO L413 NwaCegarLoop]: 557 mSDtfsCounter, 1117 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 837 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 103.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 837 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 105.3s IncrementalHoareTripleChecker+Time [2023-12-25 11:47:04,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 1579 Invalid, 2572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [837 Valid, 1731 Invalid, 4 Unknown, 0 Unchecked, 105.3s Time] [2023-12-25 11:47:04,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2023-12-25 11:47:04,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 2319. [2023-12-25 11:47:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2319 states, 1343 states have (on average 1.319434102755026) internal successors, (1772), 1321 states have internal predecessors, (1772), 865 states have call successors, (865), 75 states have call predecessors, (865), 110 states have return successors, (1006), 922 states have call predecessors, (1006), 865 states have call successors, (1006) [2023-12-25 11:47:04,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 3643 transitions. [2023-12-25 11:47:04,798 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 3643 transitions. Word has length 504 [2023-12-25 11:47:04,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:47:04,799 INFO L495 AbstractCegarLoop]: Abstraction has 2319 states and 3643 transitions. [2023-12-25 11:47:04,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 7 states have call successors, (138), 4 states have call predecessors, (138), 4 states have return successors, (138), 5 states have call predecessors, (138), 7 states have call successors, (138) [2023-12-25 11:47:04,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 3643 transitions. [2023-12-25 11:47:04,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2023-12-25 11:47:04,814 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:47:04,815 INFO L195 NwaCegarLoop]: trace histogram [67, 67, 67, 15, 15, 15, 15, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:47:04,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 11:47:05,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:47:05,029 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:47:05,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:47:05,030 INFO L85 PathProgramCache]: Analyzing trace with hash -685644235, now seen corresponding path program 1 times [2023-12-25 11:47:05,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:47:05,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941270186] [2023-12-25 11:47:05,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:47:05,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:47:05,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:47:05,033 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:47:05,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 11:47:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:47:07,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 1690 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 11:47:07,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:47:28,356 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 13 treesize of output 9 [2023-12-25 11:47:39,098 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 17 treesize of output 9 [2023-12-25 11:47:39,867 INFO L134 CoverageAnalysis]: Checked inductivity of 9268 backedges. 3330 proven. 0 refuted. 0 times theorem prover too weak. 5938 trivial. 0 not checked. [2023-12-25 11:47:39,867 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:47:39,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:47:39,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941270186] [2023-12-25 11:47:39,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941270186] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:47:39,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:47:39,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-25 11:47:39,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109748953] [2023-12-25 11:47:39,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:47:39,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 11:47:39,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:47:39,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 11:47:39,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-25 11:47:39,870 INFO L87 Difference]: Start difference. First operand 2319 states and 3643 transitions. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 7 states have call successors, (74), 4 states have call predecessors, (74), 6 states have return successors, (74), 7 states have call predecessors, (74), 7 states have call successors, (74) [2023-12-25 11:47:43,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:47:48,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:47:52,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:47:56,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:48:00,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:48:05,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:48:09,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-12-25 11:49:47,643 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 11:49:47,643 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 11:49:47,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 11:49:47,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 494 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2023-12-25 11:49:47,665 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 1186 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 1806 mSolverCounterSat, 1045 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 120.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 2858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1045 IncrementalHoareTripleChecker+Valid, 1806 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 122.2s IncrementalHoareTripleChecker+Time [2023-12-25 11:49:47,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 1428 Invalid, 2858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1045 Valid, 1806 Invalid, 7 Unknown, 0 Unchecked, 122.2s Time] [2023-12-25 11:49:47,667 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 11:49:47,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-25 11:49:47,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:49:47,874 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (2319states) and FLOYD_HOARE automaton (currently 13 states, 11 states before enhancement),while ReachableStatesComputation was computing reachable states (2064 states constructed, input type IntersectNwa). [2023-12-25 11:49:47,878 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:49:47,880 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 11:49:47,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 11:49:47 BoogieIcfgContainer [2023-12-25 11:49:47,881 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 11:49:47,882 INFO L158 Benchmark]: Toolchain (without parser) took 840729.51ms. Allocated memory was 285.2MB in the beginning and 442.5MB in the end (delta: 157.3MB). Free memory was 232.6MB in the beginning and 382.2MB in the end (delta: -149.6MB). Peak memory consumption was 263.5MB. Max. memory is 8.0GB. [2023-12-25 11:49:47,882 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 195.0MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 11:49:47,882 INFO L158 Benchmark]: CACSL2BoogieTranslator took 866.01ms. Allocated memory is still 285.2MB. Free memory was 232.6MB in the beginning and 184.9MB in the end (delta: 47.7MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. [2023-12-25 11:49:47,882 INFO L158 Benchmark]: Boogie Procedure Inliner took 147.02ms. Allocated memory is still 285.2MB. Free memory was 184.9MB in the beginning and 177.6MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-25 11:49:47,882 INFO L158 Benchmark]: Boogie Preprocessor took 210.72ms. Allocated memory is still 285.2MB. Free memory was 177.6MB in the beginning and 242.9MB in the end (delta: -65.3MB). Peak memory consumption was 17.0MB. Max. memory is 8.0GB. [2023-12-25 11:49:47,883 INFO L158 Benchmark]: RCFGBuilder took 8314.20ms. Allocated memory is still 285.2MB. Free memory was 242.9MB in the beginning and 236.6MB in the end (delta: 6.3MB). Peak memory consumption was 138.4MB. Max. memory is 8.0GB. [2023-12-25 11:49:47,883 INFO L158 Benchmark]: TraceAbstraction took 831185.69ms. Allocated memory was 285.2MB in the beginning and 442.5MB in the end (delta: 157.3MB). Free memory was 236.0MB in the beginning and 382.2MB in the end (delta: -146.1MB). Peak memory consumption was 266.0MB. Max. memory is 8.0GB. [2023-12-25 11:49:47,884 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 195.0MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 866.01ms. Allocated memory is still 285.2MB. Free memory was 232.6MB in the beginning and 184.9MB in the end (delta: 47.7MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 147.02ms. Allocated memory is still 285.2MB. Free memory was 184.9MB in the beginning and 177.6MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 210.72ms. Allocated memory is still 285.2MB. Free memory was 177.6MB in the beginning and 242.9MB in the end (delta: -65.3MB). Peak memory consumption was 17.0MB. Max. memory is 8.0GB. * RCFGBuilder took 8314.20ms. Allocated memory is still 285.2MB. Free memory was 242.9MB in the beginning and 236.6MB in the end (delta: 6.3MB). Peak memory consumption was 138.4MB. Max. memory is 8.0GB. * TraceAbstraction took 831185.69ms. Allocated memory was 285.2MB in the beginning and 442.5MB in the end (delta: 157.3MB). Free memory was 236.0MB in the beginning and 382.2MB in the end (delta: -146.1MB). Peak memory consumption was 266.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 775]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 775). Cancelled while NwaCegarLoop was constructing difference of abstraction (2319states) and FLOYD_HOARE automaton (currently 13 states, 11 states before enhancement),while ReachableStatesComputation was computing reachable states (2064 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 337 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 831.1s, OverallIterations: 11, TraceHistogramMax: 67, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 700.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 36 mSolverCounterUnknown, 7399 SdHoareTripleChecker+Valid, 685.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6584 mSDsluCounter, 13400 SdHoareTripleChecker+Invalid, 673.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7997 mSDsCounter, 5028 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9876 IncrementalHoareTripleChecker+Invalid, 14940 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5028 mSolverCounterUnsat, 5403 mSDtfsCounter, 9876 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4983 GetRequests, 4921 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 28.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2365occurred in iteration=8, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 990 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 8.8s SatisfiabilityAnalysisTime, 109.2s InterpolantComputationTime, 4464 NumberOfCodeBlocks, 4464 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 4956 ConstructedInterpolants, 0 QuantifiedInterpolants, 7714 SizeOfPredicates, 19 NumberOfNonLiveVariables, 15109 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 84232/84240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown