/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/loops/bubble_sort-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 21:54:58,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 21:54:58,968 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-24 21:54:58,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 21:54:58,974 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 21:54:58,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 21:54:58,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 21:54:58,996 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 21:54:58,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 21:54:58,999 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 21:54:58,999 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 21:54:58,999 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 21:54:59,000 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 21:54:59,001 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 21:54:59,001 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 21:54:59,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 21:54:59,001 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 21:54:59,002 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 21:54:59,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 21:54:59,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 21:54:59,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 21:54:59,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 21:54:59,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 21:54:59,003 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 21:54:59,003 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 21:54:59,004 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 21:54:59,004 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 21:54:59,004 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 21:54:59,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 21:54:59,004 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 21:54:59,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 21:54:59,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 21:54:59,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 21:54:59,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 21:54:59,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:54:59,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 21:54:59,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 21:54:59,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 21:54:59,006 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 21:54:59,006 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 21:54:59,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 21:54:59,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 21:54:59,006 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 21:54:59,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 21:54:59,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 21:54:59,007 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 21:54:59,007 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-24 21:54:59,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 21:54:59,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 21:54:59,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 21:54:59,202 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 21:54:59,202 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 21:54:59,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/bubble_sort-2.i [2023-12-24 21:55:00,123 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 21:55:00,371 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 21:55:00,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/bubble_sort-2.i [2023-12-24 21:55:00,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/594e16799/e1be7772275047869c2bf7a53c715451/FLAG6547250a6 [2023-12-24 21:55:00,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/594e16799/e1be7772275047869c2bf7a53c715451 [2023-12-24 21:55:00,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 21:55:00,395 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 21:55:00,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 21:55:00,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 21:55:00,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 21:55:00,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:55:00" (1/1) ... [2023-12-24 21:55:00,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b72b9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:55:00, skipping insertion in model container [2023-12-24 21:55:00,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:55:00" (1/1) ... [2023-12-24 21:55:00,440 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:55:00,538 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/bubble_sort-2.i[1830,1843] [2023-12-24 21:55:00,609 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:55:00,619 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-24 21:55:00,625 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:55:00,628 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/bubble_sort-2.i[1830,1843] [2023-12-24 21:55:00,686 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:55:00,689 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 21:55:00,696 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/bubble_sort-2.i[1830,1843] [2023-12-24 21:55:00,725 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:55:00,753 INFO L206 MainTranslator]: Completed translation [2023-12-24 21:55:00,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:55:00 WrapperNode [2023-12-24 21:55:00,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 21:55:00,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 21:55:00,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 21:55:00,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 21:55:00,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:55:00" (1/1) ... [2023-12-24 21:55:00,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:55:00" (1/1) ... [2023-12-24 21:55:00,787 INFO L138 Inliner]: procedures = 34, calls = 79, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 239 [2023-12-24 21:55:00,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 21:55:00,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 21:55:00,788 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 21:55:00,788 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 21:55:00,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:55:00" (1/1) ... [2023-12-24 21:55:00,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:55:00" (1/1) ... [2023-12-24 21:55:00,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:55:00" (1/1) ... [2023-12-24 21:55:00,849 INFO L175 MemorySlicer]: Split 39 memory accesses to 5 slices as follows [2, 2, 1, 18, 16]. 46 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 2, 0, 2, 0]. The 10 writes are split as follows [0, 0, 1, 4, 5]. [2023-12-24 21:55:00,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:55:00" (1/1) ... [2023-12-24 21:55:00,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:55:00" (1/1) ... [2023-12-24 21:55:00,870 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:55:00" (1/1) ... [2023-12-24 21:55:00,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:55:00" (1/1) ... [2023-12-24 21:55:00,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:55:00" (1/1) ... [2023-12-24 21:55:00,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:55:00" (1/1) ... [2023-12-24 21:55:00,890 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 21:55:00,900 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 21:55:00,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 21:55:00,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 21:55:00,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:55:00" (1/1) ... [2023-12-24 21:55:00,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:55:00,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 21:55:00,921 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-24 21:55:00,928 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-24 21:55:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-24 21:55:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-24 21:55:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-24 21:55:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-12-24 21:55:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-12-24 21:55:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 21:55:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 21:55:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 21:55:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 21:55:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-24 21:55:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-24 21:55:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 21:55:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 21:55:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-24 21:55:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-12-24 21:55:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-12-24 21:55:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 21:55:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 21:55:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 21:55:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-24 21:55:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-24 21:55:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 21:55:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 21:55:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-24 21:55:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-12-24 21:55:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-12-24 21:55:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2023-12-24 21:55:00,947 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2023-12-24 21:55:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-12-24 21:55:00,947 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-12-24 21:55:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 21:55:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2023-12-24 21:55:00,947 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2023-12-24 21:55:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-12-24 21:55:00,947 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-12-24 21:55:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 21:55:00,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 21:55:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 21:55:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 21:55:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 21:55:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 21:55:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-24 21:55:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-24 21:55:01,091 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 21:55:01,093 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 21:55:01,180 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint failFINAL: assume true; [2023-12-24 21:55:01,613 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 21:55:01,691 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 21:55:01,691 INFO L309 CfgBuilder]: Removed 23 assume(true) statements. [2023-12-24 21:55:01,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:55:01 BoogieIcfgContainer [2023-12-24 21:55:01,691 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 21:55:01,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 21:55:01,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 21:55:01,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 21:55:01,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:55:00" (1/3) ... [2023-12-24 21:55:01,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd0dcff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:55:01, skipping insertion in model container [2023-12-24 21:55:01,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:55:00" (2/3) ... [2023-12-24 21:55:01,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd0dcff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:55:01, skipping insertion in model container [2023-12-24 21:55:01,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:55:01" (3/3) ... [2023-12-24 21:55:01,697 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort-2.i [2023-12-24 21:55:01,707 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 21:55:01,708 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 21:55:01,746 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 21:55:01,755 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;@2211706, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 21:55:01,755 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 21:55:01,759 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 70 states have (on average 2.0285714285714285) internal successors, (142), 88 states have internal predecessors, (142), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-24 21:55:01,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-24 21:55:01,763 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:55:01,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:55:01,764 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:55:01,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:55:01,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1727990966, now seen corresponding path program 1 times [2023-12-24 21:55:01,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:55:01,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625808517] [2023-12-24 21:55:01,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:55:01,774 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-24 21:55:01,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:55:01,776 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-24 21:55:01,780 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-24 21:55:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:55:01,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 21:55:01,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:55:01,892 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-24 21:55:01,892 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:55:01,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:55:01,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625808517] [2023-12-24 21:55:01,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625808517] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:55:01,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:55:01,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:55:01,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388260919] [2023-12-24 21:55:01,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:55:01,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 21:55:01,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:55:01,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 21:55:01,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:55:01,919 INFO L87 Difference]: Start difference. First operand has 98 states, 70 states have (on average 2.0285714285714285) internal successors, (142), 88 states have internal predecessors, (142), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:55:02,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:55:02,102 INFO L93 Difference]: Finished difference Result 193 states and 340 transitions. [2023-12-24 21:55:02,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 21:55:02,103 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-24 21:55:02,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:55:02,108 INFO L225 Difference]: With dead ends: 193 [2023-12-24 21:55:02,108 INFO L226 Difference]: Without dead ends: 91 [2023-12-24 21:55:02,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:55:02,113 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:55:02,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 21:55:02,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-24 21:55:02,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-12-24 21:55:02,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.34375) internal successors, (86), 81 states have internal predecessors, (86), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-24 21:55:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2023-12-24 21:55:02,140 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 114 transitions. Word has length 9 [2023-12-24 21:55:02,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:55:02,140 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 114 transitions. [2023-12-24 21:55:02,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:55:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2023-12-24 21:55:02,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-24 21:55:02,141 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:55:02,141 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:55:02,146 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-24 21:55:02,344 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-24 21:55:02,344 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:55:02,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:55:02,345 INFO L85 PathProgramCache]: Analyzing trace with hash -538681145, now seen corresponding path program 1 times [2023-12-24 21:55:02,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:55:02,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598533586] [2023-12-24 21:55:02,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:55:02,346 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-24 21:55:02,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:55:02,347 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-24 21:55:02,348 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-24 21:55:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:55:02,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 21:55:02,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:55:02,520 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-24 21:55:02,520 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:55:02,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:55:02,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598533586] [2023-12-24 21:55:02,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598533586] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:55:02,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:55:02,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 21:55:02,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581360908] [2023-12-24 21:55:02,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:55:02,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 21:55:02,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:55:02,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 21:55:02,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:55:02,522 INFO L87 Difference]: Start difference. First operand 91 states and 114 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 21:55:03,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:55:03,008 INFO L93 Difference]: Finished difference Result 152 states and 191 transitions. [2023-12-24 21:55:03,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 21:55:03,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-12-24 21:55:03,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:55:03,010 INFO L225 Difference]: With dead ends: 152 [2023-12-24 21:55:03,011 INFO L226 Difference]: Without dead ends: 147 [2023-12-24 21:55:03,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-24 21:55:03,012 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 236 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 21:55:03,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 298 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 21:55:03,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-12-24 21:55:03,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2023-12-24 21:55:03,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 120 states have internal predecessors, (142), 23 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-24 21:55:03,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 170 transitions. [2023-12-24 21:55:03,035 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 170 transitions. Word has length 17 [2023-12-24 21:55:03,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:55:03,036 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 170 transitions. [2023-12-24 21:55:03,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 21:55:03,037 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 170 transitions. [2023-12-24 21:55:03,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-24 21:55:03,037 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:55:03,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:55:03,043 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-24 21:55:03,243 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-24 21:55:03,243 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:55:03,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:55:03,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2022930038, now seen corresponding path program 1 times [2023-12-24 21:55:03,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:55:03,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230159399] [2023-12-24 21:55:03,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:55:03,244 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-24 21:55:03,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:55:03,247 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-24 21:55:03,248 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-24 21:55:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:55:03,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-24 21:55:03,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:55:03,490 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 21:55:03,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-24 21:55:03,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-12-24 21:55:03,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 21:55:03,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2023-12-24 21:55:03,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 21:55:03,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-12-24 21:55:03,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 21:55:03,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2023-12-24 21:55:03,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 21:55:03,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-24 21:55:03,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-12-24 21:55:03,978 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-24 21:55:03,978 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:55:03,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:55:03,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230159399] [2023-12-24 21:55:03,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230159399] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:55:03,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:55:03,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-24 21:55:03,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627734271] [2023-12-24 21:55:03,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:55:03,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 21:55:03,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:55:03,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 21:55:03,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=105, Unknown=1, NotChecked=0, Total=132 [2023-12-24 21:55:03,980 INFO L87 Difference]: Start difference. First operand 131 states and 170 transitions. Second operand has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 21:55:04,468 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_list_add_#in~new#1.base| |c_list_add_#in~head#1.base|))) (let ((.cse0 (not .cse2))) (and (= (bvadd (select |c_#valid| (_ bv1 32)) (_ bv1 1)) (_ bv0 1)) (or (and (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#memory_$Pointer$#3.base| |c_list_add_#in~head#1.base|) (store (select (store (store |c_#memory_$Pointer$#3.base| |c_list_add_#in~head#1.base| v_DerPreprocessor_5) |c_list_add_#in~new#1.base| v_DerPreprocessor_6) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))) .cse0) (and (exists ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#3.base| |c_list_add_#in~head#1.base| v_DerPreprocessor_7) |c_list_add_#in~new#1.base| v_DerPreprocessor_8) |c_list_add_#in~head#1.base|))) (and (= (select |c_#memory_$Pointer$#3.base| |c_list_add_#in~new#1.base|) (store .cse1 |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)) (= v_DerPreprocessor_7 .cse1)))) .cse2)) (= (_ bv5 32) |c_~#gl_list~0.base|) (= |c_~#gl_list~0.offset| (_ bv0 32)) (or (and .cse0 (exists ((v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store (select (store (store |c_#memory_$Pointer$#3.offset| |c_list_add_#in~head#1.base| v_DerPreprocessor_1) |c_list_add_#in~new#1.base| v_DerPreprocessor_2) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|) (select |c_#memory_$Pointer$#3.offset| |c_list_add_#in~head#1.base|)))) (and .cse2 (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (store (store |c_#memory_$Pointer$#3.offset| |c_list_add_#in~head#1.base| v_DerPreprocessor_3) |c_list_add_#in~new#1.base| v_DerPreprocessor_4) |c_list_add_#in~head#1.base|))) (and (= .cse3 v_DerPreprocessor_3) (= (select |c_#memory_$Pointer$#3.offset| |c_list_add_#in~new#1.base|) (store .cse3 |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|)))))))))) is different from true [2023-12-24 21:55:06,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:55:06,370 INFO L93 Difference]: Finished difference Result 282 states and 359 transitions. [2023-12-24 21:55:06,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 21:55:06,380 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-12-24 21:55:06,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:55:06,386 INFO L225 Difference]: With dead ends: 282 [2023-12-24 21:55:06,386 INFO L226 Difference]: Without dead ends: 279 [2023-12-24 21:55:06,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=4, NotChecked=34, Total=380 [2023-12-24 21:55:06,392 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 397 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 26 mSolverCounterUnsat, 54 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 54 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:55:06,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 673 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 624 Invalid, 54 Unknown, 10 Unchecked, 2.1s Time] [2023-12-24 21:55:06,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-12-24 21:55:06,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 184. [2023-12-24 21:55:06,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 170 states have internal predecessors, (208), 25 states have call successors, (25), 7 states have call predecessors, (25), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-24 21:55:06,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 240 transitions. [2023-12-24 21:55:06,414 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 240 transitions. Word has length 19 [2023-12-24 21:55:06,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:55:06,414 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 240 transitions. [2023-12-24 21:55:06,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 21:55:06,415 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 240 transitions. [2023-12-24 21:55:06,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-24 21:55:06,415 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:55:06,415 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] [2023-12-24 21:55:06,420 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-24 21:55:06,619 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-24 21:55:06,620 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:55:06,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:55:06,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1579931721, now seen corresponding path program 1 times [2023-12-24 21:55:06,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:55:06,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094638632] [2023-12-24 21:55:06,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:55:06,621 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-24 21:55:06,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:55:06,622 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-24 21:55:06,627 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-24 21:55:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:55:06,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-24 21:55:06,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:55:07,723 INFO L349 Elim1Store]: treesize reduction 36, result has 48.6 percent of original size [2023-12-24 21:55:07,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 45 [2023-12-24 21:55:08,630 INFO L349 Elim1Store]: treesize reduction 43, result has 44.2 percent of original size [2023-12-24 21:55:08,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2023-12-24 21:55:08,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2023-12-24 21:55:08,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2023-12-24 21:55:08,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2023-12-24 21:55:08,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-12-24 21:55:09,134 INFO L349 Elim1Store]: treesize reduction 35, result has 30.0 percent of original size [2023-12-24 21:55:09,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 66 [2023-12-24 21:55:09,172 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-24 21:55:09,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-12-24 21:55:09,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 71 [2023-12-24 21:55:10,194 INFO L349 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2023-12-24 21:55:10,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 113 treesize of output 95 [2023-12-24 21:55:10,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 45 [2023-12-24 21:55:10,275 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-24 21:55:10,275 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:55:10,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:55:10,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094638632] [2023-12-24 21:55:10,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094638632] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:55:10,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:55:10,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-24 21:55:10,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91199679] [2023-12-24 21:55:10,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:55:10,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 21:55:10,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:55:10,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 21:55:10,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2023-12-24 21:55:10,279 INFO L87 Difference]: Start difference. First operand 184 states and 240 transitions. Second operand has 14 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 21:55:21,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:55:21,249 INFO L93 Difference]: Finished difference Result 282 states and 357 transitions. [2023-12-24 21:55:21,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 21:55:21,250 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-12-24 21:55:21,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:55:21,251 INFO L225 Difference]: With dead ends: 282 [2023-12-24 21:55:21,251 INFO L226 Difference]: Without dead ends: 279 [2023-12-24 21:55:21,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2023-12-24 21:55:21,252 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 377 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2023-12-24 21:55:21,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 409 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2023-12-24 21:55:21,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-12-24 21:55:21,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 190. [2023-12-24 21:55:21,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 157 states have (on average 1.3439490445859872) internal successors, (211), 175 states have internal predecessors, (211), 26 states have call successors, (26), 8 states have call predecessors, (26), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 21:55:21,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 245 transitions. [2023-12-24 21:55:21,298 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 245 transitions. Word has length 21 [2023-12-24 21:55:21,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:55:21,298 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 245 transitions. [2023-12-24 21:55:21,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 21:55:21,298 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 245 transitions. [2023-12-24 21:55:21,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-24 21:55:21,299 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:55:21,299 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] [2023-12-24 21:55:21,313 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-24 21:55:21,502 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-24 21:55:21,503 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:55:21,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:55:21,503 INFO L85 PathProgramCache]: Analyzing trace with hash 472589052, now seen corresponding path program 1 times [2023-12-24 21:55:21,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:55:21,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508004437] [2023-12-24 21:55:21,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:55:21,504 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-24 21:55:21,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:55:21,504 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-24 21:55:21,505 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-24 21:55:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-24 21:55:21,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-24 21:55:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-24 21:55:21,784 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-24 21:55:21,784 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-24 21:55:21,785 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 21:55:21,794 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 (6)] Ended with exit code 0 [2023-12-24 21:55:21,990 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-24 21:55:21,993 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-24 21:55:21,995 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 21:55:22,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 09:55:22 BoogieIcfgContainer [2023-12-24 21:55:22,031 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 21:55:22,031 INFO L158 Benchmark]: Toolchain (without parser) took 21636.03ms. Allocated memory was 190.8MB in the beginning and 275.8MB in the end (delta: 84.9MB). Free memory was 156.1MB in the beginning and 211.2MB in the end (delta: -55.1MB). Peak memory consumption was 31.2MB. Max. memory is 8.0GB. [2023-12-24 21:55:22,031 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 190.8MB. Free memory is still 147.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 21:55:22,032 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.69ms. Allocated memory is still 190.8MB. Free memory was 156.1MB in the beginning and 129.7MB in the end (delta: 26.4MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-12-24 21:55:22,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.38ms. Allocated memory is still 190.8MB. Free memory was 129.7MB in the beginning and 127.2MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 21:55:22,032 INFO L158 Benchmark]: Boogie Preprocessor took 102.06ms. Allocated memory is still 190.8MB. Free memory was 127.2MB in the beginning and 118.2MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-24 21:55:22,032 INFO L158 Benchmark]: RCFGBuilder took 791.41ms. Allocated memory is still 190.8MB. Free memory was 118.2MB in the beginning and 134.5MB in the end (delta: -16.3MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2023-12-24 21:55:22,033 INFO L158 Benchmark]: TraceAbstraction took 20338.47ms. Allocated memory was 190.8MB in the beginning and 275.8MB in the end (delta: 84.9MB). Free memory was 133.5MB in the beginning and 211.2MB in the end (delta: -77.8MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. [2023-12-24 21:55:22,034 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.44ms. Allocated memory is still 190.8MB. Free memory is still 147.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 357.69ms. Allocated memory is still 190.8MB. Free memory was 156.1MB in the beginning and 129.7MB in the end (delta: 26.4MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.38ms. Allocated memory is still 190.8MB. Free memory was 129.7MB in the beginning and 127.2MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 102.06ms. Allocated memory is still 190.8MB. Free memory was 127.2MB in the beginning and 118.2MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 791.41ms. Allocated memory is still 190.8MB. Free memory was 118.2MB in the beginning and 134.5MB in the end (delta: -16.3MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * TraceAbstraction took 20338.47ms. Allocated memory was 190.8MB in the beginning and 275.8MB in the end (delta: 84.9MB). Free memory was 133.5MB in the beginning and 211.2MB in the end (delta: -77.8MB). Peak memory consumption was 7.2MB. 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: 46]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L52] struct list_head gl_list = {& gl_list, & gl_list}; [L52] struct list_head gl_list = {& gl_list, & gl_list}; [L52] struct list_head gl_list = {& gl_list, & gl_list}; [L835] struct list_head const *__cil_tmp1 ; [L836] struct list_head const *__cil_tmp2 ; [L839] CALL gl_read() [L676] int tmp ; [L677] int tmp___0 ; VAL [gl_list={5:0}] [L680] COND TRUE 1 [L683] tmp = __VERIFIER_nondet_int() [L684] CALL gl_insert(tmp) [L622] struct node *node ; [L623] void *tmp ; [L624] unsigned int __cil_tmp4 ; [L625] unsigned int __cil_tmp5 ; [L626] unsigned int __cil_tmp6 ; [L627] struct list_head *__cil_tmp7 ; [L628] unsigned int __cil_tmp8 ; [L629] unsigned int __cil_tmp9 ; [L630] unsigned int __cil_tmp10 ; [L631] unsigned int __cil_tmp11 ; [L632] unsigned int __cil_tmp12 ; [L633] unsigned int __cil_tmp13 ; [L634] unsigned int __cil_tmp14 ; [L635] unsigned int __cil_tmp15 ; [L638] __cil_tmp4 = (unsigned int )20UL [L639] tmp = malloc(__cil_tmp4) [L640] node = (struct node *)tmp VAL [\old(value)=0, __cil_tmp4=20, gl_list={5:0}, node={-4:0}, tmp={-4:0}, value=0] [L642] COND FALSE !(! node) VAL [\old(value)=0, __cil_tmp4=20, gl_list={5:0}, node={-4:0}, tmp={-4:0}, value=0] [L649] *((int *)node) = value [L650] __cil_tmp5 = (unsigned int )node [L651] __cil_tmp6 = __cil_tmp5 + 4 [L652] __cil_tmp7 = (struct list_head *)__cil_tmp6 VAL [\old(value)=0, __cil_tmp4=20, __cil_tmp5=4294967292, __cil_tmp6=0, __cil_tmp7={0:0}, gl_list={5:0}, node={-4:0}, tmp={-4:0}, value=0] [L653] CALL list_add(__cil_tmp7, & gl_list) VAL [gl_list={5:0}] [L595] struct list_head *__cil_tmp3 ; [L598] EXPR \read(*head) [L598] __cil_tmp3 = *((struct list_head **)head) [L599] CALL __list_add(new, head, __cil_tmp3) [L567] unsigned int __cil_tmp4 ; [L568] unsigned int __cil_tmp5 ; [L569] unsigned int __cil_tmp6 ; [L570] unsigned int __cil_tmp7 ; [L572] __cil_tmp4 = (unsigned int )next [L573] __cil_tmp5 = __cil_tmp4 + 4 [L574] *((struct list_head **)__cil_tmp5) = new [L575] *((struct list_head **)new) = next [L576] __cil_tmp6 = (unsigned int )new [L577] __cil_tmp7 = __cil_tmp6 + 4 [L578] *((struct list_head **)__cil_tmp7) = prev [L579] *((struct list_head **)prev) = new [L599] RET __list_add(new, head, __cil_tmp3) [L653] RET list_add(__cil_tmp7, & gl_list) VAL [\old(value)=0, __cil_tmp4=20, __cil_tmp5=4294967292, __cil_tmp6=0, __cil_tmp7={0:0}, gl_list={5:0}, node={-4:0}, tmp={-4:0}, value=0] [L656] COND TRUE 1 [L658] __cil_tmp8 = (unsigned int )node [L659] __cil_tmp9 = __cil_tmp8 + 12 [L660] __cil_tmp10 = (unsigned int )node [L661] __cil_tmp11 = __cil_tmp10 + 12 [L662] *((struct list_head **)__cil_tmp9) = (struct list_head *)__cil_tmp11 [L663] __cil_tmp12 = (unsigned int )node [L664] __cil_tmp13 = __cil_tmp12 + 12 [L665] __cil_tmp14 = (unsigned int )node [L666] __cil_tmp15 = __cil_tmp14 + 12 [L667] *((struct list_head **)__cil_tmp13) = (struct list_head *)__cil_tmp15 VAL [gl_list={5:0}] [L684] RET gl_insert(tmp) [L685] tmp___0 = __VERIFIER_nondet_int() [L687] COND FALSE !(\read(tmp___0)) VAL [gl_list={5:0}, tmp=0, tmp___0=0] [L839] RET gl_read() [L840] __cil_tmp1 = (struct list_head const *)(& gl_list) VAL [__cil_tmp1={5:0}, gl_list={5:0}] [L841] CALL inspect(__cil_tmp1) VAL [gl_list={5:0}, head={5:0}] [L55] struct node const *node ; [L56] unsigned int __cil_tmp3 ; [L57] struct list_head *__cil_tmp4 ; [L58] unsigned int __cil_tmp5 ; [L59] int __cil_tmp6 ; [L60] unsigned int __cil_tmp7 ; [L61] unsigned int __cil_tmp8 ; [L62] unsigned int __cil_tmp9 ; [L63] struct list_head *__cil_tmp10 ; [L64] unsigned int __cil_tmp11 ; [L65] int __cil_tmp12 ; [L66] unsigned int __cil_tmp13 ; [L67] unsigned int __cil_tmp14 ; [L68] struct list_head *__cil_tmp15 ; [L69] unsigned int __cil_tmp16 ; [L70] struct list_head *__cil_tmp17 ; [L71] unsigned int __cil_tmp18 ; [L72] int __cil_tmp19 ; [L73] unsigned int __cil_tmp20 ; [L74] unsigned int __cil_tmp21 ; [L75] unsigned int __cil_tmp22 ; [L76] struct list_head *__cil_tmp23 ; [L77] unsigned int __cil_tmp24 ; [L78] int __cil_tmp25 ; [L79] struct node *__cil_tmp26 ; [L80] unsigned int __cil_tmp27 ; [L81] unsigned int __cil_tmp28 ; [L82] struct list_head *__cil_tmp29 ; [L83] unsigned long __cil_tmp30 ; [L84] char *__cil_tmp31 ; [L85] char *__cil_tmp32 ; [L86] struct node *__cil_tmp33 ; [L87] unsigned int __cil_tmp34 ; [L88] unsigned int __cil_tmp35 ; [L89] struct list_head const *__cil_tmp36 ; [L90] unsigned int __cil_tmp37 ; [L91] unsigned int __cil_tmp38 ; [L92] unsigned int __cil_tmp39 ; [L93] struct list_head *__cil_tmp40 ; [L94] unsigned int __cil_tmp41 ; [L95] int __cil_tmp42 ; [L96] unsigned int __cil_tmp43 ; [L97] unsigned int __cil_tmp44 ; [L98] struct list_head const *__cil_tmp45 ; [L99] unsigned int __cil_tmp46 ; [L100] unsigned int __cil_tmp47 ; [L101] unsigned int __cil_tmp48 ; [L102] unsigned int __cil_tmp49 ; [L103] struct list_head *__cil_tmp50 ; [L104] unsigned int __cil_tmp51 ; [L105] int __cil_tmp52 ; [L106] unsigned int __cil_tmp53 ; [L107] unsigned int __cil_tmp54 ; [L108] struct list_head const *__cil_tmp55 ; [L109] unsigned int __cil_tmp56 ; [L110] unsigned int __cil_tmp57 ; [L111] unsigned int __cil_tmp58 ; [L112] struct list_head *__cil_tmp59 ; [L113] unsigned int __cil_tmp60 ; [L114] int __cil_tmp61 ; [L115] unsigned int __cil_tmp62 ; [L116] unsigned int __cil_tmp63 ; [L117] struct list_head const *__cil_tmp64 ; [L118] unsigned int __cil_tmp65 ; [L119] unsigned int __cil_tmp66 ; [L120] unsigned int __cil_tmp67 ; [L121] unsigned int __cil_tmp68 ; [L122] struct list_head *__cil_tmp69 ; [L123] unsigned int __cil_tmp70 ; [L124] int __cil_tmp71 ; [L125] struct node const *__cil_tmp72 ; [L126] unsigned int __cil_tmp73 ; [L127] unsigned int __cil_tmp74 ; [L128] int __cil_tmp75 ; [L129] unsigned int __cil_tmp76 ; [L130] unsigned int __cil_tmp77 ; [L131] struct list_head const *__cil_tmp78 ; [L132] struct node const *__cil_tmp79 ; [L133] unsigned int __cil_tmp80 ; [L134] unsigned int __cil_tmp81 ; [L135] int __cil_tmp82 ; [L136] int const *__cil_tmp83 ; [L137] struct node const *__cil_tmp84 ; [L138] unsigned int __cil_tmp85 ; [L139] unsigned int __cil_tmp86 ; [L140] int __cil_tmp87 ; [L141] unsigned int __cil_tmp88 ; [L142] unsigned int __cil_tmp89 ; [L143] struct list_head *__cil_tmp90 ; [L144] unsigned int __cil_tmp91 ; [L145] unsigned int __cil_tmp92 ; [L146] struct list_head *__cil_tmp93 ; [L147] unsigned int __cil_tmp94 ; [L148] unsigned int __cil_tmp95 ; [L149] int __cil_tmp96 ; [L150] unsigned int __cil_tmp97 ; [L151] unsigned int __cil_tmp98 ; [L152] unsigned int __cil_tmp99 ; [L153] struct list_head *__cil_tmp100 ; [L154] struct list_head *__cil_tmp101 ; [L155] unsigned int __cil_tmp102 ; [L156] unsigned int __cil_tmp103 ; [L157] int __cil_tmp104 ; [L158] struct list_head *__cil_tmp105 ; [L159] unsigned int __cil_tmp106 ; [L160] unsigned int __cil_tmp107 ; [L161] unsigned int __cil_tmp108 ; [L162] struct list_head const *__cil_tmp109 ; [L163] unsigned int __cil_tmp110 ; [L164] struct list_head *__cil_tmp111 ; [L165] unsigned int __cil_tmp112 ; [L166] struct node *__cil_tmp113 ; [L167] unsigned int __cil_tmp114 ; [L168] unsigned int __cil_tmp115 ; [L169] struct list_head *__cil_tmp116 ; [L170] unsigned long __cil_tmp117 ; [L171] char *__cil_tmp118 ; [L172] char *__cil_tmp119 ; [L173] struct node *__cil_tmp120 ; [L174] unsigned int __cil_tmp121 ; [L175] int __cil_tmp122 ; VAL [gl_list={5:0}, head={5:0}, head={5:0}] [L179] COND TRUE 1 VAL [gl_list={5:0}, head={5:0}, head={5:0}] [L181] COND FALSE !(! head) VAL [gl_list={5:0}, head={5:0}, head={5:0}] [L192] COND TRUE 1 [L195] __cil_tmp3 = (unsigned int )head [L196] EXPR \read(*head) [L196] __cil_tmp4 = *((struct list_head * const *)head) [L197] __cil_tmp5 = (unsigned int )__cil_tmp4 [L198] __cil_tmp6 = __cil_tmp5 != __cil_tmp3 VAL [__cil_tmp3=5, __cil_tmp4={0:0}, __cil_tmp5=0, __cil_tmp6=1, gl_list={5:0}, head={5:0}, head={5:0}] [L199] COND FALSE !(! __cil_tmp6) VAL [__cil_tmp3=5, __cil_tmp4={0:0}, __cil_tmp5=0, __cil_tmp6=1, gl_list={5:0}, head={5:0}, head={5:0}] [L211] COND TRUE 1 [L214] __cil_tmp7 = (unsigned int )head [L215] __cil_tmp8 = (unsigned int )head [L216] __cil_tmp9 = __cil_tmp8 + 4 [L217] EXPR (struct list_head * const *)__cil_tmp9 [L217] __cil_tmp10 = *((struct list_head * const *)__cil_tmp9) [L218] __cil_tmp11 = (unsigned int )__cil_tmp10 [L219] __cil_tmp12 = __cil_tmp11 != __cil_tmp7 VAL [__cil_tmp10={0:0}, __cil_tmp11=0, __cil_tmp12=1, __cil_tmp3=5, __cil_tmp4={0:0}, __cil_tmp5=0, __cil_tmp6=1, __cil_tmp7=5, __cil_tmp8=5, __cil_tmp9=9, gl_list={5:0}, head={5:0}, head={5:0}] [L220] COND FALSE !(! __cil_tmp12) VAL [__cil_tmp10={0:0}, __cil_tmp11=0, __cil_tmp12=1, __cil_tmp3=5, __cil_tmp4={0:0}, __cil_tmp5=0, __cil_tmp6=1, __cil_tmp7=5, __cil_tmp8=5, __cil_tmp9=9, gl_list={5:0}, head={5:0}, head={5:0}] [L231] __cil_tmp13 = (unsigned int )head [L232] __cil_tmp14 = __cil_tmp13 + 4 [L233] EXPR (struct list_head * const *)__cil_tmp14 [L233] __cil_tmp15 = *((struct list_head * const *)__cil_tmp14) [L234] head = (struct list_head const *)__cil_tmp15 VAL [__cil_tmp10={0:0}, __cil_tmp11=0, __cil_tmp12=1, __cil_tmp13=5, __cil_tmp14=9, __cil_tmp15={0:0}, __cil_tmp3=5, __cil_tmp4={0:0}, __cil_tmp5=0, __cil_tmp6=1, __cil_tmp7=5, __cil_tmp8=5, __cil_tmp9=9, gl_list={5:0}, head={0:0}, head={5:0}] [L236] COND TRUE 1 VAL [__cil_tmp10={0:0}, __cil_tmp11=0, __cil_tmp12=1, __cil_tmp13=5, __cil_tmp14=9, __cil_tmp15={0:0}, __cil_tmp3=5, __cil_tmp4={0:0}, __cil_tmp5=0, __cil_tmp6=1, __cil_tmp7=5, __cil_tmp8=5, __cil_tmp9=9, gl_list={5:0}, head={0:0}, head={5:0}] [L238] COND TRUE ! head VAL [__cil_tmp10={0:0}, __cil_tmp11=0, __cil_tmp12=1, __cil_tmp13=5, __cil_tmp14=9, __cil_tmp15={0:0}, __cil_tmp3=5, __cil_tmp4={0:0}, __cil_tmp5=0, __cil_tmp6=1, __cil_tmp7=5, __cil_tmp8=5, __cil_tmp9=9, gl_list={5:0}, head={0:0}, head={5:0}] [L240] CALL fail() VAL [gl_list={5:0}] [L46] reach_error() VAL [gl_list={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.3s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 54 mSolverCounterUnknown, 1012 SdHoareTripleChecker+Valid, 10.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1010 mSDsluCounter, 1473 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 10 IncrementalHoareTripleChecker+Unchecked, 1192 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1968 IncrementalHoareTripleChecker+Invalid, 2162 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 281 mSDtfsCounter, 1968 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=4, InterpolantAutomatonStates: 38, 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, 200 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 62 ConstructedInterpolants, 1 QuantifiedInterpolants, 1749 SizeOfPredicates, 68 NumberOfNonLiveVariables, 514 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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-24 21:55:22,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...