/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.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 06:31:09,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 06:31:09,792 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:09,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 06:31:09,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 06:31:09,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 06:31:09,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 06:31:09,834 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 06:31:09,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 06:31:09,838 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 06:31:09,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 06:31:09,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 06:31:09,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 06:31:09,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 06:31:09,840 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 06:31:09,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 06:31:09,847 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 06:31:09,847 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 06:31:09,848 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 06:31:09,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 06:31:09,848 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 06:31:09,848 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 06:31:09,848 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 06:31:09,849 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 06:31:09,849 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 06:31:09,850 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 06:31:09,850 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 06:31:09,850 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 06:31:09,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 06:31:09,850 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 06:31:09,851 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 06:31:09,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 06:31:09,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 06:31:09,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 06:31:09,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:31:09,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 06:31:09,852 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 06:31:09,852 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 06:31:09,852 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 06:31:09,852 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 06:31:09,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 06:31:09,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 06:31:09,853 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 06:31:09,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 06:31:09,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 06:31:09,853 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 06:31:09,853 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:10,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 06:31:10,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 06:31:10,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 06:31:10,209 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 06:31:10,209 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 06:31:10,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_rec.c [2023-12-25 06:31:11,752 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 06:31:12,100 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 06:31:12,100 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec.c [2023-12-25 06:31:12,118 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ae1f67a1/4a0e041e4b194ecdaea95d49f2892768/FLAG2ae2b6148 [2023-12-25 06:31:12,149 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ae1f67a1/4a0e041e4b194ecdaea95d49f2892768 [2023-12-25 06:31:12,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 06:31:12,152 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 06:31:12,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 06:31:12,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 06:31:12,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 06:31:12,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:31:12" (1/1) ... [2023-12-25 06:31:12,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd5c3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:12, skipping insertion in model container [2023-12-25 06:31:12,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:31:12" (1/1) ... [2023-12-25 06:31:12,198 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 06:31:12,374 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.c[585,598] [2023-12-25 06:31:12,390 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-25 06:31:12,392 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-25 06:31:12,417 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:31:12,430 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-25 06:31:12,437 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 06:31:12,444 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.c[585,598] [2023-12-25 06:31:12,450 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-25 06:31:12,453 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-25 06:31:12,468 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:31:12,475 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 06:31:12,485 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.c[585,598] [2023-12-25 06:31:12,493 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-25 06:31:12,494 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-25 06:31:12,509 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:31:12,521 INFO L206 MainTranslator]: Completed translation [2023-12-25 06:31:12,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:12 WrapperNode [2023-12-25 06:31:12,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 06:31:12,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 06:31:12,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 06:31:12,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 06:31:12,527 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:12" (1/1) ... [2023-12-25 06:31:12,534 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:12" (1/1) ... [2023-12-25 06:31:12,546 INFO L138 Inliner]: procedures = 31, calls = 61, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2023-12-25 06:31:12,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 06:31:12,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 06:31:12,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 06:31:12,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 06:31:12,555 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:12" (1/1) ... [2023-12-25 06:31:12,555 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:12" (1/1) ... [2023-12-25 06:31:12,559 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:12" (1/1) ... [2023-12-25 06:31:12,574 INFO L175 MemorySlicer]: Split 25 memory accesses to 4 slices as follows [2, 5, 2, 16]. 64 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, 2, 1, 4]. [2023-12-25 06:31:12,574 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:12" (1/1) ... [2023-12-25 06:31:12,575 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:12" (1/1) ... [2023-12-25 06:31:12,582 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:12" (1/1) ... [2023-12-25 06:31:12,584 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:12" (1/1) ... [2023-12-25 06:31:12,586 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:12" (1/1) ... [2023-12-25 06:31:12,587 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:12" (1/1) ... [2023-12-25 06:31:12,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 06:31:12,591 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 06:31:12,591 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 06:31:12,591 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 06:31:12,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:12" (1/1) ... [2023-12-25 06:31:12,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:31:12,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:31:12,623 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:12,642 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:12,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 06:31:12,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 06:31:12,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 06:31:12,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-25 06:31:12,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-25 06:31:12,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-25 06:31:12,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-25 06:31:12,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-25 06:31:12,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-25 06:31:12,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-12-25 06:31:12,658 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2023-12-25 06:31:12,658 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2023-12-25 06:31:12,658 INFO L130 BoogieDeclarations]: Found specification of procedure min [2023-12-25 06:31:12,658 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2023-12-25 06:31:12,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-25 06:31:12,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-25 06:31:12,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-25 06:31:12,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-25 06:31:12,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-12-25 06:31:12,659 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-12-25 06:31:12,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-25 06:31:12,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-25 06:31:12,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-25 06:31:12,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-12-25 06:31:12,659 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2023-12-25 06:31:12,659 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2023-12-25 06:31:12,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-25 06:31:12,659 INFO L130 BoogieDeclarations]: Found specification of procedure size [2023-12-25 06:31:12,659 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2023-12-25 06:31:12,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 06:31:12,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 06:31:12,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 06:31:12,660 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 06:31:12,660 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2023-12-25 06:31:12,660 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2023-12-25 06:31:12,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-25 06:31:12,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-25 06:31:12,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-25 06:31:12,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-25 06:31:12,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-25 06:31:12,750 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 06:31:12,751 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 06:31:12,991 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 06:31:13,009 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 06:31:13,009 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 06:31:13,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:31:13 BoogieIcfgContainer [2023-12-25 06:31:13,010 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 06:31:13,011 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 06:31:13,012 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 06:31:13,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 06:31:13,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 06:31:12" (1/3) ... [2023-12-25 06:31:13,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@425a1efa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:31:13, skipping insertion in model container [2023-12-25 06:31:13,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:12" (2/3) ... [2023-12-25 06:31:13,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@425a1efa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:31:13, skipping insertion in model container [2023-12-25 06:31:13,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:31:13" (3/3) ... [2023-12-25 06:31:13,016 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_rec.c [2023-12-25 06:31:13,028 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 06:31:13,028 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 06:31:13,068 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 06:31:13,075 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;@26656c80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 06:31:13,075 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 06:31:13,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 50 states have (on average 1.28) internal successors, (64), 51 states have internal predecessors, (64), 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:13,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 06:31:13,086 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:31:13,087 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:13,087 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:31:13,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:31:13,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1569702549, now seen corresponding path program 1 times [2023-12-25 06:31:13,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:31:13,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903681881] [2023-12-25 06:31:13,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:31:13,104 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:13,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:31:13,106 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:13,153 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:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:31:13,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 06:31:13,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:31:13,319 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:13,319 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:31:13,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:31:13,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903681881] [2023-12-25 06:31:13,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903681881] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:31:13,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:31:13,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 06:31:13,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402797321] [2023-12-25 06:31:13,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:31:13,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 06:31:13,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:31:13,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 06:31:13,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 06:31:13,345 INFO L87 Difference]: Start difference. First operand has 81 states, 50 states have (on average 1.28) internal successors, (64), 51 states have internal predecessors, (64), 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 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:13,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:31:13,439 INFO L93 Difference]: Finished difference Result 139 states and 189 transitions. [2023-12-25 06:31:13,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 06:31:13,443 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:13,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:31:13,452 INFO L225 Difference]: With dead ends: 139 [2023-12-25 06:31:13,452 INFO L226 Difference]: Without dead ends: 80 [2023-12-25 06:31:13,458 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:13,463 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 2 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:31:13,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 390 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:31:13,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-25 06:31:13,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-12-25 06:31:13,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 49 states have (on average 1.163265306122449) internal successors, (57), 50 states have internal predecessors, (57), 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:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2023-12-25 06:31:13,508 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 35 [2023-12-25 06:31:13,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:31:13,508 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2023-12-25 06:31:13,508 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:13,508 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2023-12-25 06:31:13,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-25 06:31:13,512 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:31:13,512 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:13,561 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 (2)] Ended with exit code 0 [2023-12-25 06:31:13,731 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:13,732 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:31:13,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:31:13,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1164948578, now seen corresponding path program 1 times [2023-12-25 06:31:13,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:31:13,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940733335] [2023-12-25 06:31:13,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:31:13,733 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:13,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:31:13,745 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:13,804 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:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:31:13,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 06:31:13,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:31:14,058 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:14,059 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:31:14,248 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:14,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:31:14,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940733335] [2023-12-25 06:31:14,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940733335] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:31:14,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:31:14,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2023-12-25 06:31:14,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988345326] [2023-12-25 06:31:14,249 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:31:14,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 06:31:14,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:31:14,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 06:31:14,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-25 06:31:14,259 INFO L87 Difference]: Start difference. First operand 80 states and 104 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:14,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:31:14,398 INFO L93 Difference]: Finished difference Result 142 states and 185 transitions. [2023-12-25 06:31:14,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 06:31:14,399 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:14,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:31:14,400 INFO L225 Difference]: With dead ends: 142 [2023-12-25 06:31:14,400 INFO L226 Difference]: Without dead ends: 82 [2023-12-25 06:31:14,401 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:14,401 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 9 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:31:14,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 440 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:31:14,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-25 06:31:14,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-12-25 06:31:14,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.16) internal successors, (58), 52 states have internal predecessors, (58), 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:14,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 107 transitions. [2023-12-25 06:31:14,419 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 107 transitions. Word has length 47 [2023-12-25 06:31:14,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:31:14,419 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 107 transitions. [2023-12-25 06:31:14,419 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:14,419 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 107 transitions. [2023-12-25 06:31:14,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 06:31:14,422 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:31:14,422 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:14,428 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:14,626 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:14,626 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:31:14,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:31:14,627 INFO L85 PathProgramCache]: Analyzing trace with hash 146784617, now seen corresponding path program 1 times [2023-12-25 06:31:14,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:31:14,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014280364] [2023-12-25 06:31:14,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:31:14,628 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,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:31:14,642 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:14,688 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:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:31:14,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 06:31:14,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:31:14,970 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:14,970 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:31:14,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:31:14,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014280364] [2023-12-25 06:31:14,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014280364] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:31:14,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:31:14,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 06:31:14,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582120467] [2023-12-25 06:31:14,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:31:14,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 06:31:14,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:31:14,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 06:31:14,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-25 06:31:14,973 INFO L87 Difference]: Start difference. First operand 82 states and 107 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:15,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:31:15,130 INFO L93 Difference]: Finished difference Result 142 states and 185 transitions. [2023-12-25 06:31:15,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 06:31:15,131 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:15,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:31:15,135 INFO L225 Difference]: With dead ends: 142 [2023-12-25 06:31:15,135 INFO L226 Difference]: Without dead ends: 84 [2023-12-25 06:31:15,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 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:15,139 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 43 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 561 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:15,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 561 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:15,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-25 06:31:15,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-12-25 06:31:15,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 54 states have internal predecessors, (59), 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:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 110 transitions. [2023-12-25 06:31:15,147 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 110 transitions. Word has length 59 [2023-12-25 06:31:15,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:31:15,147 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 110 transitions. [2023-12-25 06:31:15,147 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:15,147 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2023-12-25 06:31:15,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-25 06:31:15,148 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:31:15,149 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:15,173 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,352 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,353 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:31:15,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:31:15,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1976244599, now seen corresponding path program 1 times [2023-12-25 06:31:15,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:31:15,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955172737] [2023-12-25 06:31:15,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:31:15,354 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,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:31:15,355 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,413 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:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:31:15,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 06:31:15,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:31:15,642 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:15,642 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:31:15,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:31:15,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955172737] [2023-12-25 06:31:15,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [955172737] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:31:15,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:31:15,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 06:31:15,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280997339] [2023-12-25 06:31:15,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:31:15,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 06:31:15,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:31:15,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 06:31:15,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-25 06:31:15,644 INFO L87 Difference]: Start difference. First operand 84 states and 110 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:15,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:31:15,810 INFO L93 Difference]: Finished difference Result 136 states and 178 transitions. [2023-12-25 06:31:15,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 06:31:15,811 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:15,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:31:15,812 INFO L225 Difference]: With dead ends: 136 [2023-12-25 06:31:15,812 INFO L226 Difference]: Without dead ends: 86 [2023-12-25 06:31:15,812 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:15,813 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 34 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 558 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.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:31:15,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 558 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:31:15,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-25 06:31:15,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-12-25 06:31:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 56 states have internal predecessors, (60), 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:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 113 transitions. [2023-12-25 06:31:15,822 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 113 transitions. Word has length 72 [2023-12-25 06:31:15,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:31:15,822 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 113 transitions. [2023-12-25 06:31:15,823 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:15,823 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 113 transitions. [2023-12-25 06:31:15,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-25 06:31:15,823 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:31:15,824 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:15,832 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,030 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,031 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:31:16,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:31:16,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1845875786, now seen corresponding path program 1 times [2023-12-25 06:31:16,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:31:16,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446228865] [2023-12-25 06:31:16,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:31:16,033 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,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:31:16,044 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,088 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,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 06:31:16,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 06:31:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 06:31:17,069 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 06:31:17,069 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 06:31:17,070 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 06:31:17,081 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,272 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,274 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-25 06:31:17,277 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 06:31:17,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 06:31:17 BoogieIcfgContainer [2023-12-25 06:31:17,319 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 06:31:17,319 INFO L158 Benchmark]: Toolchain (without parser) took 5167.55ms. Allocated memory is still 243.3MB. Free memory was 208.3MB in the beginning and 137.7MB in the end (delta: 70.6MB). Peak memory consumption was 71.7MB. Max. memory is 8.0GB. [2023-12-25 06:31:17,319 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 172.0MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 06:31:17,319 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.63ms. Allocated memory is still 243.3MB. Free memory was 207.8MB in the beginning and 193.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-25 06:31:17,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.63ms. Allocated memory is still 243.3MB. Free memory was 193.0MB in the beginning and 191.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 06:31:17,320 INFO L158 Benchmark]: Boogie Preprocessor took 42.72ms. Allocated memory is still 243.3MB. Free memory was 191.5MB in the beginning and 187.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-25 06:31:17,324 INFO L158 Benchmark]: RCFGBuilder took 419.31ms. Allocated memory is still 243.3MB. Free memory was 187.3MB in the beginning and 160.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2023-12-25 06:31:17,324 INFO L158 Benchmark]: TraceAbstraction took 4307.37ms. Allocated memory is still 243.3MB. Free memory was 159.0MB in the beginning and 137.7MB in the end (delta: 21.3MB). Peak memory consumption was 22.4MB. Max. memory is 8.0GB. [2023-12-25 06:31:17,325 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.37ms. Allocated memory is still 172.0MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 367.63ms. Allocated memory is still 243.3MB. Free memory was 207.8MB in the beginning and 193.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.63ms. Allocated memory is still 243.3MB. Free memory was 193.0MB in the beginning and 191.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.72ms. Allocated memory is still 243.3MB. Free memory was 191.5MB in the beginning and 187.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 419.31ms. Allocated memory is still 243.3MB. Free memory was 187.3MB in the beginning and 160.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 4307.37ms. Allocated memory is still 243.3MB. Free memory was 159.0MB in the beginning and 137.7MB in the end (delta: 21.3MB). Peak memory consumption was 22.4MB. 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: [L102] 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}] [L102] RET, EXPR nondet_tree() [L102] CALL task(nondet_tree()) [L78] CALL, EXPR min(t) VAL [n={5:0}] [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left VAL [a=2147483647, n={5:0}, n={5:0}] [L41] 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}] [L41] RET, EXPR min(n->left) VAL [a=2147483647, n={5:0}, n={5:0}] [L41] int b = min(n->left); [L42] EXPR n->right VAL [a=2147483647, b=2147483647, n={5:0}, n={5:0}] [L42] 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}] [L42] RET, EXPR min(n->right) VAL [a=2147483647, b=2147483647, n={5:0}, n={5:0}] [L42] int c = min(n->right); [L43] COND TRUE b <= a && b <= c [L43] return b; VAL [\result=2147483647, a=2147483647, b=2147483647, c=2147483647, n={5:0}, n={5:0}] [L78] RET, EXPR min(t) VAL [t={5:0}, t={5:0}] [L78] int a = min(t); [L79] int b; VAL [a=2147483647, b={7:0}, t={5:0}, t={5:0}] [L81] CALL, EXPR size(t) VAL [t={5:0}] [L73] COND FALSE !(!t) [L74] EXPR t->left VAL [t={5:0}, t={5:0}] [L74] CALL, EXPR size(t->left) VAL [t={0:0}] [L73] COND TRUE !t [L73] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L74] RET, EXPR size(t->left) VAL [t={5:0}, t={5:0}] [L74] EXPR t->right VAL [t={5:0}, t={5:0}] [L74] CALL, EXPR size(t->right) VAL [t={0:0}] [L73] COND TRUE !t [L73] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L74] RET, EXPR size(t->right) VAL [t={5:0}, t={5:0}] [L74] return size(t->left) + size(t->right) + 1; [L81] RET, EXPR size(t) VAL [a=2147483647, b={7:0}, t={5:0}, t={5:0}] [L81] int n = size(t); [L82] CALL assume_cycle_if_not(n != 0) [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L82] RET assume_cycle_if_not(n != 0) [L83] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={7:0}, n=1, t={5:0}, t={5:0}] [L83] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={7:0}, n=1, t={5:0}, t={5:0}, x={4:0}] [L84] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={4:0}, t={5:0}] [L62] COND FALSE !(!t) [L65] EXPR t->left VAL [\old(i)=1, a={4:0}, a={4:0}, i=1, t={5:0}, t={5:0}] [L65] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={4:0}, t={0:0}] [L62] COND TRUE !t [L63] return i; VAL [\old(i)=1, \result=1, a={4:0}, a={4:0}, i=1, t={0:0}, t={0:0}] [L65] 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}] [L65] i = tree_inorder(t->left, a, i) [L66] EXPR i++ [L66] EXPR t->data [L66] a[i++] = t->data [L67] EXPR t->right VAL [\old(i)=1, a={4:0}, a={4:0}, i=2, t={5:0}, t={5:0}] [L67] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={4:0}, t={0:0}] [L62] COND TRUE !t [L63] return i; VAL [\old(i)=2, \result=2, a={4:0}, a={4:0}, i=2, t={0:0}, t={0:0}] [L67] 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}] [L67] i = tree_inorder(t->right, a, i) [L68] return i; VAL [\old(i)=1, \result=2, a={4:0}, a={4:0}, i=2, t={5:0}, t={5:0}] [L84] RET tree_inorder(t, x, n) VAL [a=2147483647, b={7:0}, n=1, t={5:0}, t={5:0}, x={4:0}] [L85] EXPR x[0] [L85] 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, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 1949 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1576 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 261 IncrementalHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 373 mSDtfsCounter, 261 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=4, InterpolantAutomatonStates: 28, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 536 SizeOfPredicates, 16 NumberOfNonLiveVariables, 733 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 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:17,345 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...