/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/verifythis/tree_del_rec_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 06:31:11,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 06:31:11,329 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 06:31:11,332 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 06:31:11,333 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 06:31:11,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 06:31:11,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 06:31:11,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 06:31:11,348 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 06:31:11,349 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 06:31:11,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 06:31:11,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 06:31:11,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 06:31:11,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 06:31:11,350 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 06:31:11,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 06:31:11,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 06:31:11,351 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 06:31:11,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 06:31:11,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 06:31:11,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 06:31:11,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 06:31:11,352 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 06:31:11,352 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 06:31:11,352 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 06:31:11,352 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 06:31:11,353 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 06:31:11,353 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 06:31:11,353 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 06:31:11,353 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 06:31:11,353 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 06:31:11,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 06:31:11,354 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 06:31:11,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 06:31:11,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:31:11,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 06:31:11,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 06:31:11,355 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 06:31:11,355 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 06:31:11,355 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 06:31:11,355 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 06:31:11,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 06:31:11,355 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 06:31:11,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 06:31:11,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 06:31:11,356 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 06:31:11,356 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 06:31:11,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 06:31:11,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 06:31:11,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 06:31:11,517 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 06:31:11,517 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 06:31:11,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c [2023-12-25 06:31:12,941 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 06:31:13,111 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 06:31:13,111 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c [2023-12-25 06:31:13,122 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4363d889/8428d039a1c145739e8b7479b49a7e2b/FLAG1be10bcf6 [2023-12-25 06:31:13,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4363d889/8428d039a1c145739e8b7479b49a7e2b [2023-12-25 06:31:13,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 06:31:13,139 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 06:31:13,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 06:31:13,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 06:31:13,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 06:31:13,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:31:13" (1/1) ... [2023-12-25 06:31:13,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d32e0d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:13, skipping insertion in model container [2023-12-25 06:31:13,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:31:13" (1/1) ... [2023-12-25 06:31:13,166 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 06:31:13,291 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c[618,631] [2023-12-25 06:31:13,314 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-25 06:31:13,315 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-25 06:31:13,337 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:31:13,353 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-25 06:31:13,355 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 06:31:13,358 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c[618,631] [2023-12-25 06:31:13,362 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-25 06:31:13,363 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-25 06:31:13,369 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:31:13,374 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 06:31:13,384 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c[618,631] [2023-12-25 06:31:13,390 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-25 06:31:13,398 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-25 06:31:13,408 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:31:13,423 INFO L206 MainTranslator]: Completed translation [2023-12-25 06:31:13,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:13 WrapperNode [2023-12-25 06:31:13,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 06:31:13,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 06:31:13,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 06:31:13,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 06:31:13,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:13" (1/1) ... [2023-12-25 06:31:13,453 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:13" (1/1) ... [2023-12-25 06:31:13,487 INFO L138 Inliner]: procedures = 31, calls = 58, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2023-12-25 06:31:13,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 06:31:13,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 06:31:13,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 06:31:13,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 06:31:13,498 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:13" (1/1) ... [2023-12-25 06:31:13,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:13" (1/1) ... [2023-12-25 06:31:13,501 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:13" (1/1) ... [2023-12-25 06:31:13,528 INFO L175 MemorySlicer]: Split 24 memory accesses to 4 slices as follows [2, 15, 5, 2]. 63 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 7 writes are split as follows [0, 4, 2, 1]. [2023-12-25 06:31:13,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:13" (1/1) ... [2023-12-25 06:31:13,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:13" (1/1) ... [2023-12-25 06:31:13,542 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:13" (1/1) ... [2023-12-25 06:31:13,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:13" (1/1) ... [2023-12-25 06:31:13,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:13" (1/1) ... [2023-12-25 06:31:13,554 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:13" (1/1) ... [2023-12-25 06:31:13,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 06:31:13,558 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 06:31:13,558 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 06:31:13,558 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 06:31:13,562 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:13" (1/1) ... [2023-12-25 06:31:13,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:31:13,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:31:13,610 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 06:31:13,622 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 06:31:13,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 06:31:13,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 06:31:13,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 06:31:13,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-25 06:31:13,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-25 06:31:13,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-25 06:31:13,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-25 06:31:13,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-25 06:31:13,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-25 06:31:13,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-12-25 06:31:13,656 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2023-12-25 06:31:13,656 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2023-12-25 06:31:13,656 INFO L130 BoogieDeclarations]: Found specification of procedure min [2023-12-25 06:31:13,656 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2023-12-25 06:31:13,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-25 06:31:13,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-25 06:31:13,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-25 06:31:13,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-25 06:31:13,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-12-25 06:31:13,657 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-12-25 06:31:13,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-25 06:31:13,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-25 06:31:13,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-25 06:31:13,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-12-25 06:31:13,658 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2023-12-25 06:31:13,658 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2023-12-25 06:31:13,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-25 06:31:13,658 INFO L130 BoogieDeclarations]: Found specification of procedure size [2023-12-25 06:31:13,658 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2023-12-25 06:31:13,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 06:31:13,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 06:31:13,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 06:31:13,659 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 06:31:13,659 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2023-12-25 06:31:13,659 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2023-12-25 06:31:13,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-25 06:31:13,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-25 06:31:13,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-25 06:31:13,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-25 06:31:13,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-25 06:31:13,790 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 06:31:13,792 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 06:31:14,138 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 06:31:14,155 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 06:31:14,156 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 06:31:14,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:31:14 BoogieIcfgContainer [2023-12-25 06:31:14,156 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 06:31:14,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 06:31:14,158 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 06:31:14,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 06:31:14,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 06:31:13" (1/3) ... [2023-12-25 06:31:14,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:31:14, skipping insertion in model container [2023-12-25 06:31:14,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:13" (2/3) ... [2023-12-25 06:31:14,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:31:14, skipping insertion in model container [2023-12-25 06:31:14,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:31:14" (3/3) ... [2023-12-25 06:31:14,164 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2023-12-25 06:31:14,178 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 06:31:14,179 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 06:31:14,221 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 06:31:14,226 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;@415cbf7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 06:31:14,226 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 06:31:14,230 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-25 06:31:14,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 06:31:14,238 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:31:14,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:31:14,239 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:31:14,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:31:14,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1984045083, now seen corresponding path program 1 times [2023-12-25 06:31:14,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:31:14,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795312790] [2023-12-25 06:31:14,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:31:14,256 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 06:31:14,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:31:14,258 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 06:31:14,287 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 06:31:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:31:14,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 06:31:14,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:31:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 06:31:14,380 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:31:14,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:31:14,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795312790] [2023-12-25 06:31:14,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795312790] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:31:14,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:31:14,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 06:31:14,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389195675] [2023-12-25 06:31:14,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:31:14,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 06:31:14,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:31:14,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 06:31:14,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 06:31:14,406 INFO L87 Difference]: Start difference. First operand has 79 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 06:31:14,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:31:14,448 INFO L93 Difference]: Finished difference Result 133 states and 176 transitions. [2023-12-25 06:31:14,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 06:31:14,451 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2023-12-25 06:31:14,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:31:14,456 INFO L225 Difference]: With dead ends: 133 [2023-12-25 06:31:14,456 INFO L226 Difference]: Without dead ends: 77 [2023-12-25 06:31:14,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 34 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 06:31:14,464 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:31:14,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:31:14,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-25 06:31:14,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-12-25 06:31:14,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-25 06:31:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2023-12-25 06:31:14,512 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 35 [2023-12-25 06:31:14,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:31:14,514 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2023-12-25 06:31:14,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 06:31:14,515 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2023-12-25 06:31:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 06:31:14,518 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:31:14,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:31:14,524 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 06:31:14,721 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 06:31:14,722 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:31:14,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:31:14,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1289853859, now seen corresponding path program 1 times [2023-12-25 06:31:14,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:31:14,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909111884] [2023-12-25 06:31:14,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:31:14,726 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 06:31:14,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:31:14,728 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 06:31:14,758 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 06:31:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:31:14,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 06:31:14,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:31:14,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 06:31:14,871 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:31:14,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:31:14,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909111884] [2023-12-25 06:31:14,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909111884] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:31:14,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:31:14,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 06:31:14,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633711778] [2023-12-25 06:31:14,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:31:14,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 06:31:14,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:31:14,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 06:31:14,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 06:31:14,874 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 06:31:14,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:31:14,902 INFO L93 Difference]: Finished difference Result 133 states and 170 transitions. [2023-12-25 06:31:14,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 06:31:14,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2023-12-25 06:31:14,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:31:14,905 INFO L225 Difference]: With dead ends: 133 [2023-12-25 06:31:14,905 INFO L226 Difference]: Without dead ends: 79 [2023-12-25 06:31:14,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 06:31:14,907 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:31:14,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 375 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:31:14,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-25 06:31:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-12-25 06:31:14,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 49 states have internal predecessors, (55), 22 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (25), 22 states have call predecessors, (25), 22 states have call successors, (25) [2023-12-25 06:31:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2023-12-25 06:31:14,920 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 35 [2023-12-25 06:31:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:31:14,920 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2023-12-25 06:31:14,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 06:31:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2023-12-25 06:31:14,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-25 06:31:14,922 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:31:14,922 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-12-25 06:31:14,929 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 (3)] Forceful destruction successful, exit code 0 [2023-12-25 06:31:15,133 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 06:31:15,133 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:31:15,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:31:15,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1627645274, now seen corresponding path program 1 times [2023-12-25 06:31:15,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:31:15,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4793531] [2023-12-25 06:31:15,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:31:15,135 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 06:31:15,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:31:15,136 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 06:31:15,139 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 06:31:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:31:15,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 06:31:15,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:31:15,435 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 06:31:15,435 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:31:15,597 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 06:31:15,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:31:15,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4793531] [2023-12-25 06:31:15,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4793531] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:31:15,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:31:15,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2023-12-25 06:31:15,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741953567] [2023-12-25 06:31:15,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:31:15,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 06:31:15,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:31:15,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 06:31:15,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-25 06:31:15,599 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-25 06:31:15,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:31:15,727 INFO L93 Difference]: Finished difference Result 141 states and 183 transitions. [2023-12-25 06:31:15,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 06:31:15,728 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 47 [2023-12-25 06:31:15,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:31:15,729 INFO L225 Difference]: With dead ends: 141 [2023-12-25 06:31:15,729 INFO L226 Difference]: Without dead ends: 81 [2023-12-25 06:31:15,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-25 06:31:15,731 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 7 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:31:15,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 592 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:31:15,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-25 06:31:15,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-12-25 06:31:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 22 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (27), 22 states have call predecessors, (27), 22 states have call successors, (27) [2023-12-25 06:31:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 105 transitions. [2023-12-25 06:31:15,739 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 105 transitions. Word has length 47 [2023-12-25 06:31:15,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:31:15,739 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 105 transitions. [2023-12-25 06:31:15,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-25 06:31:15,739 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2023-12-25 06:31:15,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 06:31:15,740 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:31:15,741 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:31:15,745 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 06:31:15,944 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 06:31:15,945 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:31:15,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:31:15,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1568532159, now seen corresponding path program 1 times [2023-12-25 06:31:15,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:31:15,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011867031] [2023-12-25 06:31:15,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:31:15,946 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 06:31:15,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:31:15,947 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 06:31:15,976 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 06:31:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:31:16,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 06:31:16,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:31:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-25 06:31:16,099 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:31:16,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:31:16,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011867031] [2023-12-25 06:31:16,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011867031] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:31:16,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:31:16,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 06:31:16,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954123200] [2023-12-25 06:31:16,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:31:16,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 06:31:16,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:31:16,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 06:31:16,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-25 06:31:16,101 INFO L87 Difference]: Start difference. First operand 81 states and 105 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-25 06:31:16,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:31:16,225 INFO L93 Difference]: Finished difference Result 141 states and 183 transitions. [2023-12-25 06:31:16,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 06:31:16,226 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 59 [2023-12-25 06:31:16,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:31:16,228 INFO L225 Difference]: With dead ends: 141 [2023-12-25 06:31:16,229 INFO L226 Difference]: Without dead ends: 83 [2023-12-25 06:31:16,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-12-25 06:31:16,234 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 41 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:31:16,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 549 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:31:16,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-25 06:31:16,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-12-25 06:31:16,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 50 states have (on average 1.14) internal successors, (57), 53 states have internal predecessors, (57), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (29), 22 states have call predecessors, (29), 22 states have call successors, (29) [2023-12-25 06:31:16,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 108 transitions. [2023-12-25 06:31:16,249 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 108 transitions. Word has length 59 [2023-12-25 06:31:16,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:31:16,249 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 108 transitions. [2023-12-25 06:31:16,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-25 06:31:16,250 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 108 transitions. [2023-12-25 06:31:16,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-25 06:31:16,251 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:31:16,251 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-12-25 06:31:16,257 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 06:31:16,458 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 06:31:16,461 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:31:16,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:31:16,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2046686025, now seen corresponding path program 1 times [2023-12-25 06:31:16,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:31:16,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506788331] [2023-12-25 06:31:16,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:31:16,462 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 06:31:16,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:31:16,466 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 06:31:16,488 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 06:31:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:31:16,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 06:31:16,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:31:16,725 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-25 06:31:16,725 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:31:16,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:31:16,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506788331] [2023-12-25 06:31:16,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1506788331] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:31:16,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:31:16,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 06:31:16,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894935134] [2023-12-25 06:31:16,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:31:16,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 06:31:16,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:31:16,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 06:31:16,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-25 06:31:16,727 INFO L87 Difference]: Start difference. First operand 83 states and 108 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-25 06:31:16,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:31:16,952 INFO L93 Difference]: Finished difference Result 135 states and 176 transitions. [2023-12-25 06:31:16,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 06:31:16,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 72 [2023-12-25 06:31:16,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:31:16,954 INFO L225 Difference]: With dead ends: 135 [2023-12-25 06:31:16,954 INFO L226 Difference]: Without dead ends: 85 [2023-12-25 06:31:16,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-12-25 06:31:16,955 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 34 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:31:16,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 544 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:31:16,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-25 06:31:16,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-12-25 06:31:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (31), 22 states have call predecessors, (31), 22 states have call successors, (31) [2023-12-25 06:31:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2023-12-25 06:31:16,964 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 72 [2023-12-25 06:31:16,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:31:16,964 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2023-12-25 06:31:16,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-25 06:31:16,965 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2023-12-25 06:31:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-25 06:31:16,967 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:31:16,967 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-25 06:31:16,987 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 06:31:17,172 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 06:31:17,172 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:31:17,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:31:17,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1573299318, now seen corresponding path program 1 times [2023-12-25 06:31:17,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:31:17,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481811150] [2023-12-25 06:31:17,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:31:17,174 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 06:31:17,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:31:17,175 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 06:31:17,180 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 06:31:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 06:31:17,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 06:31:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 06:31:17,888 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 06:31:17,889 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 06:31:17,891 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 06:31:17,903 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 06:31:18,092 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 06:31:18,095 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-25 06:31:18,098 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 06:31:18,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 06:31:18 BoogieIcfgContainer [2023-12-25 06:31:18,179 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 06:31:18,179 INFO L158 Benchmark]: Toolchain (without parser) took 5040.74ms. Allocated memory was 187.7MB in the beginning and 321.9MB in the end (delta: 134.2MB). Free memory was 132.6MB in the beginning and 248.9MB in the end (delta: -116.3MB). Peak memory consumption was 19.1MB. Max. memory is 8.0GB. [2023-12-25 06:31:18,179 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 187.7MB. Free memory is still 134.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 06:31:18,180 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.46ms. Allocated memory is still 187.7MB. Free memory was 132.3MB in the beginning and 117.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-25 06:31:18,181 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.10ms. Allocated memory is still 187.7MB. Free memory was 117.6MB in the beginning and 115.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 06:31:18,181 INFO L158 Benchmark]: Boogie Preprocessor took 69.50ms. Allocated memory is still 187.7MB. Free memory was 115.5MB in the beginning and 112.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-25 06:31:18,181 INFO L158 Benchmark]: RCFGBuilder took 597.73ms. Allocated memory was 187.7MB in the beginning and 321.9MB in the end (delta: 134.2MB). Free memory was 112.0MB in the beginning and 277.6MB in the end (delta: -165.6MB). Peak memory consumption was 22.9MB. Max. memory is 8.0GB. [2023-12-25 06:31:18,181 INFO L158 Benchmark]: TraceAbstraction took 4021.37ms. Allocated memory is still 321.9MB. Free memory was 276.6MB in the beginning and 248.9MB in the end (delta: 27.7MB). Peak memory consumption was 27.7MB. Max. memory is 8.0GB. [2023-12-25 06:31:18,183 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.12ms. Allocated memory is still 187.7MB. Free memory is still 134.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 284.46ms. Allocated memory is still 187.7MB. Free memory was 132.3MB in the beginning and 117.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.10ms. Allocated memory is still 187.7MB. Free memory was 117.6MB in the beginning and 115.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 69.50ms. Allocated memory is still 187.7MB. Free memory was 115.5MB in the beginning and 112.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 597.73ms. Allocated memory was 187.7MB in the beginning and 321.9MB in the end (delta: 134.2MB). Free memory was 112.0MB in the beginning and 277.6MB in the end (delta: -165.6MB). Peak memory consumption was 22.9MB. Max. memory is 8.0GB. * TraceAbstraction took 4021.37ms. Allocated memory is still 321.9MB. Free memory was 276.6MB in the beginning and 248.9MB in the end (delta: 27.7MB). Peak memory consumption was 27.7MB. 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 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L98] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [n={5:0}] [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L31] RET, EXPR nondet_tree() VAL [n={5:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={5:0}, n={5:0}] [L98] RET, EXPR nondet_tree() [L98] CALL task(nondet_tree()) [L76] CALL, EXPR min(t) VAL [n={5:0}] [L37] COND FALSE !(!n) [L40] EXPR n->left VAL [n={5:0}, n={5:0}] [L40] CALL, EXPR min(n->left) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L40] RET, EXPR min(n->left) VAL [n={5:0}, n={5:0}] [L40] int a = min(n->left); [L41] EXPR n->right VAL [a=2147483647, n={5:0}, n={5:0}] [L41] CALL, EXPR min(n->right) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L41] RET, EXPR min(n->right) VAL [a=2147483647, n={5:0}, n={5:0}] [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; VAL [\result=2147483647, a=2147483647, b=2147483647, n={5:0}, n={5:0}] [L76] RET, EXPR min(t) VAL [t={5:0}, t={5:0}] [L76] int a = min(t); [L77] int b; VAL [a=2147483647, b={7:0}, t={5:0}, t={5:0}] [L79] CALL, EXPR size(t) VAL [t={5:0}] [L71] COND FALSE !(!t) [L72] EXPR t->left VAL [t={5:0}, t={5:0}] [L72] CALL, EXPR size(t->left) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] RET, EXPR size(t->left) VAL [t={5:0}, t={5:0}] [L72] EXPR t->right VAL [t={5:0}, t={5:0}] [L72] CALL, EXPR size(t->right) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] RET, EXPR size(t->right) VAL [t={5:0}, t={5:0}] [L72] return size(t->left) + size(t->right) + 1; [L79] RET, EXPR size(t) VAL [a=2147483647, b={7:0}, t={5:0}, t={5:0}] [L79] int n = size(t); [L80] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L80] RET assume_abort_if_not(n != 0) [L81] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={7:0}, n=1, t={5:0}, t={5:0}] [L81] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={7:0}, n=1, t={5:0}, t={5:0}, x={4:0}] [L82] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={4:0}, t={5:0}] [L60] COND FALSE !(!t) [L63] EXPR t->left VAL [\old(i)=1, a={4:0}, a={4:0}, i=1, t={5:0}, t={5:0}] [L63] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={4:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=1, \result=1, a={4:0}, a={4:0}, i=1, t={0:0}, t={0:0}] [L63] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={4:0}, a={4:0}, i=1, t={5:0}, t={5:0}] [L63] i = tree_inorder(t->left, a, i) [L64] EXPR i++ [L64] EXPR t->data [L64] a[i++] = t->data [L65] EXPR t->right VAL [\old(i)=1, a={4:0}, a={4:0}, i=2, t={5:0}, t={5:0}] [L65] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={4:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=2, \result=2, a={4:0}, a={4:0}, i=2, t={0:0}, t={0:0}] [L65] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={4:0}, a={4:0}, i=2, t={5:0}, t={5:0}] [L65] i = tree_inorder(t->right, a, i) [L66] return i; VAL [\old(i)=1, \result=2, a={4:0}, a={4:0}, i=2, t={5:0}, t={5:0}] [L82] RET tree_inorder(t, x, n) VAL [a=2147483647, b={7:0}, n=1, t={5:0}, t={5:0}, x={4:0}] [L83] EXPR x[0] [L83] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 90 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 82 mSDsluCounter, 2157 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1697 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 277 IncrementalHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 460 mSDtfsCounter, 277 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=5, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 570 SizeOfPredicates, 16 NumberOfNonLiveVariables, 848 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 80/84 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 proved your program to be incorrect! [2023-12-25 06:31:18,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...