./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:18:06,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:18:06,350 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:18:06,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:18:06,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:18:06,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:18:06,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:18:06,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:18:06,399 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:18:06,400 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:18:06,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:18:06,400 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:18:06,400 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:18:06,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:18:06,402 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:18:06,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:18:06,402 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:18:06,414 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:18:06,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:18:06,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:18:06,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:18:06,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:18:06,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:18:06,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:18:06,416 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:18:06,416 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:18:06,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:18:06,417 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:18:06,417 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:18:06,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:18:06,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:18:06,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:18:06,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:18:06,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:18:06,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:18:06,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:18:06,419 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:18:06,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:18:06,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:18:06,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:18:06,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:18:06,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:18:06,420 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2024-10-12 18:18:06,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:18:06,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:18:06,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:18:06,654 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:18:06,654 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:18:06,655 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-10-12 18:18:08,092 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:18:08,358 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:18:08,360 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-10-12 18:18:08,376 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/787a8ba03/99cdd4f0eebf4adcb48c9cad8d56cbe8/FLAG34ed55781 [2024-10-12 18:18:08,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/787a8ba03/99cdd4f0eebf4adcb48c9cad8d56cbe8 [2024-10-12 18:18:08,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:18:08,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:18:08,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:18:08,395 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:18:08,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:18:08,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:18:08" (1/1) ... [2024-10-12 18:18:08,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d3b757f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:08, skipping insertion in model container [2024-10-12 18:18:08,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:18:08" (1/1) ... [2024-10-12 18:18:08,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:18:08,752 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2024-10-12 18:18:08,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:18:08,807 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:18:08,841 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2024-10-12 18:18:08,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:18:08,895 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:18:08,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:08 WrapperNode [2024-10-12 18:18:08,896 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:18:08,897 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:18:08,897 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:18:08,897 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:18:08,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:08" (1/1) ... [2024-10-12 18:18:08,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:08" (1/1) ... [2024-10-12 18:18:08,955 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 118 [2024-10-12 18:18:08,959 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:18:08,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:18:08,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:18:08,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:18:08,972 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:08" (1/1) ... [2024-10-12 18:18:08,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:08" (1/1) ... [2024-10-12 18:18:08,978 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:08" (1/1) ... [2024-10-12 18:18:09,005 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2024-10-12 18:18:09,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:08" (1/1) ... [2024-10-12 18:18:09,006 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:08" (1/1) ... [2024-10-12 18:18:09,017 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:08" (1/1) ... [2024-10-12 18:18:09,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:08" (1/1) ... [2024-10-12 18:18:09,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:08" (1/1) ... [2024-10-12 18:18:09,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:08" (1/1) ... [2024-10-12 18:18:09,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:18:09,042 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:18:09,042 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:18:09,042 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:18:09,043 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:08" (1/1) ... [2024-10-12 18:18:09,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:18:09,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:18:09,077 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) [2024-10-12 18:18:09,084 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 [2024-10-12 18:18:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 18:18:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 18:18:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2024-10-12 18:18:09,146 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2024-10-12 18:18:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 18:18:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-12 18:18:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-12 18:18:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2024-10-12 18:18:09,147 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2024-10-12 18:18:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 18:18:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 18:18:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-10-12 18:18:09,148 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-10-12 18:18:09,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 18:18:09,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 18:18:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 18:18:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:18:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 18:18:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 18:18:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2024-10-12 18:18:09,150 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2024-10-12 18:18:09,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:18:09,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 18:18:09,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:18:09,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:18:09,287 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:18:09,289 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:18:09,617 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-10-12 18:18:09,618 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:18:09,678 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:18:09,678 INFO L314 CfgBuilder]: Removed 41 assume(true) statements. [2024-10-12 18:18:09,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:18:09 BoogieIcfgContainer [2024-10-12 18:18:09,679 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:18:09,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:18:09,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:18:09,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:18:09,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:18:08" (1/3) ... [2024-10-12 18:18:09,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e186765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:18:09, skipping insertion in model container [2024-10-12 18:18:09,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:08" (2/3) ... [2024-10-12 18:18:09,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e186765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:18:09, skipping insertion in model container [2024-10-12 18:18:09,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:18:09" (3/3) ... [2024-10-12 18:18:09,687 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2024-10-12 18:18:09,704 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:18:09,704 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:18:09,763 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:18:09,770 INFO L333 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, 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;@61fda8d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:18:09,770 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:18:09,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-12 18:18:09,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-12 18:18:09,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:09,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:09,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:09,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:09,788 INFO L85 PathProgramCache]: Analyzing trace with hash -754496073, now seen corresponding path program 1 times [2024-10-12 18:18:09,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:09,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714053608] [2024-10-12 18:18:09,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:09,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:09,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:09,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714053608] [2024-10-12 18:18:09,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714053608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:09,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:09,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 18:18:09,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303474518] [2024-10-12 18:18:09,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:09,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 18:18:09,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:10,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 18:18:10,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:18:10,065 INFO L87 Difference]: Start difference. First operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2024-10-12 18:18:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:10,195 INFO L93 Difference]: Finished difference Result 210 states and 377 transitions. [2024-10-12 18:18:10,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 18:18:10,198 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 8 [2024-10-12 18:18:10,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:10,204 INFO L225 Difference]: With dead ends: 210 [2024-10-12 18:18:10,204 INFO L226 Difference]: Without dead ends: 99 [2024-10-12 18:18:10,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:18:10,210 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:10,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:18:10,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-12 18:18:10,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-12 18:18:10,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 89 states have internal predecessors, (94), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-12 18:18:10,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2024-10-12 18:18:10,260 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 8 [2024-10-12 18:18:10,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:10,260 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2024-10-12 18:18:10,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2024-10-12 18:18:10,260 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2024-10-12 18:18:10,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 18:18:10,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:10,266 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:10,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:18:10,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:10,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:10,268 INFO L85 PathProgramCache]: Analyzing trace with hash 437181209, now seen corresponding path program 1 times [2024-10-12 18:18:10,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:10,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201445302] [2024-10-12 18:18:10,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:10,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:10,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 18:18:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:10,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:10,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:10,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201445302] [2024-10-12 18:18:10,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201445302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:10,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:10,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:18:10,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587622889] [2024-10-12 18:18:10,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:10,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:18:10,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:10,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:18:10,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:18:10,556 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 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) [2024-10-12 18:18:10,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:10,802 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2024-10-12 18:18:10,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:18:10,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 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 [2024-10-12 18:18:10,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:10,804 INFO L225 Difference]: With dead ends: 101 [2024-10-12 18:18:10,804 INFO L226 Difference]: Without dead ends: 98 [2024-10-12 18:18:10,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-12 18:18:10,806 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 233 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:10,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 87 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:18:10,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-12 18:18:10,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-12 18:18:10,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 88 states have internal predecessors, (93), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-12 18:18:10,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2024-10-12 18:18:10,817 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 17 [2024-10-12 18:18:10,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:10,818 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2024-10-12 18:18:10,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 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) [2024-10-12 18:18:10,819 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2024-10-12 18:18:10,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 18:18:10,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:10,819 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:10,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:18:10,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:10,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:10,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1443607003, now seen corresponding path program 1 times [2024-10-12 18:18:10,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:10,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139328817] [2024-10-12 18:18:10,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:10,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:11,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 18:18:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:11,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:11,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:11,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139328817] [2024-10-12 18:18:11,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139328817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:11,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:11,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 18:18:11,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710059260] [2024-10-12 18:18:11,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:11,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 18:18:11,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:11,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 18:18:11,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-12 18:18:11,410 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 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) [2024-10-12 18:18:12,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:12,236 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2024-10-12 18:18:12,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 18:18:12,236 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 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 20 [2024-10-12 18:18:12,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:12,239 INFO L225 Difference]: With dead ends: 187 [2024-10-12 18:18:12,239 INFO L226 Difference]: Without dead ends: 181 [2024-10-12 18:18:12,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2024-10-12 18:18:12,241 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 464 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:12,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 121 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 18:18:12,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-12 18:18:12,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 161. [2024-10-12 18:18:12,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 133 states have (on average 1.263157894736842) internal successors, (168), 147 states have internal predecessors, (168), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-12 18:18:12,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 198 transitions. [2024-10-12 18:18:12,262 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 198 transitions. Word has length 20 [2024-10-12 18:18:12,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:12,262 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 198 transitions. [2024-10-12 18:18:12,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 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) [2024-10-12 18:18:12,263 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 198 transitions. [2024-10-12 18:18:12,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 18:18:12,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:12,263 INFO L215 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] [2024-10-12 18:18:12,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 18:18:12,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:12,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:12,264 INFO L85 PathProgramCache]: Analyzing trace with hash 722118342, now seen corresponding path program 1 times [2024-10-12 18:18:12,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:12,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238234135] [2024-10-12 18:18:12,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:12,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:12,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 18:18:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:12,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:12,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:12,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238234135] [2024-10-12 18:18:12,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238234135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:12,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:12,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 18:18:12,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762370920] [2024-10-12 18:18:12,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:12,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 18:18:12,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:12,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 18:18:12,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-12 18:18:12,998 INFO L87 Difference]: Start difference. First operand 161 states and 198 transitions. Second operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 9 states have internal predecessors, (19), 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) [2024-10-12 18:18:13,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:13,754 INFO L93 Difference]: Finished difference Result 259 states and 314 transitions. [2024-10-12 18:18:13,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 18:18:13,755 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 9 states have internal predecessors, (19), 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 23 [2024-10-12 18:18:13,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:13,756 INFO L225 Difference]: With dead ends: 259 [2024-10-12 18:18:13,756 INFO L226 Difference]: Without dead ends: 256 [2024-10-12 18:18:13,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-12 18:18:13,758 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 305 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:13,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 157 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 18:18:13,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-12 18:18:13,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 238. [2024-10-12 18:18:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2561576354679802) internal successors, (255), 218 states have internal predecessors, (255), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-12 18:18:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 294 transitions. [2024-10-12 18:18:13,791 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 294 transitions. Word has length 23 [2024-10-12 18:18:13,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:13,792 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 294 transitions. [2024-10-12 18:18:13,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 9 states have internal predecessors, (19), 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) [2024-10-12 18:18:13,792 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 294 transitions. [2024-10-12 18:18:13,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 18:18:13,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:13,793 INFO L215 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] [2024-10-12 18:18:13,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 18:18:13,793 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:13,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:13,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1115915285, now seen corresponding path program 1 times [2024-10-12 18:18:13,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:13,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886925037] [2024-10-12 18:18:13,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:13,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:14,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 18:18:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:14,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:14,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886925037] [2024-10-12 18:18:14,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886925037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:14,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:14,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 18:18:14,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697446603] [2024-10-12 18:18:14,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:14,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 18:18:14,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:14,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 18:18:14,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-12 18:18:14,379 INFO L87 Difference]: Start difference. First operand 238 states and 294 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 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) [2024-10-12 18:18:15,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:15,218 INFO L93 Difference]: Finished difference Result 258 states and 312 transitions. [2024-10-12 18:18:15,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 18:18:15,219 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 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 26 [2024-10-12 18:18:15,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:15,220 INFO L225 Difference]: With dead ends: 258 [2024-10-12 18:18:15,220 INFO L226 Difference]: Without dead ends: 255 [2024-10-12 18:18:15,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-10-12 18:18:15,222 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 344 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:15,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 176 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 18:18:15,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-12 18:18:15,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 238. [2024-10-12 18:18:15,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.251231527093596) internal successors, (254), 218 states have internal predecessors, (254), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-12 18:18:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 293 transitions. [2024-10-12 18:18:15,249 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 293 transitions. Word has length 26 [2024-10-12 18:18:15,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:15,250 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 293 transitions. [2024-10-12 18:18:15,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 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) [2024-10-12 18:18:15,250 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 293 transitions. [2024-10-12 18:18:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 18:18:15,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:15,251 INFO L215 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] [2024-10-12 18:18:15,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 18:18:15,251 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:15,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:15,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1422251983, now seen corresponding path program 1 times [2024-10-12 18:18:15,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:15,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703167411] [2024-10-12 18:18:15,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:15,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:15,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 18:18:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:15,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:15,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:15,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703167411] [2024-10-12 18:18:15,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703167411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:15,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:15,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 18:18:15,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812560273] [2024-10-12 18:18:15,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:15,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 18:18:15,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:15,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 18:18:15,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-12 18:18:15,830 INFO L87 Difference]: Start difference. First operand 238 states and 293 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 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) [2024-10-12 18:18:16,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:16,626 INFO L93 Difference]: Finished difference Result 257 states and 310 transitions. [2024-10-12 18:18:16,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 18:18:16,627 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 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 29 [2024-10-12 18:18:16,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:16,628 INFO L225 Difference]: With dead ends: 257 [2024-10-12 18:18:16,628 INFO L226 Difference]: Without dead ends: 254 [2024-10-12 18:18:16,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-10-12 18:18:16,632 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 332 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:16,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 173 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 18:18:16,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-12 18:18:16,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 238. [2024-10-12 18:18:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2463054187192117) internal successors, (253), 218 states have internal predecessors, (253), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-12 18:18:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 292 transitions. [2024-10-12 18:18:16,717 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 292 transitions. Word has length 29 [2024-10-12 18:18:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:16,722 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 292 transitions. [2024-10-12 18:18:16,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 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) [2024-10-12 18:18:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 292 transitions. [2024-10-12 18:18:16,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-12 18:18:16,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:16,723 INFO L215 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] [2024-10-12 18:18:16,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 18:18:16,724 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:16,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:16,724 INFO L85 PathProgramCache]: Analyzing trace with hash -678942440, now seen corresponding path program 1 times [2024-10-12 18:18:16,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:16,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259775267] [2024-10-12 18:18:16,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:16,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:17,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 18:18:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:17,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:17,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259775267] [2024-10-12 18:18:17,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259775267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:17,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:17,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 18:18:17,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150278751] [2024-10-12 18:18:17,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:17,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 18:18:17,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:17,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 18:18:17,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-12 18:18:17,644 INFO L87 Difference]: Start difference. First operand 238 states and 292 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 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) [2024-10-12 18:18:18,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:18,451 INFO L93 Difference]: Finished difference Result 256 states and 308 transitions. [2024-10-12 18:18:18,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 18:18:18,452 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 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 32 [2024-10-12 18:18:18,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:18,453 INFO L225 Difference]: With dead ends: 256 [2024-10-12 18:18:18,453 INFO L226 Difference]: Without dead ends: 253 [2024-10-12 18:18:18,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-10-12 18:18:18,454 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 325 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:18,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 176 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 18:18:18,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-12 18:18:18,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 238. [2024-10-12 18:18:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2413793103448276) internal successors, (252), 218 states have internal predecessors, (252), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-12 18:18:18,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 291 transitions. [2024-10-12 18:18:18,479 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 291 transitions. Word has length 32 [2024-10-12 18:18:18,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:18,479 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 291 transitions. [2024-10-12 18:18:18,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 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) [2024-10-12 18:18:18,480 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 291 transitions. [2024-10-12 18:18:18,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-12 18:18:18,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:18,481 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:18,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 18:18:18,481 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:18,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:18,481 INFO L85 PathProgramCache]: Analyzing trace with hash -58033664, now seen corresponding path program 1 times [2024-10-12 18:18:18,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:18,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102678544] [2024-10-12 18:18:18,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:18,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:19,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 18:18:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:19,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:18:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:19,272 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:18:19,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:19,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102678544] [2024-10-12 18:18:19,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102678544] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:19,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008134500] [2024-10-12 18:18:19,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:19,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:18:19,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:18:19,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:18:19,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 18:18:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:19,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-12 18:18:19,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:18:19,501 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-12 18:18:19,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 16 [2024-10-12 18:18:19,552 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 16 treesize of output 11 [2024-10-12 18:18:19,561 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 16 treesize of output 11 [2024-10-12 18:18:19,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 167 [2024-10-12 18:18:19,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 178 [2024-10-12 18:18:19,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:18:19,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 102 treesize of output 85 [2024-10-12 18:18:19,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:18:19,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2024-10-12 18:18:20,001 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 19 treesize of output 7 [2024-10-12 18:18:20,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 19 treesize of output 21 [2024-10-12 18:18:20,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:18:20,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 61 [2024-10-12 18:18:20,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 65 [2024-10-12 18:18:20,094 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 67 [2024-10-12 18:18:20,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:18:20,122 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 17 treesize of output 21 [2024-10-12 18:18:20,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2024-10-12 18:18:20,195 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-12 18:18:20,195 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 11 treesize of output 11 [2024-10-12 18:18:20,239 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 28 treesize of output 19 [2024-10-12 18:18:20,295 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 145 treesize of output 129 [2024-10-12 18:18:20,310 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 127 treesize of output 111 [2024-10-12 18:18:20,968 INFO L349 Elim1Store]: treesize reduction 262, result has 15.8 percent of original size [2024-10-12 18:18:20,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 286 treesize of output 149 [2024-10-12 18:18:21,479 INFO L349 Elim1Store]: treesize reduction 196, result has 27.4 percent of original size [2024-10-12 18:18:21,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 291 treesize of output 407 [2024-10-12 18:18:21,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-12 18:18:22,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:18:22,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 562 treesize of output 572 [2024-10-12 18:18:22,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-12 18:18:25,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-12 18:18:30,554 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:18:30,563 INFO L349 Elim1Store]: treesize reduction 61, result has 1.6 percent of original size [2024-10-12 18:18:30,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 18 [2024-10-12 18:18:32,381 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:18:32,397 INFO L349 Elim1Store]: treesize reduction 61, result has 1.6 percent of original size [2024-10-12 18:18:32,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 18 [2024-10-12 18:18:33,937 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-10-12 18:18:33,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 18:18:34,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:18:34,143 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: unsuccessful DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:170) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:290) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-12 18:18:34,148 INFO L158 Benchmark]: Toolchain (without parser) took 25753.82ms. Allocated memory was 230.7MB in the beginning and 889.2MB in the end (delta: 658.5MB). Free memory was 199.8MB in the beginning and 579.7MB in the end (delta: -379.9MB). Peak memory consumption was 455.2MB. Max. memory is 16.1GB. [2024-10-12 18:18:34,148 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 140.5MB. Free memory was 104.3MB in the beginning and 104.1MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:18:34,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.60ms. Allocated memory is still 230.7MB. Free memory was 199.6MB in the beginning and 173.7MB in the end (delta: 25.9MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2024-10-12 18:18:34,149 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.97ms. Allocated memory is still 230.7MB. Free memory was 173.7MB in the beginning and 171.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:18:34,149 INFO L158 Benchmark]: Boogie Preprocessor took 78.20ms. Allocated memory is still 230.7MB. Free memory was 171.6MB in the beginning and 166.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 18:18:34,149 INFO L158 Benchmark]: RCFGBuilder took 636.86ms. Allocated memory is still 230.7MB. Free memory was 166.4MB in the beginning and 133.9MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-12 18:18:34,149 INFO L158 Benchmark]: TraceAbstraction took 24467.10ms. Allocated memory was 230.7MB in the beginning and 889.2MB in the end (delta: 658.5MB). Free memory was 133.9MB in the beginning and 579.7MB in the end (delta: -445.8MB). Peak memory consumption was 389.9MB. Max. memory is 16.1GB. [2024-10-12 18:18:34,150 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 140.5MB. Free memory was 104.3MB in the beginning and 104.1MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.60ms. Allocated memory is still 230.7MB. Free memory was 199.6MB in the beginning and 173.7MB in the end (delta: 25.9MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.97ms. Allocated memory is still 230.7MB. Free memory was 173.7MB in the beginning and 171.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.20ms. Allocated memory is still 230.7MB. Free memory was 171.6MB in the beginning and 166.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 636.86ms. Allocated memory is still 230.7MB. Free memory was 166.4MB in the beginning and 133.9MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 24467.10ms. Allocated memory was 230.7MB in the beginning and 889.2MB in the end (delta: 658.5MB). Free memory was 133.9MB in the beginning and 579.7MB in the end (delta: -445.8MB). Peak memory consumption was 389.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: unsuccessful DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: unsuccessful DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:170) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-12 18:18:34,210 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:18:36,640 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:18:36,719 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-12 18:18:36,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:18:36,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:18:36,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:18:36,769 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:18:36,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:18:36,770 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:18:36,770 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:18:36,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:18:36,771 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:18:36,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:18:36,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:18:36,774 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:18:36,774 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:18:36,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:18:36,775 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:18:36,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:18:36,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:18:36,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:18:36,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:18:36,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:18:36,781 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 18:18:36,781 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 18:18:36,781 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:18:36,781 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 18:18:36,782 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:18:36,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:18:36,782 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:18:36,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:18:36,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:18:36,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:18:36,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:18:36,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:18:36,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:18:36,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:18:36,786 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:18:36,786 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 18:18:36,786 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 18:18:36,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:18:36,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:18:36,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:18:36,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:18:36,791 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 18:18:36,791 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2024-10-12 18:18:37,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:18:37,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:18:37,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:18:37,175 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:18:37,175 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:18:37,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-10-12 18:18:38,714 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:18:38,945 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:18:38,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-10-12 18:18:38,961 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76ddcd647/19bfa17874b04563818473c2425a703c/FLAGcfd011ce6 [2024-10-12 18:18:38,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76ddcd647/19bfa17874b04563818473c2425a703c [2024-10-12 18:18:38,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:18:38,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:18:38,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:18:38,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:18:38,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:18:38,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:18:38" (1/1) ... [2024-10-12 18:18:38,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72ce814f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:38, skipping insertion in model container [2024-10-12 18:18:38,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:18:38" (1/1) ... [2024-10-12 18:18:39,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:18:39,368 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2024-10-12 18:18:39,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:18:39,429 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-12 18:18:39,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:18:39,480 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2024-10-12 18:18:39,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:18:39,504 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:18:39,537 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2024-10-12 18:18:39,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:18:39,603 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:18:39,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:39 WrapperNode [2024-10-12 18:18:39,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:18:39,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:18:39,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:18:39,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:18:39,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:39" (1/1) ... [2024-10-12 18:18:39,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:39" (1/1) ... [2024-10-12 18:18:39,650 INFO L138 Inliner]: procedures = 235, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 115 [2024-10-12 18:18:39,652 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:18:39,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:18:39,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:18:39,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:18:39,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:39" (1/1) ... [2024-10-12 18:18:39,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:39" (1/1) ... [2024-10-12 18:18:39,669 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:39" (1/1) ... [2024-10-12 18:18:39,705 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2024-10-12 18:18:39,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:39" (1/1) ... [2024-10-12 18:18:39,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:39" (1/1) ... [2024-10-12 18:18:39,724 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:39" (1/1) ... [2024-10-12 18:18:39,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:39" (1/1) ... [2024-10-12 18:18:39,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:39" (1/1) ... [2024-10-12 18:18:39,743 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:39" (1/1) ... [2024-10-12 18:18:39,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:18:39,751 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:18:39,751 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:18:39,751 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:18:39,752 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:39" (1/1) ... [2024-10-12 18:18:39,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:18:39,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:18:39,793 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) [2024-10-12 18:18:39,815 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 [2024-10-12 18:18:39,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-12 18:18:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-12 18:18:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 18:18:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 18:18:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2024-10-12 18:18:39,880 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2024-10-12 18:18:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 18:18:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-12 18:18:39,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-12 18:18:39,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-12 18:18:39,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-12 18:18:39,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 18:18:39,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-12 18:18:39,881 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2024-10-12 18:18:39,881 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2024-10-12 18:18:39,881 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-10-12 18:18:39,881 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-10-12 18:18:39,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 18:18:39,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:18:39,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 18:18:39,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 18:18:39,882 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2024-10-12 18:18:39,882 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2024-10-12 18:18:39,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:18:39,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:18:40,003 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:18:40,004 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:18:40,470 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-10-12 18:18:40,470 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:18:40,529 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:18:40,530 INFO L314 CfgBuilder]: Removed 41 assume(true) statements. [2024-10-12 18:18:40,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:18:40 BoogieIcfgContainer [2024-10-12 18:18:40,530 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:18:40,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:18:40,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:18:40,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:18:40,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:18:38" (1/3) ... [2024-10-12 18:18:40,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@441dd5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:18:40, skipping insertion in model container [2024-10-12 18:18:40,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:39" (2/3) ... [2024-10-12 18:18:40,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@441dd5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:18:40, skipping insertion in model container [2024-10-12 18:18:40,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:18:40" (3/3) ... [2024-10-12 18:18:40,537 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2024-10-12 18:18:40,550 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:18:40,551 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:18:40,627 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:18:40,636 INFO L333 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, 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;@14b6726d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:18:40,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:18:40,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-12 18:18:40,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-12 18:18:40,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:40,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:40,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:40,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:40,664 INFO L85 PathProgramCache]: Analyzing trace with hash -754496073, now seen corresponding path program 1 times [2024-10-12 18:18:40,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:18:40,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498885468] [2024-10-12 18:18:40,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:40,675 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 [2024-10-12 18:18:40,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:18:40,678 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) [2024-10-12 18:18:40,679 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 [2024-10-12 18:18:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:40,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-12 18:18:40,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:18:40,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:40,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:18:40,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:18:40,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498885468] [2024-10-12 18:18:40,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [498885468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:40,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:40,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 18:18:40,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886182807] [2024-10-12 18:18:40,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:40,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 18:18:40,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:18:40,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 18:18:40,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:18:40,800 INFO L87 Difference]: Start difference. First operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2024-10-12 18:18:40,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:40,889 INFO L93 Difference]: Finished difference Result 210 states and 377 transitions. [2024-10-12 18:18:40,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 18:18:40,893 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 8 [2024-10-12 18:18:40,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:40,901 INFO L225 Difference]: With dead ends: 210 [2024-10-12 18:18:40,901 INFO L226 Difference]: Without dead ends: 99 [2024-10-12 18:18:40,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:18:40,910 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:40,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:18:40,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-12 18:18:40,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-12 18:18:40,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 89 states have internal predecessors, (94), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-12 18:18:40,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2024-10-12 18:18:40,956 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 8 [2024-10-12 18:18:40,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:40,957 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2024-10-12 18:18:40,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2024-10-12 18:18:40,958 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2024-10-12 18:18:40,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 18:18:40,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:40,960 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:40,966 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 [2024-10-12 18:18:41,160 WARN L453 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 [2024-10-12 18:18:41,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:41,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:41,163 INFO L85 PathProgramCache]: Analyzing trace with hash 437181209, now seen corresponding path program 1 times [2024-10-12 18:18:41,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:18:41,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239038781] [2024-10-12 18:18:41,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:41,166 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 [2024-10-12 18:18:41,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:18:41,168 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) [2024-10-12 18:18:41,170 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 [2024-10-12 18:18:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:41,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 18:18:41,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:18:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:41,377 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:18:41,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:18:41,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239038781] [2024-10-12 18:18:41,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239038781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:41,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:41,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:18:41,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985372832] [2024-10-12 18:18:41,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:41,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:18:41,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:18:41,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:18:41,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:18:41,384 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 3 states have internal predecessors, (13), 2 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) [2024-10-12 18:18:41,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:41,798 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2024-10-12 18:18:41,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:18:41,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 3 states have internal predecessors, (13), 2 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 [2024-10-12 18:18:41,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:41,806 INFO L225 Difference]: With dead ends: 101 [2024-10-12 18:18:41,806 INFO L226 Difference]: Without dead ends: 98 [2024-10-12 18:18:41,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:18:41,807 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 166 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:41,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 208 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 18:18:41,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-12 18:18:41,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-12 18:18:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 88 states have internal predecessors, (93), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-12 18:18:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2024-10-12 18:18:41,825 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 17 [2024-10-12 18:18:41,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:41,826 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2024-10-12 18:18:41,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 3 states have internal predecessors, (13), 2 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) [2024-10-12 18:18:41,826 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2024-10-12 18:18:41,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 18:18:41,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:41,827 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:41,833 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 [2024-10-12 18:18:42,031 WARN L453 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 [2024-10-12 18:18:42,032 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:42,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:42,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1443607003, now seen corresponding path program 1 times [2024-10-12 18:18:42,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:18:42,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416351612] [2024-10-12 18:18:42,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:42,034 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 [2024-10-12 18:18:42,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:18:42,037 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) [2024-10-12 18:18:42,038 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 [2024-10-12 18:18:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:42,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 18:18:42,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:18:42,298 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-12 18:18:42,300 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 [2024-10-12 18:18:42,912 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-10-12 18:18:42,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 258 treesize of output 269 [2024-10-12 18:18:42,942 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 179 treesize of output 140 [2024-10-12 18:18:42,984 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 [2024-10-12 18:18:43,028 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 [2024-10-12 18:18:43,172 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 [2024-10-12 18:18:43,549 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:18:43,574 INFO L349 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2024-10-12 18:18:43,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 110 treesize of output 89 [2024-10-12 18:18:43,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-12 18:18:43,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:18:43,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 16 [2024-10-12 18:18:43,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-12 18:18:44,110 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-12 18:18:44,110 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-10-12 18:18:44,220 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 16 treesize of output 8 [2024-10-12 18:18:44,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:44,237 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:18:44,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:18:44,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416351612] [2024-10-12 18:18:44,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416351612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:44,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:44,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 18:18:44,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337218818] [2024-10-12 18:18:44,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:44,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 18:18:44,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:18:44,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 18:18:44,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-12 18:18:44,240 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 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) [2024-10-12 18:18:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:45,901 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2024-10-12 18:18:45,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 18:18:45,902 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 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 20 [2024-10-12 18:18:45,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:45,904 INFO L225 Difference]: With dead ends: 187 [2024-10-12 18:18:45,904 INFO L226 Difference]: Without dead ends: 181 [2024-10-12 18:18:45,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-10-12 18:18:45,905 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 506 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:45,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 502 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 18:18:45,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-12 18:18:45,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 161. [2024-10-12 18:18:45,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 133 states have (on average 1.263157894736842) internal successors, (168), 147 states have internal predecessors, (168), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-12 18:18:45,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 198 transitions. [2024-10-12 18:18:45,928 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 198 transitions. Word has length 20 [2024-10-12 18:18:45,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:45,928 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 198 transitions. [2024-10-12 18:18:45,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 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) [2024-10-12 18:18:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 198 transitions. [2024-10-12 18:18:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 18:18:45,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:45,929 INFO L215 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] [2024-10-12 18:18:45,934 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 [2024-10-12 18:18:46,133 WARN L453 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 [2024-10-12 18:18:46,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:46,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:46,135 INFO L85 PathProgramCache]: Analyzing trace with hash 722118342, now seen corresponding path program 1 times [2024-10-12 18:18:46,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:18:46,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730413848] [2024-10-12 18:18:46,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:46,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 18:18:46,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:18:46,140 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) [2024-10-12 18:18:46,141 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 [2024-10-12 18:18:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:46,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-12 18:18:46,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:18:46,407 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-12 18:18:46,407 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 [2024-10-12 18:18:46,454 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 16 treesize of output 11 [2024-10-12 18:18:46,459 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 16 treesize of output 11 [2024-10-12 18:18:46,600 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 41 treesize of output 46 [2024-10-12 18:18:46,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2024-10-12 18:18:47,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:18:47,527 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 25 treesize of output 14 [2024-10-12 18:18:47,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2024-10-12 18:18:47,756 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 16 treesize of output 8 [2024-10-12 18:18:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:47,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:18:47,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:18:47,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730413848] [2024-10-12 18:18:47,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730413848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:47,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:47,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 18:18:47,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185858380] [2024-10-12 18:18:47,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:47,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 18:18:47,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:18:47,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 18:18:47,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=86, Unknown=4, NotChecked=0, Total=110 [2024-10-12 18:18:47,787 INFO L87 Difference]: Start difference. First operand 161 states and 198 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 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) [2024-10-12 18:18:52,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:18:54,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:19:00,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:19:04,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:19:08,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:19:13,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:19:17,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:19:21,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:19:25,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:19:29,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:19:33,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]