./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c -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 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:24:56,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:24:56,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:24:56,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:24:56,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:24:56,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:24:56,897 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:24:56,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:24:56,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:24:56,900 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:24:56,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:24:56,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:24:56,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:24:56,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:24:56,902 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:24:56,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:24:56,902 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:24:56,903 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:24:56,903 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:24:56,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:24:56,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:24:56,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:24:56,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:24:56,906 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:24:56,906 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:24:56,906 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:24:56,906 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:24:56,906 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:24:56,907 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:24:56,907 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:24:56,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:24:56,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:24:56,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:24:56,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:24:56,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:24:56,909 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:24:56,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:24:56,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:24:56,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:24:56,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:24:56,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:24:56,911 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:24:56,911 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 -> 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b [2024-11-09 23:24:57,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:24:57,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:24:57,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:24:57,178 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:24:57,179 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:24:57,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2024-11-09 23:24:58,583 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:24:58,758 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:24:58,759 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2024-11-09 23:24:58,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7604cd5b2/9821113d383c4f71acd90c68f3eb40c9/FLAGc96e75672 [2024-11-09 23:24:58,776 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7604cd5b2/9821113d383c4f71acd90c68f3eb40c9 [2024-11-09 23:24:58,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:24:58,779 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:24:58,780 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:24:58,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:24:58,786 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:24:58,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:24:58" (1/1) ... [2024-11-09 23:24:58,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a02494d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:58, skipping insertion in model container [2024-11-09 23:24:58,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:24:58" (1/1) ... [2024-11-09 23:24:58,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:24:58,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2024-11-09 23:24:59,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:24:59,032 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:24:59,050 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2024-11-09 23:24:59,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:24:59,088 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:24:59,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:59 WrapperNode [2024-11-09 23:24:59,092 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:24:59,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:24:59,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:24:59,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:24:59,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:59" (1/1) ... [2024-11-09 23:24:59,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:59" (1/1) ... [2024-11-09 23:24:59,129 INFO L138 Inliner]: procedures = 13, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2024-11-09 23:24:59,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:24:59,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:24:59,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:24:59,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:24:59,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:59" (1/1) ... [2024-11-09 23:24:59,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:59" (1/1) ... [2024-11-09 23:24:59,142 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:59" (1/1) ... [2024-11-09 23:24:59,156 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 6, 6]. 43 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 1, 1]. The 4 writes are split as follows [0, 2, 2]. [2024-11-09 23:24:59,158 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:59" (1/1) ... [2024-11-09 23:24:59,158 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:59" (1/1) ... [2024-11-09 23:24:59,163 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:59" (1/1) ... [2024-11-09 23:24:59,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:59" (1/1) ... [2024-11-09 23:24:59,164 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:59" (1/1) ... [2024-11-09 23:24:59,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:59" (1/1) ... [2024-11-09 23:24:59,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:24:59,168 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:24:59,171 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:24:59,171 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:24:59,172 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:59" (1/1) ... [2024-11-09 23:24:59,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:24:59,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:24:59,227 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-11-09 23:24:59,229 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-11-09 23:24:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:24:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:24:59,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 23:24:59,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 23:24:59,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 23:24:59,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 23:24:59,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 23:24:59,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 23:24:59,278 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_21_0 [2024-11-09 23:24:59,278 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_21_0 [2024-11-09 23:24:59,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:24:59,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:24:59,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 23:24:59,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 23:24:59,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 23:24:59,279 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_21_0 [2024-11-09 23:24:59,279 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_21_0 [2024-11-09 23:24:59,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 23:24:59,368 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:24:59,371 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:24:59,504 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L61: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset; [2024-11-09 23:24:59,523 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-09 23:24:59,523 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:24:59,538 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:24:59,539 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:24:59,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:24:59 BoogieIcfgContainer [2024-11-09 23:24:59,539 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:24:59,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:24:59,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:24:59,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:24:59,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:24:58" (1/3) ... [2024-11-09 23:24:59,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f58ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:24:59, skipping insertion in model container [2024-11-09 23:24:59,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:59" (2/3) ... [2024-11-09 23:24:59,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f58ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:24:59, skipping insertion in model container [2024-11-09 23:24:59,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:24:59" (3/3) ... [2024-11-09 23:24:59,548 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_2.c [2024-11-09 23:24:59,562 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:24:59,562 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:24:59,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:24:59,622 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;@364e1a75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:24:59,622 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:24:59,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.3125) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 23:24:59,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 23:24:59,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:24:59,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:24:59,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:24:59,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:24:59,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1504494570, now seen corresponding path program 1 times [2024-11-09 23:24:59,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:24:59,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804780429] [2024-11-09 23:24:59,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:24:59,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:24:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:00,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:00,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:25:00,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:25:00,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804780429] [2024-11-09 23:25:00,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804780429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:25:00,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:25:00,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:25:00,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117536470] [2024-11-09 23:25:00,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:25:00,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:25:00,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:25:00,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:25:00,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:25:00,234 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.3125) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:25:00,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:25:00,380 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2024-11-09 23:25:00,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:25:00,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-09 23:25:00,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:25:00,391 INFO L225 Difference]: With dead ends: 37 [2024-11-09 23:25:00,391 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 23:25:00,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:25:00,396 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:25:00,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:25:00,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 23:25:00,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-09 23:25:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 23:25:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-09 23:25:00,429 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 11 [2024-11-09 23:25:00,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:25:00,429 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-09 23:25:00,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:25:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-09 23:25:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 23:25:00,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:25:00,431 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:25:00,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:25:00,432 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:25:00,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:25:00,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1403001686, now seen corresponding path program 1 times [2024-11-09 23:25:00,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:25:00,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649321345] [2024-11-09 23:25:00,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:25:00,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:25:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:00,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:00,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:00,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:25:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 23:25:00,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:25:00,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649321345] [2024-11-09 23:25:00,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649321345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:25:00,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:25:00,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:25:00,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862301542] [2024-11-09 23:25:00,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:25:00,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:25:00,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:25:00,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:25:00,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:25:00,788 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 23:25:00,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:25:00,892 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-09 23:25:00,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:25:00,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2024-11-09 23:25:00,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:25:00,895 INFO L225 Difference]: With dead ends: 43 [2024-11-09 23:25:00,895 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 23:25:00,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:25:00,896 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:25:00,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:25:00,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 23:25:00,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 23:25:00,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 23:25:00,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-09 23:25:00,910 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 22 [2024-11-09 23:25:00,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:25:00,911 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-09 23:25:00,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 23:25:00,911 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-11-09 23:25:00,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 23:25:00,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:25:00,913 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:25:00,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:25:00,913 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:25:00,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:25:00,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1171971531, now seen corresponding path program 1 times [2024-11-09 23:25:00,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:25:00,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885027919] [2024-11-09 23:25:00,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:25:00,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:25:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:01,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:01,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:01,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:01,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 23:25:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:01,525 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 23:25:01,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:25:01,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885027919] [2024-11-09 23:25:01,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885027919] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:25:01,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390121842] [2024-11-09 23:25:01,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:25:01,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:25:01,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:25:01,533 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-11-09 23:25:01,534 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-11-09 23:25:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:01,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 23:25:01,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:25:01,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 23:25:01,937 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 23:25:01,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:25:02,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 23:25:02,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390121842] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:25:02,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:25:02,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 25 [2024-11-09 23:25:02,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534417260] [2024-11-09 23:25:02,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:25:02,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 23:25:02,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:25:02,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 23:25:02,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2024-11-09 23:25:02,447 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 25 states, 19 states have (on average 2.0) internal successors, (38), 20 states have internal predecessors, (38), 10 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (11), 7 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-09 23:25:02,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:25:02,809 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2024-11-09 23:25:02,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 23:25:02,809 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 2.0) internal successors, (38), 20 states have internal predecessors, (38), 10 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (11), 7 states have call predecessors, (11), 10 states have call successors, (11) Word has length 27 [2024-11-09 23:25:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:25:02,811 INFO L225 Difference]: With dead ends: 49 [2024-11-09 23:25:02,811 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 23:25:02,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=880, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 23:25:02,813 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:25:02,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 91 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:25:02,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 23:25:02,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-09 23:25:02,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 23:25:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-09 23:25:02,821 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 27 [2024-11-09 23:25:02,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:25:02,822 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-09 23:25:02,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 19 states have (on average 2.0) internal successors, (38), 20 states have internal predecessors, (38), 10 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (11), 7 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-09 23:25:02,822 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-09 23:25:02,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 23:25:02,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:25:02,824 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:25:02,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 23:25:03,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:25:03,025 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:25:03,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:25:03,025 INFO L85 PathProgramCache]: Analyzing trace with hash -488170110, now seen corresponding path program 2 times [2024-11-09 23:25:03,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:25:03,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802655195] [2024-11-09 23:25:03,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:25:03,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:25:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:03,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:03,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:03,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:03,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:03,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:25:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:03,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:03,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:03,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:03,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:25:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:03,773 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 23:25:03,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:25:03,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802655195] [2024-11-09 23:25:03,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802655195] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:25:03,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102051315] [2024-11-09 23:25:03,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 23:25:03,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:25:03,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:25:03,776 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:25:03,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 23:25:03,875 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 23:25:03,875 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:25:03,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 23:25:03,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:25:03,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 23:25:04,142 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-09 23:25:04,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:25:05,309 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 23:25:05,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102051315] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:25:05,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:25:05,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 14] total 29 [2024-11-09 23:25:05,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454296584] [2024-11-09 23:25:05,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:25:05,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 23:25:05,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:25:05,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 23:25:05,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2024-11-09 23:25:05,312 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 29 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 24 states have internal predecessors, (46), 10 states have call successors, (19), 7 states have call predecessors, (19), 9 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) [2024-11-09 23:25:05,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:25:05,570 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2024-11-09 23:25:05,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 23:25:05,573 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 24 states have internal predecessors, (46), 10 states have call successors, (19), 7 states have call predecessors, (19), 9 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) Word has length 53 [2024-11-09 23:25:05,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:25:05,574 INFO L225 Difference]: With dead ends: 57 [2024-11-09 23:25:05,574 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 23:25:05,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=953, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 23:25:05,575 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:25:05,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 160 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:25:05,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 23:25:05,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 23:25:05,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 8 states have return successors, (10), 8 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-09 23:25:05,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-09 23:25:05,586 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 53 [2024-11-09 23:25:05,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:25:05,586 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-09 23:25:05,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 24 states have internal predecessors, (46), 10 states have call successors, (19), 7 states have call predecessors, (19), 9 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) [2024-11-09 23:25:05,586 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-09 23:25:05,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 23:25:05,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:25:05,588 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:25:05,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 23:25:05,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 23:25:05,793 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:25:05,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:25:05,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1052617986, now seen corresponding path program 3 times [2024-11-09 23:25:05,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:25:05,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48105310] [2024-11-09 23:25:05,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:25:05,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:25:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:06,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:06,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:06,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:06,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:07,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:07,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:07,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 23:25:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:07,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:07,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:07,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:07,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:07,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:07,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 23:25:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:07,199 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 10 proven. 118 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-09 23:25:07,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:25:07,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48105310] [2024-11-09 23:25:07,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48105310] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:25:07,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541888218] [2024-11-09 23:25:07,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 23:25:07,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:25:07,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:25:07,228 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:25:07,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 23:25:07,327 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 23:25:07,327 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:25:07,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 23:25:07,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:25:07,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 23:25:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2024-11-09 23:25:07,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:25:08,525 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-09 23:25:08,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541888218] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:25:08,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:25:08,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 14] total 35 [2024-11-09 23:25:08,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442982373] [2024-11-09 23:25:08,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:25:08,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-09 23:25:08,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:25:08,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 23:25:08,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1032, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 23:25:08,529 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 35 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 29 states have internal predecessors, (51), 13 states have call successors, (17), 7 states have call predecessors, (17), 13 states have return successors, (19), 13 states have call predecessors, (19), 13 states have call successors, (19) [2024-11-09 23:25:08,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:25:08,928 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2024-11-09 23:25:08,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 23:25:08,929 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 29 states have internal predecessors, (51), 13 states have call successors, (17), 7 states have call predecessors, (17), 13 states have return successors, (19), 13 states have call predecessors, (19), 13 states have call successors, (19) Word has length 73 [2024-11-09 23:25:08,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:25:08,930 INFO L225 Difference]: With dead ends: 65 [2024-11-09 23:25:08,930 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 23:25:08,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=312, Invalid=1758, Unknown=0, NotChecked=0, Total=2070 [2024-11-09 23:25:08,932 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:25:08,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 143 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:25:08,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 23:25:08,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-09 23:25:08,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-09 23:25:08,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-11-09 23:25:08,940 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 73 [2024-11-09 23:25:08,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:25:08,941 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-09 23:25:08,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 29 states have internal predecessors, (51), 13 states have call successors, (17), 7 states have call predecessors, (17), 13 states have return successors, (19), 13 states have call predecessors, (19), 13 states have call successors, (19) [2024-11-09 23:25:08,941 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-11-09 23:25:08,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 23:25:08,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:25:08,943 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 15, 15, 15, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:25:08,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 23:25:09,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:25:09,148 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:25:09,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:25:09,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1163645011, now seen corresponding path program 4 times [2024-11-09 23:25:09,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:25:09,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646819497] [2024-11-09 23:25:09,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:25:09,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:25:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:09,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:10,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:10,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:10,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:11,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:11,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:11,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:11,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 23:25:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:11,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:11,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:11,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:11,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:11,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:11,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:11,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 23:25:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:11,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:11,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:11,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:11,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:11,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:11,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:11,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 23:25:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:11,314 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 14 proven. 307 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2024-11-09 23:25:11,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:25:11,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646819497] [2024-11-09 23:25:11,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646819497] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:25:11,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163583842] [2024-11-09 23:25:11,315 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 23:25:11,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:25:11,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:25:11,316 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:25:11,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 23:25:11,463 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 23:25:11,463 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:25:11,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-11-09 23:25:11,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:25:11,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 23:25:11,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 23:25:11,846 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 346 proven. 35 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2024-11-09 23:25:11,846 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:25:14,603 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 6 proven. 414 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-11-09 23:25:14,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163583842] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:25:14,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:25:14,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 26] total 43 [2024-11-09 23:25:14,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978621994] [2024-11-09 23:25:14,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:25:14,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-09 23:25:14,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:25:14,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-09 23:25:14,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1458, Unknown=0, NotChecked=0, Total=1806 [2024-11-09 23:25:14,608 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 43 states, 33 states have (on average 1.878787878787879) internal successors, (62), 35 states have internal predecessors, (62), 12 states have call successors, (24), 10 states have call predecessors, (24), 15 states have return successors, (26), 13 states have call predecessors, (26), 12 states have call successors, (26) [2024-11-09 23:25:14,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:25:14,927 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2024-11-09 23:25:14,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:25:14,928 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 33 states have (on average 1.878787878787879) internal successors, (62), 35 states have internal predecessors, (62), 12 states have call successors, (24), 10 states have call predecessors, (24), 15 states have return successors, (26), 13 states have call predecessors, (26), 12 states have call successors, (26) Word has length 119 [2024-11-09 23:25:14,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:25:14,929 INFO L225 Difference]: With dead ends: 71 [2024-11-09 23:25:14,929 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 23:25:14,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 248 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=537, Invalid=2013, Unknown=0, NotChecked=0, Total=2550 [2024-11-09 23:25:14,931 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:25:14,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 241 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:25:14,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 23:25:14,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-09 23:25:14,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 11 states have return successors, (13), 11 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-09 23:25:14,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-09 23:25:14,938 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 119 [2024-11-09 23:25:14,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:25:14,938 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-09 23:25:14,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 33 states have (on average 1.878787878787879) internal successors, (62), 35 states have internal predecessors, (62), 12 states have call successors, (24), 10 states have call predecessors, (24), 15 states have return successors, (26), 13 states have call predecessors, (26), 12 states have call successors, (26) [2024-11-09 23:25:14,938 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-11-09 23:25:14,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 23:25:14,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:25:14,940 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 18, 18, 18, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:25:14,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 23:25:15,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:25:15,140 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:25:15,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:25:15,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1740939994, now seen corresponding path program 5 times [2024-11-09 23:25:15,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:25:15,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242968065] [2024-11-09 23:25:15,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:25:15,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:25:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:15,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:25:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:25:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:25:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2024-11-09 23:25:16,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:25:16,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242968065] [2024-11-09 23:25:16,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242968065] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:25:16,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919712210] [2024-11-09 23:25:16,737 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 23:25:16,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:25:16,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:25:16,739 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:25:16,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 23:25:17,159 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-11-09 23:25:17,159 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:25:17,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-09 23:25:17,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:25:17,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 23:25:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1011 trivial. 0 not checked. [2024-11-09 23:25:17,468 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:25:18,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2024-11-09 23:25:18,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919712210] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:25:18,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:25:18,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 18] total 35 [2024-11-09 23:25:18,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041595947] [2024-11-09 23:25:18,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:25:18,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-09 23:25:18,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:25:18,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 23:25:18,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=978, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 23:25:18,664 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 35 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 28 states have internal predecessors, (45), 15 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (18), 14 states have call predecessors, (18), 15 states have call successors, (18) [2024-11-09 23:25:18,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:25:18,904 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-11-09 23:25:18,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 23:25:18,905 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 28 states have internal predecessors, (45), 15 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (18), 14 states have call predecessors, (18), 15 states have call successors, (18) Word has length 134 [2024-11-09 23:25:18,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:25:18,909 INFO L225 Difference]: With dead ends: 47 [2024-11-09 23:25:18,909 INFO L226 Difference]: Without dead ends: 42 [2024-11-09 23:25:18,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 290 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=323, Invalid=1317, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 23:25:18,910 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:25:18,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 146 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:25:18,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-09 23:25:18,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-09 23:25:18,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 13 states have return successors, (15), 13 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 23:25:18,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2024-11-09 23:25:18,926 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 134 [2024-11-09 23:25:18,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:25:18,926 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-11-09 23:25:18,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 28 states have internal predecessors, (45), 15 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (18), 14 states have call predecessors, (18), 15 states have call successors, (18) [2024-11-09 23:25:18,927 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2024-11-09 23:25:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-09 23:25:18,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:25:18,932 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:25:18,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 23:25:19,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:25:19,133 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:25:19,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:25:19,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1992596754, now seen corresponding path program 6 times [2024-11-09 23:25:19,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:25:19,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657372021] [2024-11-09 23:25:19,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:25:19,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:25:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:20,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:21,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:21,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:21,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:21,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:21,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:21,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:21,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:21,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:25:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:21,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:21,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:21,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:21,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:21,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:21,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:21,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:21,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:25:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:25:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:25:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:25:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:22,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 16 proven. 35 refuted. 0 times theorem prover too weak. 2854 trivial. 0 not checked. [2024-11-09 23:25:22,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:25:22,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657372021] [2024-11-09 23:25:22,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657372021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:25:22,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193945717] [2024-11-09 23:25:22,880 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 23:25:22,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:25:22,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:25:22,882 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:25:22,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 23:25:24,745 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2024-11-09 23:25:24,745 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:25:24,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-09 23:25:24,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:25:24,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 23:25:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 2870 trivial. 0 not checked. [2024-11-09 23:25:25,139 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:25:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 2815 trivial. 0 not checked. [2024-11-09 23:25:27,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193945717] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:25:27,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:25:27,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 26] total 45 [2024-11-09 23:25:27,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442395597] [2024-11-09 23:25:27,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:25:27,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-09 23:25:27,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:25:27,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-09 23:25:27,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=1625, Unknown=0, NotChecked=0, Total=1980 [2024-11-09 23:25:27,685 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 45 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 36 states have internal predecessors, (55), 19 states have call successors, (21), 10 states have call predecessors, (21), 14 states have return successors, (26), 20 states have call predecessors, (26), 19 states have call successors, (26) [2024-11-09 23:25:28,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:25:28,008 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2024-11-09 23:25:28,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:25:28,008 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 36 states have internal predecessors, (55), 19 states have call successors, (21), 10 states have call predecessors, (21), 14 states have return successors, (26), 20 states have call predecessors, (26), 19 states have call successors, (26) Word has length 216 [2024-11-09 23:25:28,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:25:28,010 INFO L225 Difference]: With dead ends: 49 [2024-11-09 23:25:28,010 INFO L226 Difference]: Without dead ends: 44 [2024-11-09 23:25:28,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 478 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=536, Invalid=2116, Unknown=0, NotChecked=0, Total=2652 [2024-11-09 23:25:28,012 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 42 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:25:28,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 175 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:25:28,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-09 23:25:28,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-09 23:25:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.12) internal successors, (28), 27 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 14 states have return successors, (16), 14 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-09 23:25:28,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2024-11-09 23:25:28,020 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 216 [2024-11-09 23:25:28,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:25:28,020 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2024-11-09 23:25:28,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 36 states have internal predecessors, (55), 19 states have call successors, (21), 10 states have call predecessors, (21), 14 states have return successors, (26), 20 states have call predecessors, (26), 19 states have call successors, (26) [2024-11-09 23:25:28,021 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2024-11-09 23:25:28,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-09 23:25:28,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:25:28,025 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:25:28,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 23:25:28,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:25:28,226 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:25:28,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:25:28,227 INFO L85 PathProgramCache]: Analyzing trace with hash -2007461030, now seen corresponding path program 7 times [2024-11-09 23:25:28,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:25:28,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591152273] [2024-11-09 23:25:28,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:25:28,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:25:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:29,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:30,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:31,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:31,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:31,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:31,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:31,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:31,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:31,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:25:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:32,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:32,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:32,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:32,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:32,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:32,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:32,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:32,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:25:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:32,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:32,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:32,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:32,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:32,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:32,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:32,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:32,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:25:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:32,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:32,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:32,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:32,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:32,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:32,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:33,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:33,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:25:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:33,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:33,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:33,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:33,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:33,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:33,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:33,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:33,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:25:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:33,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:33,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:33,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:33,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:33,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:33,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:33,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:33,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:25:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 20 proven. 64 refuted. 0 times theorem prover too weak. 4119 trivial. 0 not checked. [2024-11-09 23:25:33,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:25:33,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591152273] [2024-11-09 23:25:33,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591152273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:25:33,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668927138] [2024-11-09 23:25:33,432 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 23:25:33,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:25:33,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:25:33,434 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:25:33,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 23:25:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:33,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-09 23:25:33,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:25:33,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 23:25:34,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 23:25:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 4150 trivial. 0 not checked. [2024-11-09 23:25:34,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:25:34,825 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 8 treesize of output 4 [2024-11-09 23:25:35,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668927138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:25:35,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 23:25:35,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 29 [2024-11-09 23:25:35,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029674556] [2024-11-09 23:25:35,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 23:25:35,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 23:25:35,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:25:35,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 23:25:35,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2024-11-09 23:25:35,284 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 29 states, 24 states have (on average 1.75) internal successors, (42), 26 states have internal predecessors, (42), 12 states have call successors, (15), 4 states have call predecessors, (15), 12 states have return successors, (18), 16 states have call predecessors, (18), 12 states have call successors, (18) [2024-11-09 23:25:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:25:36,186 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2024-11-09 23:25:36,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 23:25:36,186 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 24 states have (on average 1.75) internal successors, (42), 26 states have internal predecessors, (42), 12 states have call successors, (15), 4 states have call predecessors, (15), 12 states have return successors, (18), 16 states have call predecessors, (18), 12 states have call successors, (18) Word has length 257 [2024-11-09 23:25:36,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:25:36,188 INFO L225 Difference]: With dead ends: 64 [2024-11-09 23:25:36,188 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 23:25:36,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=336, Invalid=2114, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 23:25:36,189 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 49 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:25:36,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 182 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:25:36,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 23:25:36,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-11-09 23:25:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.096774193548387) internal successors, (34), 33 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 17 states have return successors, (22), 18 states have call predecessors, (22), 6 states have call successors, (22) [2024-11-09 23:25:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2024-11-09 23:25:36,209 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 257 [2024-11-09 23:25:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:25:36,210 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2024-11-09 23:25:36,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 24 states have (on average 1.75) internal successors, (42), 26 states have internal predecessors, (42), 12 states have call successors, (15), 4 states have call predecessors, (15), 12 states have return successors, (18), 16 states have call predecessors, (18), 12 states have call successors, (18) [2024-11-09 23:25:36,210 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2024-11-09 23:25:36,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-09 23:25:36,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:25:36,213 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:25:36,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 23:25:36,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:25:36,414 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:25:36,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:25:36,414 INFO L85 PathProgramCache]: Analyzing trace with hash -2007461991, now seen corresponding path program 1 times [2024-11-09 23:25:36,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:25:36,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886882969] [2024-11-09 23:25:36,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:25:36,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:25:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:37,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:37,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:37,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:37,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:37,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:37,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:37,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:37,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:37,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:25:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:38,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:38,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:38,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:38,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:38,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:38,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:38,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:38,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:25:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:25:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:25:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:25:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:39,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:40,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:40,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:40,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:25:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:40,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:25:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:40,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 937 proven. 34 refuted. 0 times theorem prover too weak. 3232 trivial. 0 not checked. [2024-11-09 23:25:40,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:25:40,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886882969] [2024-11-09 23:25:40,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886882969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:25:40,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83706781] [2024-11-09 23:25:40,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:25:40,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:25:40,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:25:40,176 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:25:40,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 23:25:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:25:40,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 144 conjuncts are in the unsatisfiable core [2024-11-09 23:25:40,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:25:40,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 23:25:40,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 23:25:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 1171 proven. 81 refuted. 0 times theorem prover too weak. 2951 trivial. 0 not checked. [2024-11-09 23:25:40,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:25:41,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-11-09 23:25:42,255 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 25 treesize of output 21 [2024-11-09 23:25:42,658 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 25 treesize of output 21 [2024-11-09 23:25:43,003 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 25 treesize of output 21 [2024-11-09 23:25:43,279 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 25 treesize of output 21 [2024-11-09 23:25:44,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83706781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:25:44,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 23:25:44,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 23 [2024-11-09 23:25:44,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987916466] [2024-11-09 23:25:44,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 23:25:44,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 23:25:44,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:25:44,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 23:25:44,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2024-11-09 23:25:44,073 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 23 states, 20 states have (on average 2.1) internal successors, (42), 22 states have internal predecessors, (42), 8 states have call successors, (15), 3 states have call predecessors, (15), 11 states have return successors, (15), 11 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-09 23:25:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:25:44,522 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2024-11-09 23:25:44,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 23:25:44,523 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.1) internal successors, (42), 22 states have internal predecessors, (42), 8 states have call successors, (15), 3 states have call predecessors, (15), 11 states have return successors, (15), 11 states have call predecessors, (15), 8 states have call successors, (15) Word has length 257 [2024-11-09 23:25:44,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:25:44,524 INFO L225 Difference]: With dead ends: 57 [2024-11-09 23:25:44,524 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 23:25:44,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=1375, Unknown=0, NotChecked=0, Total=1560 [2024-11-09 23:25:44,527 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:25:44,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 179 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:25:44,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 23:25:44,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 23:25:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:25:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 23:25:44,529 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 257 [2024-11-09 23:25:44,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:25:44,529 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 23:25:44,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.1) internal successors, (42), 22 states have internal predecessors, (42), 8 states have call successors, (15), 3 states have call predecessors, (15), 11 states have return successors, (15), 11 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-09 23:25:44,529 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 23:25:44,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 23:25:44,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 23:25:44,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 23:25:44,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 23:25:44,736 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2024-11-09 23:25:44,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 23:25:45,878 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 23:25:45,885 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_20_to_21_0 contained old-variable. Original clause: (and (= |#memory_int#2| |old(#memory_int#2)|) (= (select (select |old(#memory_int#2)| |func_to_recursive_line_20_to_21_0_#in~b.base|) |func_to_recursive_line_20_to_21_0_#in~b.offset|) 6) (= |#memory_int#1| |old(#memory_int#1)|)) Eliminated clause: (= (select (select |#memory_int#2| |func_to_recursive_line_20_to_21_0_#in~b.base|) |func_to_recursive_line_20_to_21_0_#in~b.offset|) 6) [2024-11-09 23:25:45,893 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-09 23:25:45,894 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-09 23:25:45,894 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-11-09 23:25:45,897 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 23:25:45,897 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 23:25:45,897 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-11-09 23:25:45,897 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-09 23:25:45,897 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-09 23:25:45,897 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-11-09 23:25:45,897 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-09 23:25:45,897 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-09 23:25:45,897 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 23:25:45,897 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 23:25:45,897 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 23:25:45,898 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 23:25:45,898 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-11-09 23:25:45,898 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-09 23:25:45,898 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-11-09 23:25:45,898 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-11-09 23:25:45,902 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_21_to_21_0 contained old-variable. Original clause: (= |#memory_int#2| |old(#memory_int#2)|) Eliminated clause: true [2024-11-09 23:25:45,903 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-09 23:25:45,904 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-09 23:25:45,904 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-11-09 23:25:45,904 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-09 23:25:45,904 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-11-09 23:25:45,904 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-11-09 23:25:45,904 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-09 23:25:45,905 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-09 23:25:45,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:25:45 BoogieIcfgContainer [2024-11-09 23:25:45,906 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 23:25:45,906 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 23:25:45,906 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 23:25:45,907 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 23:25:45,907 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:24:59" (3/4) ... [2024-11-09 23:25:45,909 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 23:25:45,912 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_21_0 [2024-11-09 23:25:45,913 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_21_to_21_0 [2024-11-09 23:25:45,916 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-09 23:25:45,916 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-09 23:25:45,916 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 23:25:45,916 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 23:25:45,984 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 23:25:45,984 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 23:25:45,984 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 23:25:45,985 INFO L158 Benchmark]: Toolchain (without parser) took 47205.65ms. Allocated memory was 172.0MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 110.9MB in the beginning and 1.0GB in the end (delta: -913.1MB). Peak memory consumption was 274.8MB. Max. memory is 16.1GB. [2024-11-09 23:25:45,985 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 96.5MB. Free memory was 48.7MB in the beginning and 48.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:25:45,985 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.59ms. Allocated memory is still 172.0MB. Free memory was 110.9MB in the beginning and 143.5MB in the end (delta: -32.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 23:25:45,985 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.37ms. Allocated memory is still 172.0MB. Free memory was 143.5MB in the beginning and 142.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:25:45,986 INFO L158 Benchmark]: Boogie Preprocessor took 36.59ms. Allocated memory is still 172.0MB. Free memory was 142.3MB in the beginning and 140.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:25:45,986 INFO L158 Benchmark]: IcfgBuilder took 371.50ms. Allocated memory is still 172.0MB. Free memory was 140.2MB in the beginning and 128.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 23:25:45,986 INFO L158 Benchmark]: TraceAbstraction took 46365.18ms. Allocated memory was 172.0MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 126.7MB in the beginning and 1.0GB in the end (delta: -902.6MB). Peak memory consumption was 285.3MB. Max. memory is 16.1GB. [2024-11-09 23:25:45,986 INFO L158 Benchmark]: Witness Printer took 77.92ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 23:25:45,988 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.21ms. Allocated memory is still 96.5MB. Free memory was 48.7MB in the beginning and 48.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.59ms. Allocated memory is still 172.0MB. Free memory was 110.9MB in the beginning and 143.5MB in the end (delta: -32.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.37ms. Allocated memory is still 172.0MB. Free memory was 143.5MB in the beginning and 142.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.59ms. Allocated memory is still 172.0MB. Free memory was 142.3MB in the beginning and 140.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 371.50ms. Allocated memory is still 172.0MB. Free memory was 140.2MB in the beginning and 128.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 46365.18ms. Allocated memory was 172.0MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 126.7MB in the beginning and 1.0GB in the end (delta: -902.6MB). Peak memory consumption was 285.3MB. Max. memory is 16.1GB. * Witness Printer took 77.92ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 69]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.1s, OverallIterations: 10, TraceHistogramMax: 42, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 261 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 255 mSDsluCounter, 1459 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1310 mSDsCounter, 192 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2131 IncrementalHoareTripleChecker+Invalid, 2323 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 192 mSolverCounterUnsat, 149 mSDtfsCounter, 2131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2413 GetRequests, 2052 SyntacticMatches, 16 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4305 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=9, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 35.8s InterpolantComputationTime, 2305 NumberOfCodeBlocks, 2254 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 2903 ConstructedInterpolants, 0 QuantifiedInterpolants, 10861 SizeOfPredicates, 92 NumberOfNonLiveVariables, 4606 ConjunctsInSsa, 588 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 30370/31795 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 23:25:46,016 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 Writing output log to file Ultimate.log Result: TRUE