/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_iter.c


--------------------------------------------------------------------------------


This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m
[2023-12-25 00:11:51,864 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2023-12-25 00:11:52,013 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 00:11:52,026 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2023-12-25 00:11:52,027 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-12-25 00:11:52,071 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2023-12-25 00:11:52,071 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-12-25 00:11:52,072 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-12-25 00:11:52,072 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2023-12-25 00:11:52,076 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2023-12-25 00:11:52,076 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-12-25 00:11:52,076 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-12-25 00:11:52,077 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-12-25 00:11:52,078 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2023-12-25 00:11:52,078 INFO  L153        SettingsManager]:  * Use SBE=true
[2023-12-25 00:11:52,079 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-12-25 00:11:52,079 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-12-25 00:11:52,079 INFO  L153        SettingsManager]:  * sizeof long=4
[2023-12-25 00:11:52,079 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2023-12-25 00:11:52,080 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2023-12-25 00:11:52,080 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-12-25 00:11:52,080 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-12-25 00:11:52,081 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-12-25 00:11:52,081 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2023-12-25 00:11:52,081 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2023-12-25 00:11:52,081 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2023-12-25 00:11:52,081 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2023-12-25 00:11:52,081 INFO  L153        SettingsManager]:  * sizeof long double=12
[2023-12-25 00:11:52,082 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2023-12-25 00:11:52,082 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2023-12-25 00:11:52,088 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-12-25 00:11:52,089 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-12-25 00:11:52,089 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2023-12-25 00:11:52,089 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-12-25 00:11:52,089 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-12-25 00:11:52,089 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-12-25 00:11:52,089 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-12-25 00:11:52,090 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2023-12-25 00:11:52,090 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2023-12-25 00:11:52,090 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2023-12-25 00:11:52,090 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2023-12-25 00:11:52,090 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-12-25 00:11:52,090 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-12-25 00:11:52,091 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-12-25 00:11:52,091 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-12-25 00:11:52,091 INFO  L153        SettingsManager]:  * Logic for external solver=AUFBV
[2023-12-25 00:11:52,091 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 00:11:52,483 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-12-25 00:11:52,507 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-12-25 00:11:52,509 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-12-25 00:11:52,510 INFO  L270        PluginConnector]: Initializing CDTParser...
[2023-12-25 00:11:52,514 INFO  L274        PluginConnector]: CDTParser initialized
[2023-12-25 00:11:52,516 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter.c
[2023-12-25 00:11:54,602 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2023-12-25 00:11:54,973 INFO  L384              CDTParser]: Found 1 translation units.
[2023-12-25 00:11:54,973 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c
[2023-12-25 00:11:54,980 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42f74f935/3fcefb992f5e4dbbac848cef46c020d2/FLAG7d061d489
[2023-12-25 00:11:55,008 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42f74f935/3fcefb992f5e4dbbac848cef46c020d2
[2023-12-25 00:11:55,011 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-12-25 00:11:55,027 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2023-12-25 00:11:55,030 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-12-25 00:11:55,030 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-12-25 00:11:55,034 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-12-25 00:11:55,034 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:11:55" (1/1) ...
[2023-12-25 00:11:55,035 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56cfaba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:11:55, skipping insertion in model container
[2023-12-25 00:11:55,035 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:11:55" (1/1) ...
[2023-12-25 00:11:55,081 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2023-12-25 00:11:55,360 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_iter.c[586,599]
[2023-12-25 00:11:55,413 WARN  L1574              CHandler]: Possible shadowing of function min
[2023-12-25 00:11:55,434 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-12-25 00:11:55,453 INFO  L199         MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution]
[2023-12-25 00:11:55,463 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2023-12-25 00:11:55,468 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_iter.c[586,599]
[2023-12-25 00:11:55,481 WARN  L1574              CHandler]: Possible shadowing of function min
[2023-12-25 00:11:55,498 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-12-25 00:11:55,508 INFO  L202         MainTranslator]: Completed pre-run
[2023-12-25 00:11:55,522 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_iter.c[586,599]
[2023-12-25 00:11:55,539 WARN  L1574              CHandler]: Possible shadowing of function min
[2023-12-25 00:11:55,553 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-12-25 00:11:55,567 INFO  L206         MainTranslator]: Completed translation
[2023-12-25 00:11:55,567 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:11:55 WrapperNode
[2023-12-25 00:11:55,567 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-12-25 00:11:55,570 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-12-25 00:11:55,570 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-12-25 00:11:55,570 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-12-25 00:11:55,576 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:11:55" (1/1) ...
[2023-12-25 00:11:55,598 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:11:55" (1/1) ...
[2023-12-25 00:11:55,622 INFO  L138                Inliner]: procedures = 31, calls = 64, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 107
[2023-12-25 00:11:55,623 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-12-25 00:11:55,623 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-12-25 00:11:55,623 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-12-25 00:11:55,623 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-12-25 00:11:55,632 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:11:55" (1/1) ...
[2023-12-25 00:11:55,633 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:11:55" (1/1) ...
[2023-12-25 00:11:55,647 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:11:55" (1/1) ...
[2023-12-25 00:11:55,678 INFO  L175           MemorySlicer]: Split 28 memory accesses to 4 slices as follows [2, 2, 5, 19]. 68 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, 1, 2, 4].
[2023-12-25 00:11:55,678 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:11:55" (1/1) ...
[2023-12-25 00:11:55,679 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:11:55" (1/1) ...
[2023-12-25 00:11:55,694 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:11:55" (1/1) ...
[2023-12-25 00:11:55,696 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:11:55" (1/1) ...
[2023-12-25 00:11:55,698 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:11:55" (1/1) ...
[2023-12-25 00:11:55,711 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:11:55" (1/1) ...
[2023-12-25 00:11:55,714 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-12-25 00:11:55,715 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-12-25 00:11:55,715 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-12-25 00:11:55,715 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-12-25 00:11:55,716 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:11:55" (1/1) ...
[2023-12-25 00:11:55,724 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-12-25 00:11:55,733 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-12-25 00:11:55,744 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 00:11:55,759 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 00:11:55,796 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-12-25 00:11:55,797 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2023-12-25 00:11:55,797 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2023-12-25 00:11:55,797 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2
[2023-12-25 00:11:55,797 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3
[2023-12-25 00:11:55,797 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-12-25 00:11:55,797 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#0
[2023-12-25 00:11:55,798 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#1
[2023-12-25 00:11:55,798 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#2
[2023-12-25 00:11:55,798 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#3
[2023-12-25 00:11:55,798 INFO  L130     BoogieDeclarations]: Found specification of procedure min
[2023-12-25 00:11:55,799 INFO  L138     BoogieDeclarations]: Found implementation of procedure min
[2023-12-25 00:11:55,799 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0
[2023-12-25 00:11:55,799 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1
[2023-12-25 00:11:55,799 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2
[2023-12-25 00:11:55,800 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3
[2023-12-25 00:11:55,800 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.meminit
[2023-12-25 00:11:55,800 INFO  L138     BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit
[2023-12-25 00:11:55,802 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#0
[2023-12-25 00:11:55,802 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#1
[2023-12-25 00:11:55,802 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#2
[2023-12-25 00:11:55,802 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#3
[2023-12-25 00:11:55,802 INFO  L130     BoogieDeclarations]: Found specification of procedure nondet_tree
[2023-12-25 00:11:55,803 INFO  L138     BoogieDeclarations]: Found implementation of procedure nondet_tree
[2023-12-25 00:11:55,803 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-12-25 00:11:55,803 INFO  L130     BoogieDeclarations]: Found specification of procedure size
[2023-12-25 00:11:55,803 INFO  L138     BoogieDeclarations]: Found implementation of procedure size
[2023-12-25 00:11:55,803 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-12-25 00:11:55,803 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-12-25 00:11:55,803 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2023-12-25 00:11:55,803 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2023-12-25 00:11:55,803 INFO  L130     BoogieDeclarations]: Found specification of procedure tree_inorder
[2023-12-25 00:11:55,803 INFO  L138     BoogieDeclarations]: Found implementation of procedure tree_inorder
[2023-12-25 00:11:55,804 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-12-25 00:11:55,804 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0
[2023-12-25 00:11:55,804 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1
[2023-12-25 00:11:55,804 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2
[2023-12-25 00:11:55,804 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3
[2023-12-25 00:11:56,048 INFO  L241             CfgBuilder]: Building ICFG
[2023-12-25 00:11:56,050 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-12-25 00:11:56,737 INFO  L282             CfgBuilder]: Performing block encoding
[2023-12-25 00:11:56,780 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-12-25 00:11:56,781 INFO  L309             CfgBuilder]: Removed 3 assume(true) statements.
[2023-12-25 00:11:56,781 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:11:56 BoogieIcfgContainer
[2023-12-25 00:11:56,781 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-12-25 00:11:56,784 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-12-25 00:11:56,784 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2023-12-25 00:11:56,788 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2023-12-25 00:11:56,788 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 12:11:55" (1/3) ...
[2023-12-25 00:11:56,789 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31609e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:11:56, skipping insertion in model container
[2023-12-25 00:11:56,789 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:11:55" (2/3) ...
[2023-12-25 00:11:56,789 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31609e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:11:56, skipping insertion in model container
[2023-12-25 00:11:56,789 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:11:56" (3/3) ...
[2023-12-25 00:11:56,791 INFO  L112   eAbstractionObserver]: Analyzing ICFG tree_del_iter.c
[2023-12-25 00:11:56,807 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-12-25 00:11:56,808 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-12-25 00:11:56,902 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-12-25 00:11:56,914 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;@370da094, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-12-25 00:11:56,915 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-12-25 00:11:56,923 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 77 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 50 states have internal predecessors, (65), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2023-12-25 00:11:56,936 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2023-12-25 00:11:56,936 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-25 00:11:56,937 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 00:11:56,937 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-25 00:11:56,951 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-25 00:11:56,952 INFO  L85        PathProgramCache]: Analyzing trace with hash -813364378, now seen corresponding path program 1 times
[2023-12-25 00:11:56,988 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-12-25 00:11:56,988 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887192543]
[2023-12-25 00:11:56,989 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-25 00:11:56,989 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 00:11:56,990 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-12-25 00:11:57,001 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 00:11:57,036 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 00:11:57,191 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-25 00:11:57,197 INFO  L262         TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core
[2023-12-25 00:11:57,212 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-25 00:11:57,348 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 00:11:57,348 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-25 00:11:57,349 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-12-25 00:11:57,349 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887192543]
[2023-12-25 00:11:57,350 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1887192543] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-25 00:11:57,350 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-25 00:11:57,350 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-12-25 00:11:57,351 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822770827]
[2023-12-25 00:11:57,352 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-25 00:11:57,371 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-12-25 00:11:57,371 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-12-25 00:11:57,419 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-12-25 00:11:57,420 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-12-25 00:11:57,422 INFO  L87              Difference]: Start difference. First operand  has 77 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 50 states have internal predecessors, (65), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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 00:11:57,569 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-25 00:11:57,569 INFO  L93              Difference]: Finished difference Result 131 states and 183 transitions.
[2023-12-25 00:11:57,570 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-12-25 00:11:57,571 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 00:11:57,574 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-25 00:11:57,598 INFO  L225             Difference]: With dead ends: 131
[2023-12-25 00:11:57,599 INFO  L226             Difference]: Without dead ends: 76
[2023-12-25 00:11:57,605 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 00:11:57,608 INFO  L413           NwaCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-12-25 00:11:57,609 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 370 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-12-25 00:11:57,636 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 76 states.
[2023-12-25 00:11:57,662 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76.
[2023-12-25 00:11:57,663 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 76 states, 48 states have (on average 1.1875) internal successors, (57), 49 states have internal predecessors, (57), 20 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23)
[2023-12-25 00:11:57,665 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 100 transitions.
[2023-12-25 00:11:57,666 INFO  L78                 Accepts]: Start accepts. Automaton has 76 states and 100 transitions. Word has length 35
[2023-12-25 00:11:57,666 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-25 00:11:57,666 INFO  L495      AbstractCegarLoop]: Abstraction has 76 states and 100 transitions.
[2023-12-25 00:11:57,666 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 00:11:57,667 INFO  L276                IsEmpty]: Start isEmpty. Operand 76 states and 100 transitions.
[2023-12-25 00:11:57,679 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2023-12-25 00:11:57,679 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-25 00:11:57,679 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 00:11:57,686 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 00:11:57,883 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 00:11:57,884 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-25 00:11:57,884 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-25 00:11:57,884 INFO  L85        PathProgramCache]: Analyzing trace with hash -916736927, now seen corresponding path program 1 times
[2023-12-25 00:11:57,886 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-12-25 00:11:57,886 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176002431]
[2023-12-25 00:11:57,886 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-25 00:11:57,886 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 00:11:57,887 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-12-25 00:11:57,888 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 00:11:57,937 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 00:11:58,048 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-25 00:11:58,051 INFO  L262         TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core
[2023-12-25 00:11:58,055 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-25 00:11:58,260 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 00:11:58,260 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-12-25 00:11:58,742 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 00:11:58,744 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-12-25 00:11:58,744 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176002431]
[2023-12-25 00:11:58,744 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [176002431] provided 0 perfect and 2 imperfect interpolant sequences
[2023-12-25 00:11:58,744 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2023-12-25 00:11:58,744 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8
[2023-12-25 00:11:58,744 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808139131]
[2023-12-25 00:11:58,744 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2023-12-25 00:11:58,746 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-12-25 00:11:58,747 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-12-25 00:11:58,747 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-12-25 00:11:58,749 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2023-12-25 00:11:58,749 INFO  L87              Difference]: Start difference. First operand 76 states and 100 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 00:11:59,027 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-25 00:11:59,027 INFO  L93              Difference]: Finished difference Result 134 states and 177 transitions.
[2023-12-25 00:11:59,029 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-12-25 00:11:59,029 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 00:11:59,029 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-25 00:11:59,031 INFO  L225             Difference]: With dead ends: 134
[2023-12-25 00:11:59,031 INFO  L226             Difference]: Without dead ends: 78
[2023-12-25 00:11:59,032 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 00:11:59,032 INFO  L413           NwaCegarLoop]: 86 mSDtfsCounter, 9 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2023-12-25 00:11:59,033 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 414 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2023-12-25 00:11:59,033 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 78 states.
[2023-12-25 00:11:59,049 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78.
[2023-12-25 00:11:59,049 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 78 states, 49 states have (on average 1.183673469387755) internal successors, (58), 51 states have internal predecessors, (58), 20 states have call successors, (20), 6 states have call predecessors, (20), 8 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25)
[2023-12-25 00:11:59,050 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions.
[2023-12-25 00:11:59,050 INFO  L78                 Accepts]: Start accepts. Automaton has 78 states and 103 transitions. Word has length 47
[2023-12-25 00:11:59,051 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-25 00:11:59,051 INFO  L495      AbstractCegarLoop]: Abstraction has 78 states and 103 transitions.
[2023-12-25 00:11:59,051 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 00:11:59,051 INFO  L276                IsEmpty]: Start isEmpty. Operand 78 states and 103 transitions.
[2023-12-25 00:11:59,056 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2023-12-25 00:11:59,056 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-25 00:11:59,056 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 00:11:59,062 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 00:11:59,259 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 00:11:59,260 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-25 00:11:59,260 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-25 00:11:59,261 INFO  L85        PathProgramCache]: Analyzing trace with hash 933921012, now seen corresponding path program 1 times
[2023-12-25 00:11:59,261 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-12-25 00:11:59,261 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027718640]
[2023-12-25 00:11:59,261 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-25 00:11:59,261 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 00:11:59,262 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-12-25 00:11:59,267 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 00:11:59,319 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 00:11:59,454 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-25 00:11:59,458 INFO  L262         TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core
[2023-12-25 00:11:59,461 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-25 00:11:59,542 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 00:11:59,542 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-25 00:11:59,542 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-12-25 00:11:59,542 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027718640]
[2023-12-25 00:11:59,542 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027718640] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-25 00:11:59,542 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-25 00:11:59,543 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2023-12-25 00:11:59,543 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650143174]
[2023-12-25 00:11:59,543 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-25 00:11:59,546 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-12-25 00:11:59,546 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-12-25 00:11:59,547 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-12-25 00:11:59,547 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2023-12-25 00:11:59,547 INFO  L87              Difference]: Start difference. First operand 78 states and 103 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 00:11:59,834 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-25 00:11:59,835 INFO  L93              Difference]: Finished difference Result 134 states and 177 transitions.
[2023-12-25 00:11:59,835 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-12-25 00:11:59,835 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 00:11:59,835 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-25 00:11:59,838 INFO  L225             Difference]: With dead ends: 134
[2023-12-25 00:11:59,838 INFO  L226             Difference]: Without dead ends: 80
[2023-12-25 00:11:59,839 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 00:11:59,839 INFO  L413           NwaCegarLoop]: 86 mSDtfsCounter, 53 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2023-12-25 00:11:59,840 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 515 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2023-12-25 00:11:59,844 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 80 states.
[2023-12-25 00:11:59,856 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80.
[2023-12-25 00:11:59,858 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 80 states, 50 states have (on average 1.18) internal successors, (59), 53 states have internal predecessors, (59), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (27), 20 states have call predecessors, (27), 20 states have call successors, (27)
[2023-12-25 00:11:59,859 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 106 transitions.
[2023-12-25 00:11:59,860 INFO  L78                 Accepts]: Start accepts. Automaton has 80 states and 106 transitions. Word has length 59
[2023-12-25 00:11:59,860 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-25 00:11:59,860 INFO  L495      AbstractCegarLoop]: Abstraction has 80 states and 106 transitions.
[2023-12-25 00:11:59,860 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 00:11:59,860 INFO  L276                IsEmpty]: Start isEmpty. Operand 80 states and 106 transitions.
[2023-12-25 00:11:59,865 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2023-12-25 00:11:59,865 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-25 00:11:59,865 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 00:11:59,891 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 (4)] Ended with exit code 0
[2023-12-25 00:12:00,072 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 00:12:00,073 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-25 00:12:00,074 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-25 00:12:00,074 INFO  L85        PathProgramCache]: Analyzing trace with hash -749122468, now seen corresponding path program 1 times
[2023-12-25 00:12:00,074 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-12-25 00:12:00,074 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720902100]
[2023-12-25 00:12:00,075 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-25 00:12:00,075 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 00:12:00,075 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-12-25 00:12:00,078 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 00:12:00,124 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 00:12:00,322 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-25 00:12:00,327 INFO  L262         TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core
[2023-12-25 00:12:00,330 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-25 00:12:00,460 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 00:12:00,461 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-25 00:12:00,461 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-12-25 00:12:00,461 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720902100]
[2023-12-25 00:12:00,462 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [720902100] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-25 00:12:00,462 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-25 00:12:00,462 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2023-12-25 00:12:00,462 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785715430]
[2023-12-25 00:12:00,462 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-25 00:12:00,463 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-12-25 00:12:00,463 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-12-25 00:12:00,464 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-12-25 00:12:00,464 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2023-12-25 00:12:00,464 INFO  L87              Difference]: Start difference. First operand 80 states and 106 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 00:12:00,691 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-25 00:12:00,691 INFO  L93              Difference]: Finished difference Result 128 states and 170 transitions.
[2023-12-25 00:12:00,691 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-12-25 00:12:00,692 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 00:12:00,692 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-25 00:12:00,693 INFO  L225             Difference]: With dead ends: 128
[2023-12-25 00:12:00,693 INFO  L226             Difference]: Without dead ends: 82
[2023-12-25 00:12:00,694 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 00:12:00,695 INFO  L413           NwaCegarLoop]: 85 mSDtfsCounter, 44 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2023-12-25 00:12:00,695 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 512 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2023-12-25 00:12:00,695 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 82 states.
[2023-12-25 00:12:00,711 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82.
[2023-12-25 00:12:00,711 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 82 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 55 states have internal predecessors, (60), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (30), 20 states have call predecessors, (30), 20 states have call successors, (30)
[2023-12-25 00:12:00,730 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 110 transitions.
[2023-12-25 00:12:00,730 INFO  L78                 Accepts]: Start accepts. Automaton has 82 states and 110 transitions. Word has length 72
[2023-12-25 00:12:00,730 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-25 00:12:00,731 INFO  L495      AbstractCegarLoop]: Abstraction has 82 states and 110 transitions.
[2023-12-25 00:12:00,731 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 00:12:00,731 INFO  L276                IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions.
[2023-12-25 00:12:00,732 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2023-12-25 00:12:00,732 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-25 00:12:00,732 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 00:12:00,741 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 (5)] Ended with exit code 0
[2023-12-25 00:12:00,938 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 00:12:00,939 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-25 00:12:00,939 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-25 00:12:00,939 INFO  L85        PathProgramCache]: Analyzing trace with hash -250240353, now seen corresponding path program 1 times
[2023-12-25 00:12:00,940 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-12-25 00:12:00,940 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512798856]
[2023-12-25 00:12:00,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-25 00:12:00,940 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 00:12:00,941 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-12-25 00:12:00,946 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 00:12:00,992 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 00:12:01,382 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-12-25 00:12:01,382 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-12-25 00:12:01,657 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-12-25 00:12:01,750 INFO  L130   FreeRefinementEngine]: Strategy WOLF found a feasible trace
[2023-12-25 00:12:01,751 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-12-25 00:12:01,751 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2023-12-25 00:12:01,764 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 00:12:01,953 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 00:12:01,957 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2023-12-25 00:12:01,959 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2023-12-25 00:12:02,031 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 12:12:02 BoogieIcfgContainer
[2023-12-25 00:12:02,031 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-12-25 00:12:02,032 INFO  L158              Benchmark]: Toolchain (without parser) took 7005.12ms. Allocated memory is still 288.4MB. Free memory was 236.6MB in the beginning and 207.0MB in the end (delta: 29.6MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB.
[2023-12-25 00:12:02,032 INFO  L158              Benchmark]: CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 134.7MB. There was no memory consumed. Max. memory is 8.0GB.
[2023-12-25 00:12:02,032 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 537.72ms. Allocated memory is still 288.4MB. Free memory was 236.3MB in the beginning and 221.3MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB.
[2023-12-25 00:12:02,033 INFO  L158              Benchmark]: Boogie Procedure Inliner took 52.61ms. Allocated memory is still 288.4MB. Free memory was 221.3MB in the beginning and 219.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2023-12-25 00:12:02,033 INFO  L158              Benchmark]: Boogie Preprocessor took 91.41ms. Allocated memory is still 288.4MB. Free memory was 219.1MB in the beginning and 214.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB.
[2023-12-25 00:12:02,033 INFO  L158              Benchmark]: RCFGBuilder took 1065.94ms. Allocated memory is still 288.4MB. Free memory was 214.9MB in the beginning and 244.8MB in the end (delta: -29.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB.
[2023-12-25 00:12:02,033 INFO  L158              Benchmark]: TraceAbstraction took 5247.96ms. Allocated memory is still 288.4MB. Free memory was 244.3MB in the beginning and 207.0MB in the end (delta: 37.2MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB.
[2023-12-25 00:12:02,035 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.15ms. Allocated memory is still 184.5MB. Free memory is still 134.7MB. There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 537.72ms. Allocated memory is still 288.4MB. Free memory was 236.3MB in the beginning and 221.3MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 52.61ms. Allocated memory is still 288.4MB. Free memory was 221.3MB in the beginning and 219.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 91.41ms. Allocated memory is still 288.4MB. Free memory was 219.1MB in the beginning and 214.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB.
 * RCFGBuilder took 1065.94ms. Allocated memory is still 288.4MB. Free memory was 214.9MB in the beginning and 244.8MB in the end (delta: -29.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB.
 * TraceAbstraction took 5247.96ms. Allocated memory is still 288.4MB. Free memory was 244.3MB in the beginning and 207.0MB in the end (delta: 37.2MB). Peak memory consumption was 38.8MB. 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: 
[L110]  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}]
[L110]  RET, EXPR    nondet_tree()
[L110]  CALL         task(nondet_tree())
[L86]   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}]
[L86]   RET, EXPR    min(t)
        VAL          [t={5:0}, t={5:0}]
[L86]                int a = min(t);
[L87]                int b;
        VAL          [a=2147483647, b={7:0}, t={5:0}, t={5:0}]
[L89]   CALL, EXPR   size(t)
        VAL          [t={5:0}]
[L81]   COND FALSE   !(!t)
[L82]   EXPR         t->left
        VAL          [t={5:0}, t={5:0}]
[L82]   CALL, EXPR   size(t->left)
        VAL          [t={0:0}]
[L81]   COND TRUE    !t
[L81]                return 0;
        VAL          [\result=0, t={0:0}, t={0:0}]
[L82]   RET, EXPR    size(t->left)
        VAL          [t={5:0}, t={5:0}]
[L82]   EXPR         t->right
        VAL          [t={5:0}, t={5:0}]
[L82]   CALL, EXPR   size(t->right)
        VAL          [t={0:0}]
[L81]   COND TRUE    !t
[L81]                return 0;
        VAL          [\result=0, t={0:0}, t={0:0}]
[L82]   RET, EXPR    size(t->right)
        VAL          [t={5:0}, t={5:0}]
[L82]                return size(t->left) + size(t->right) + 1;
[L89]   RET, EXPR    size(t)
        VAL          [a=2147483647, b={7:0}, t={5:0}, t={5:0}]
[L89]                int n = size(t);
[L90]   CALL         assume_cycle_if_not(n != 0)
[L9]    COND FALSE   !(!cond)
        VAL          [\old(cond)=1, cond=1]
[L90]   RET          assume_cycle_if_not(n != 0)
[L91]   EXPR, FCALL  calloc(n, sizeof(int))
        VAL          [a=2147483647, b={7:0}, n=1, t={5:0}, t={5:0}]
[L91]                int *x = calloc(n, sizeof(int));
        VAL          [a=2147483647, b={7:0}, n=1, t={5:0}, t={5:0}, x={4:0}]
[L92]   CALL         tree_inorder(t, x, n)
        VAL          [\old(i)=1, a={4:0}, t={5:0}]
[L70]   COND FALSE   !(!t)
[L73]   EXPR         t->left
        VAL          [\old(i)=1, a={4:0}, a={4:0}, i=1, t={5:0}, t={5:0}]
[L73]   CALL, EXPR   tree_inorder(t->left,  a, i)
        VAL          [\old(i)=1, a={4:0}, t={0:0}]
[L70]   COND TRUE    !t
[L71]                return i;
        VAL          [\old(i)=1, \result=1, a={4:0}, a={4:0}, i=1, t={0:0}, t={0:0}]
[L73]   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}]
[L73]                i = tree_inorder(t->left,  a, i)
[L74]   EXPR         i++
[L74]   EXPR         t->data
[L74]                a[i++] = t->data
[L75]   EXPR         t->right
        VAL          [\old(i)=1, a={4:0}, a={4:0}, i=2, t={5:0}, t={5:0}]
[L75]   CALL, EXPR   tree_inorder(t->right, a, i)
        VAL          [\old(i)=2, a={4:0}, t={0:0}]
[L70]   COND TRUE    !t
[L71]                return i;
        VAL          [\old(i)=2, \result=2, a={4:0}, a={4:0}, i=2, t={0:0}, t={0:0}]
[L75]   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}]
[L75]                i = tree_inorder(t->right, a, i)
[L76]                return i;
        VAL          [\old(i)=1, \result=2, a={4:0}, a={4:0}, i=2, t={5:0}, t={5:0}]
[L92]   RET          tree_inorder(t, x, n)
        VAL          [a=2147483647, b={7:0}, n=1, t={5:0}, t={5:0}, x={4:0}]
[L93]   EXPR         x[0]
[L93]   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 7 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 116 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 1811 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1460 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 291 IncrementalHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 351 mSDtfsCounter, 291 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.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred 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.6s SatisfiabilityAnalysisTime, 1.1s 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 00:12:02,077 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...