./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 03:07:17,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:07:17,415 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:07:17,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:07:17,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:07:17,444 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:07:17,444 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:07:17,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:07:17,445 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:07:17,446 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:07:17,446 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:07:17,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:07:17,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:07:17,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:07:17,448 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:07:17,448 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:07:17,449 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:07:17,449 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:07:17,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:07:17,450 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:07:17,450 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:07:17,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:07:17,453 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:07:17,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:07:17,453 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:07:17,454 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:07:17,454 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:07:17,454 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:07:17,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:07:17,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:07:17,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:07:17,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:07:17,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:07:17,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:07:17,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:07:17,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:07:17,457 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:07:17,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:07:17,458 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:07:17,458 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:07:17,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:07:17,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:07:17,459 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-clean/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-clean/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-10-11 03:07:17,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:07:17,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:07:17,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:07:17,741 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:07:17,742 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:07:17,743 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2024-10-11 03:07:19,242 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:07:19,423 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:07:19,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2024-10-11 03:07:19,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4e396ec73/bf728f85f412455db90c282b76b179b7/FLAG3e28d340a [2024-10-11 03:07:19,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4e396ec73/bf728f85f412455db90c282b76b179b7 [2024-10-11 03:07:19,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:07:19,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:07:19,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:07:19,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:07:19,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:07:19,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:07:19" (1/1) ... [2024-10-11 03:07:19,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d0e4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:19, skipping insertion in model container [2024-10-11 03:07:19,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:07:19" (1/1) ... [2024-10-11 03:07:19,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:07:20,015 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2024-10-11 03:07:20,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:07:20,031 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:07:20,045 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2024-10-11 03:07:20,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:07:20,064 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:07:20,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:20 WrapperNode [2024-10-11 03:07:20,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:07:20,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:07:20,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:07:20,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:07:20,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:20" (1/1) ... [2024-10-11 03:07:20,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:20" (1/1) ... [2024-10-11 03:07:20,097 INFO L138 Inliner]: procedures = 13, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2024-10-11 03:07:20,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:07:20,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:07:20,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:07:20,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:07:20,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:20" (1/1) ... [2024-10-11 03:07:20,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:20" (1/1) ... [2024-10-11 03:07:20,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:20" (1/1) ... [2024-10-11 03:07:20,119 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-10-11 03:07:20,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:20" (1/1) ... [2024-10-11 03:07:20,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:20" (1/1) ... [2024-10-11 03:07:20,124 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:20" (1/1) ... [2024-10-11 03:07:20,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:20" (1/1) ... [2024-10-11 03:07:20,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:20" (1/1) ... [2024-10-11 03:07:20,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:20" (1/1) ... [2024-10-11 03:07:20,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:07:20,130 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:07:20,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:07:20,130 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:07:20,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:20" (1/1) ... [2024-10-11 03:07:20,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:07:20,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:07:20,166 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:07:20,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:07:20,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:07:20,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:07:20,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 03:07:20,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 03:07:20,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 03:07:20,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 03:07:20,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 03:07:20,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 03:07:20,219 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_21_0 [2024-10-11 03:07:20,219 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_21_0 [2024-10-11 03:07:20,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:07:20,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:07:20,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 03:07:20,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 03:07:20,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 03:07:20,220 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_21_0 [2024-10-11 03:07:20,220 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_21_0 [2024-10-11 03:07:20,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 03:07:20,324 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:07:20,326 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:07:20,453 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-10-11 03:07:20,453 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:07:20,476 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:07:20,477 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:07:20,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:07:20 BoogieIcfgContainer [2024-10-11 03:07:20,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:07:20,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:07:20,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:07:20,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:07:20,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:07:19" (1/3) ... [2024-10-11 03:07:20,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a61ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:07:20, skipping insertion in model container [2024-10-11 03:07:20,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:20" (2/3) ... [2024-10-11 03:07:20,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a61ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:07:20, skipping insertion in model container [2024-10-11 03:07:20,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:07:20" (3/3) ... [2024-10-11 03:07:20,490 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_2.c [2024-10-11 03:07:20,506 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:07:20,507 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:07:20,577 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:07:20,584 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;@ad53794, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:07:20,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:07:20,590 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 16 states have internal predecessors, (18), 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-10-11 03:07:20,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 03:07:20,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:07:20,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:07:20,602 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:07:20,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:07:20,608 INFO L85 PathProgramCache]: Analyzing trace with hash 855928239, now seen corresponding path program 1 times [2024-10-11 03:07:20,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:07:20,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445802293] [2024-10-11 03:07:20,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:07:20,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:07:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:21,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:07:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:07:21,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:07:21,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445802293] [2024-10-11 03:07:21,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445802293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:07:21,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:07:21,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:07:21,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585475324] [2024-10-11 03:07:21,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:07:21,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:07:21,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:07:21,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:07:21,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:07:21,277 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 16 states have internal predecessors, (18), 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.6) internal successors, (8), 4 states have internal predecessors, (8), 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-10-11 03:07:21,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:07:21,427 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-10-11 03:07:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:07:21,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2024-10-11 03:07:21,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:07:21,438 INFO L225 Difference]: With dead ends: 32 [2024-10-11 03:07:21,438 INFO L226 Difference]: Without dead ends: 23 [2024-10-11 03:07:21,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-10-11 03:07:21,446 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:07:21,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:07:21,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-11 03:07:21,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-10-11 03:07:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 15 states have internal predecessors, (16), 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-10-11 03:07:21,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-10-11 03:07:21,478 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 10 [2024-10-11 03:07:21,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:07:21,478 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-10-11 03:07:21,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-10-11 03:07:21,479 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-10-11 03:07:21,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 03:07:21,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:07:21,481 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:07:21,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:07:21,481 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:07:21,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:07:21,482 INFO L85 PathProgramCache]: Analyzing trace with hash 255373073, now seen corresponding path program 1 times [2024-10-11 03:07:21,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:07:21,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812800331] [2024-10-11 03:07:21,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:07:21,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:07:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:21,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:07:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:21,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:21,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 03:07:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:21,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:07:21,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:07:21,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812800331] [2024-10-11 03:07:21,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812800331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:07:21,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:07:21,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:07:21,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776292982] [2024-10-11 03:07:21,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:07:21,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:07:21,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:07:21,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:07:21,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:07:21,797 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-10-11 03:07:21,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:07:21,889 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-10-11 03:07:21,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:07:21,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 21 [2024-10-11 03:07:21,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:07:21,891 INFO L225 Difference]: With dead ends: 42 [2024-10-11 03:07:21,891 INFO L226 Difference]: Without dead ends: 23 [2024-10-11 03:07:21,892 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-10-11 03:07:21,895 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:07:21,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 58 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:07:21,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-11 03:07:21,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-11 03:07:21,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 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), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 03:07:21,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-10-11 03:07:21,904 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 21 [2024-10-11 03:07:21,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:07:21,904 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-10-11 03:07:21,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-10-11 03:07:21,906 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-10-11 03:07:21,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 03:07:21,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:07:21,907 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] [2024-10-11 03:07:21,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:07:21,907 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:07:21,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:07:21,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1037516303, now seen corresponding path program 1 times [2024-10-11 03:07:21,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:07:21,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672781937] [2024-10-11 03:07:21,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:07:21,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:07:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:22,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:07:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:22,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:22,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:22,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:07:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:22,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 03:07:22,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:07:22,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672781937] [2024-10-11 03:07:22,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672781937] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:07:22,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98314544] [2024-10-11 03:07:22,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:07:22,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:07:22,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:07:22,501 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:07:22,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:07:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:22,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 03:07:22,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:07:22,655 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-10-11 03:07:22,943 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 03:07:22,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:07:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:07:23,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98314544] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:07:23,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:07:23,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 25 [2024-10-11 03:07:23,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452146343] [2024-10-11 03:07:23,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:07:23,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 03:07:23,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:07:23,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 03:07:23,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:07:23,416 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 25 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 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-10-11 03:07:23,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:07:23,760 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2024-10-11 03:07:23,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:07:23,761 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 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 26 [2024-10-11 03:07:23,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:07:23,762 INFO L225 Difference]: With dead ends: 48 [2024-10-11 03:07:23,762 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 03:07:23,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 43 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-10-11 03:07:23,764 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 38 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:07:23,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 80 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:07:23,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 03:07:23,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-11 03:07:23,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 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-10-11 03:07:23,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-10-11 03:07:23,772 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 26 [2024-10-11 03:07:23,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:07:23,773 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-11 03:07:23,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 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-10-11 03:07:23,773 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-10-11 03:07:23,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:07:23,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:07:23,775 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] [2024-10-11 03:07:23,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:07:23,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:07:23,980 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:07:23,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:07:23,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1013053495, now seen corresponding path program 2 times [2024-10-11 03:07:23,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:07:23,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695468020] [2024-10-11 03:07:23,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:07:23,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:07:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:24,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:07:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:24,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:24,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:24,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:24,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:07:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:24,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:24,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:24,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:24,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:07:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:24,914 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 38 proven. 8 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-11 03:07:24,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:07:24,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695468020] [2024-10-11 03:07:24,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695468020] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:07:24,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459998402] [2024-10-11 03:07:24,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 03:07:24,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:07:24,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:07:24,919 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:07:24,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:07:25,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 03:07:25,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:07:25,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-11 03:07:25,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:07:25,047 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-10-11 03:07:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 03:07:25,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:07:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 03:07:26,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459998402] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:07:26,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:07:26,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 14] total 25 [2024-10-11 03:07:26,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417214980] [2024-10-11 03:07:26,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:07:26,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 03:07:26,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:07:26,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 03:07:26,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:07:26,493 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 25 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 8 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (15), 6 states have call predecessors, (15), 8 states have call successors, (15) [2024-10-11 03:07:26,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:07:26,681 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2024-10-11 03:07:26,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:07:26,682 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 8 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (15), 6 states have call predecessors, (15), 8 states have call successors, (15) Word has length 52 [2024-10-11 03:07:26,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:07:26,683 INFO L225 Difference]: With dead ends: 54 [2024-10-11 03:07:26,683 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 03:07:26,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=626, Unknown=0, NotChecked=0, Total=812 [2024-10-11 03:07:26,685 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:07:26,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 119 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:07:26,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 03:07:26,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-11 03:07:26,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 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), 7 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-11 03:07:26,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-10-11 03:07:26,696 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 52 [2024-10-11 03:07:26,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:07:26,697 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-10-11 03:07:26,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 8 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (15), 6 states have call predecessors, (15), 8 states have call successors, (15) [2024-10-11 03:07:26,701 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-10-11 03:07:26,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 03:07:26,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:07:26,702 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:07:26,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 03:07:26,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:07:26,903 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:07:26,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:07:26,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1464884653, now seen corresponding path program 3 times [2024-10-11 03:07:26,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:07:26,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000301863] [2024-10-11 03:07:26,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:07:26,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:07:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:27,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:07:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:27,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:27,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:27,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:27,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:27,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:07:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:27,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:27,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:27,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:27,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:27,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:27,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:07:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 8 proven. 75 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-11 03:07:27,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:07:27,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000301863] [2024-10-11 03:07:27,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000301863] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:07:27,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447497313] [2024-10-11 03:07:27,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 03:07:27,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:07:27,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:07:27,900 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:07:27,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:07:27,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 03:07:28,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:07:28,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-11 03:07:28,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:07:28,017 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-10-11 03:07:28,299 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-10-11 03:07:28,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:07:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-10-11 03:07:29,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447497313] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:07:29,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:07:29,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 14] total 34 [2024-10-11 03:07:29,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420591824] [2024-10-11 03:07:29,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:07:29,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-11 03:07:29,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:07:29,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-11 03:07:29,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 03:07:29,090 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 34 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 28 states have internal predecessors, (49), 13 states have call successors, (17), 7 states have call predecessors, (17), 12 states have return successors, (18), 12 states have call predecessors, (18), 13 states have call successors, (18) [2024-10-11 03:07:29,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:07:29,406 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2024-10-11 03:07:29,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 03:07:29,407 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 28 states have internal predecessors, (49), 13 states have call successors, (17), 7 states have call predecessors, (17), 12 states have return successors, (18), 12 states have call predecessors, (18), 13 states have call successors, (18) Word has length 62 [2024-10-11 03:07:29,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:07:29,408 INFO L225 Difference]: With dead ends: 60 [2024-10-11 03:07:29,408 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 03:07:29,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=290, Invalid=1602, Unknown=0, NotChecked=0, Total=1892 [2024-10-11 03:07:29,410 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 35 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:07:29,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 111 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:07:29,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 03:07:29,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-11 03:07:29,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 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), 9 states have return successors, (11), 9 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-11 03:07:29,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-10-11 03:07:29,418 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 62 [2024-10-11 03:07:29,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:07:29,418 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-10-11 03:07:29,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 28 states have internal predecessors, (49), 13 states have call successors, (17), 7 states have call predecessors, (17), 12 states have return successors, (18), 12 states have call predecessors, (18), 13 states have call successors, (18) [2024-10-11 03:07:29,419 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-10-11 03:07:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 03:07:29,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:07:29,421 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:07:29,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 03:07:29,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:07:29,626 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:07:29,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:07:29,626 INFO L85 PathProgramCache]: Analyzing trace with hash -365015879, now seen corresponding path program 4 times [2024-10-11 03:07:29,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:07:29,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384354173] [2024-10-11 03:07:29,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:07:29,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:07:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:30,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:07:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:30,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:30,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:30,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:30,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:30,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:31,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 03:07:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:31,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:31,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:31,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:31,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:31,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:31,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 03:07:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:31,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:31,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:31,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:31,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:31,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:31,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 03:07:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:31,080 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 6 proven. 212 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-10-11 03:07:31,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:07:31,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384354173] [2024-10-11 03:07:31,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384354173] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:07:31,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966482171] [2024-10-11 03:07:31,080 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 03:07:31,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:07:31,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:07:31,082 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:07:31,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:07:31,252 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 03:07:31,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:07:31,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-10-11 03:07:31,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:07:31,270 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-10-11 03:07:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 363 proven. 24 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-10-11 03:07:31,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:07:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 127 proven. 165 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-10-11 03:07:33,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966482171] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:07:33,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:07:33,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 22] total 35 [2024-10-11 03:07:33,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615322162] [2024-10-11 03:07:33,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:07:33,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 03:07:33,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:07:33,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 03:07:33,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=947, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 03:07:33,733 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 35 states, 27 states have (on average 2.0) internal successors, (54), 28 states have internal predecessors, (54), 10 states have call successors, (21), 9 states have call predecessors, (21), 12 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) [2024-10-11 03:07:33,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:07:33,901 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2024-10-11 03:07:33,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:07:33,901 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 27 states have (on average 2.0) internal successors, (54), 28 states have internal predecessors, (54), 10 states have call successors, (21), 9 states have call predecessors, (21), 12 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) Word has length 103 [2024-10-11 03:07:33,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:07:33,902 INFO L225 Difference]: With dead ends: 66 [2024-10-11 03:07:33,903 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 03:07:33,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 217 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=331, Invalid=1151, Unknown=0, NotChecked=0, Total=1482 [2024-10-11 03:07:33,904 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:07:33,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 143 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:07:33,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 03:07:33,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-11 03:07:33,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 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-10-11 03:07:33,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-10-11 03:07:33,914 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 103 [2024-10-11 03:07:33,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:07:33,915 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-10-11 03:07:33,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 27 states have (on average 2.0) internal successors, (54), 28 states have internal predecessors, (54), 10 states have call successors, (21), 9 states have call predecessors, (21), 12 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) [2024-10-11 03:07:33,916 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-10-11 03:07:33,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 03:07:33,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:07:33,917 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] [2024-10-11 03:07:33,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 03:07:34,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-11 03:07:34,118 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:07:34,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:07:34,119 INFO L85 PathProgramCache]: Analyzing trace with hash 620375637, now seen corresponding path program 5 times [2024-10-11 03:07:34,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:07:34,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129275331] [2024-10-11 03:07:34,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:07:34,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:07:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:34,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:07:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:35,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:35,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:35,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:35,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:35,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:35,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:35,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 03:07:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:35,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:35,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:35,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:35,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:35,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:35,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:35,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 03:07:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:36,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:36,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:36,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:36,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:36,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:36,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:36,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 03:07:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:36,031 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 6 proven. 307 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2024-10-11 03:07:36,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:07:36,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129275331] [2024-10-11 03:07:36,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129275331] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:07:36,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610322792] [2024-10-11 03:07:36,032 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 03:07:36,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:07:36,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:07:36,035 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:07:36,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 03:07:36,288 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-10-11 03:07:36,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:07:36,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-10-11 03:07:36,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:07:36,309 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-10-11 03:07:36,643 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 346 proven. 35 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2024-10-11 03:07:36,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:07:39,237 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 6 proven. 414 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-10-11 03:07:39,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610322792] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:07:39,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:07:39,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 26] total 39 [2024-10-11 03:07:39,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860236862] [2024-10-11 03:07:39,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:07:39,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-11 03:07:39,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:07:39,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-11 03:07:39,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1170, Unknown=0, NotChecked=0, Total=1482 [2024-10-11 03:07:39,240 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 39 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 10 states have call successors, (22), 10 states have call predecessors, (22), 14 states have return successors, (25), 12 states have call predecessors, (25), 10 states have call successors, (25) [2024-10-11 03:07:39,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:07:39,468 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2024-10-11 03:07:39,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:07:39,470 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 10 states have call successors, (22), 10 states have call predecessors, (22), 14 states have return successors, (25), 12 states have call predecessors, (25), 10 states have call successors, (25) Word has length 118 [2024-10-11 03:07:39,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:07:39,471 INFO L225 Difference]: With dead ends: 70 [2024-10-11 03:07:39,471 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 03:07:39,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 249 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=413, Invalid=1393, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 03:07:39,472 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:07:39,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 211 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:07:39,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 03:07:39,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-11 03:07:39,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 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), 11 states have return successors, (13), 11 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-11 03:07:39,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-10-11 03:07:39,487 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 118 [2024-10-11 03:07:39,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:07:39,488 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-10-11 03:07:39,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 10 states have call successors, (22), 10 states have call predecessors, (22), 14 states have return successors, (25), 12 states have call predecessors, (25), 10 states have call successors, (25) [2024-10-11 03:07:39,489 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-10-11 03:07:39,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 03:07:39,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:07:39,492 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] [2024-10-11 03:07:39,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 03:07:39,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:07:39,693 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:07:39,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:07:39,694 INFO L85 PathProgramCache]: Analyzing trace with hash -149039543, now seen corresponding path program 6 times [2024-10-11 03:07:39,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:07:39,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209657191] [2024-10-11 03:07:39,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:07:39,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:07:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:40,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:07:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:40,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:40,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:40,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:40,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:40,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:40,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:40,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:40,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:07:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:41,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:41,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:41,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:41,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:41,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:41,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:41,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:41,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:07:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:41,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:41,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:41,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:41,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:41,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:41,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:41,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:41,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:07:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:41,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1009 trivial. 0 not checked. [2024-10-11 03:07:41,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:07:41,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209657191] [2024-10-11 03:07:41,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209657191] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:07:41,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8220669] [2024-10-11 03:07:41,268 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 03:07:41,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:07:41,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:07:41,270 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:07:41,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 03:07:41,505 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-10-11 03:07:41,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:07:41,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-11 03:07:41,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:07:41,518 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-10-11 03:07:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1011 trivial. 0 not checked. [2024-10-11 03:07:41,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:07:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2024-10-11 03:07:42,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8220669] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:07:42,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:07:42,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 18] total 37 [2024-10-11 03:07:42,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232446496] [2024-10-11 03:07:42,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:07:42,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-11 03:07:42,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:07:42,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-11 03:07:42,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1062, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 03:07:42,969 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 37 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 30 states have internal predecessors, (47), 13 states have call successors, (16), 8 states have call predecessors, (16), 13 states have return successors, (17), 16 states have call predecessors, (17), 13 states have call successors, (17) [2024-10-11 03:07:43,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:07:43,140 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2024-10-11 03:07:43,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:07:43,140 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 30 states have internal predecessors, (47), 13 states have call successors, (16), 8 states have call predecessors, (16), 13 states have return successors, (17), 16 states have call predecessors, (17), 13 states have call successors, (17) Word has length 133 [2024-10-11 03:07:43,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:07:43,142 INFO L225 Difference]: With dead ends: 45 [2024-10-11 03:07:43,142 INFO L226 Difference]: Without dead ends: 40 [2024-10-11 03:07:43,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 03:07:43,143 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:07:43,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 90 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:07:43,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-11 03:07:43,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-10-11 03:07:43,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 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), 12 states have return successors, (14), 12 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-11 03:07:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-10-11 03:07:43,150 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 133 [2024-10-11 03:07:43,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:07:43,151 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-10-11 03:07:43,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 30 states have internal predecessors, (47), 13 states have call successors, (16), 8 states have call predecessors, (16), 13 states have return successors, (17), 16 states have call predecessors, (17), 13 states have call successors, (17) [2024-10-11 03:07:43,151 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-10-11 03:07:43,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-11 03:07:43,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:07:43,155 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:07:43,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 03:07:43,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 03:07:43,356 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:07:43,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:07:43,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1739371329, now seen corresponding path program 7 times [2024-10-11 03:07:43,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:07:43,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281183342] [2024-10-11 03:07:43,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:07:43,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:07:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:44,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:07:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:45,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:45,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:45,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:45,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:45,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:45,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:45,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:45,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:07:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:45,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:45,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:45,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:45,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:45,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:45,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:45,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:45,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:07:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:45,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:45,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:45,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:46,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:46,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:46,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:46,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:46,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:07:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:46,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:46,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:46,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:46,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:46,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:46,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:46,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:46,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:07:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 1802 trivial. 0 not checked. [2024-10-11 03:07:46,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:07:46,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281183342] [2024-10-11 03:07:46,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281183342] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:07:46,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002084714] [2024-10-11 03:07:46,311 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-11 03:07:46,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:07:46,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:07:46,313 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:07:46,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 03:07:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:46,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-10-11 03:07:46,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:07:46,590 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-10-11 03:07:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1822 trivial. 0 not checked. [2024-10-11 03:07:46,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:07:48,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1788 trivial. 0 not checked. [2024-10-11 03:07:48,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002084714] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:07:48,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:07:48,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 22] total 49 [2024-10-11 03:07:48,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120999895] [2024-10-11 03:07:48,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:07:48,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-11 03:07:48,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:07:48,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-11 03:07:48,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=1919, Unknown=0, NotChecked=0, Total=2352 [2024-10-11 03:07:48,834 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 49 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 41 states have internal predecessors, (59), 19 states have call successors, (21), 9 states have call predecessors, (21), 16 states have return successors, (23), 22 states have call predecessors, (23), 19 states have call successors, (23) [2024-10-11 03:07:49,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:07:49,234 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2024-10-11 03:07:49,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:07:49,234 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 41 states have internal predecessors, (59), 19 states have call successors, (21), 9 states have call predecessors, (21), 16 states have return successors, (23), 22 states have call predecessors, (23), 19 states have call successors, (23) Word has length 174 [2024-10-11 03:07:49,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:07:49,236 INFO L225 Difference]: With dead ends: 51 [2024-10-11 03:07:49,236 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 03:07:49,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1249 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=621, Invalid=2571, Unknown=0, NotChecked=0, Total=3192 [2024-10-11 03:07:49,238 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 41 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:07:49,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 67 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:07:49,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 03:07:49,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-10-11 03:07:49,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 14 states have return successors, (17), 15 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-11 03:07:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2024-10-11 03:07:49,246 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 174 [2024-10-11 03:07:49,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:07:49,247 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2024-10-11 03:07:49,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 41 states have internal predecessors, (59), 19 states have call successors, (21), 9 states have call predecessors, (21), 16 states have return successors, (23), 22 states have call predecessors, (23), 19 states have call successors, (23) [2024-10-11 03:07:49,247 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2024-10-11 03:07:49,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 03:07:49,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:07:49,249 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] [2024-10-11 03:07:49,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 03:07:49,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:07:49,454 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:07:49,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:07:49,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1394733523, now seen corresponding path program 1 times [2024-10-11 03:07:49,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:07:49,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454754494] [2024-10-11 03:07:49,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:07:49,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:07:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:50,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:07:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:51,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:51,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:51,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:51,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:51,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:51,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:51,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:51,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:07:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:52,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:52,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:52,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:52,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:52,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:52,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:52,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:52,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:07:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:07:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:07:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:07:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 16 proven. 35 refuted. 0 times theorem prover too weak. 2854 trivial. 0 not checked. [2024-10-11 03:07:53,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:07:53,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454754494] [2024-10-11 03:07:53,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454754494] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:07:53,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999991476] [2024-10-11 03:07:53,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:07:53,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:07:53,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:07:53,773 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:07:53,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 03:07:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:54,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-10-11 03:07:54,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:07:54,119 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-10-11 03:07:54,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 2870 trivial. 0 not checked. [2024-10-11 03:07:54,552 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:07:56,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 2815 trivial. 0 not checked. [2024-10-11 03:07:56,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999991476] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:07:56,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:07:56,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 26] total 46 [2024-10-11 03:07:56,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094677010] [2024-10-11 03:07:56,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:07:56,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-11 03:07:56,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:07:56,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-11 03:07:56,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=1676, Unknown=0, NotChecked=0, Total=2070 [2024-10-11 03:07:56,900 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 46 states, 36 states have (on average 1.5) internal successors, (54), 37 states have internal predecessors, (54), 18 states have call successors, (21), 10 states have call predecessors, (21), 14 states have return successors, (26), 20 states have call predecessors, (26), 18 states have call successors, (26) [2024-10-11 03:07:57,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:07:57,250 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2024-10-11 03:07:57,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:07:57,251 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 36 states have (on average 1.5) internal successors, (54), 37 states have internal predecessors, (54), 18 states have call successors, (21), 10 states have call predecessors, (21), 14 states have return successors, (26), 20 states have call predecessors, (26), 18 states have call successors, (26) Word has length 215 [2024-10-11 03:07:57,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:07:57,252 INFO L225 Difference]: With dead ends: 48 [2024-10-11 03:07:57,252 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 03:07:57,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 478 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=577, Invalid=2179, Unknown=0, NotChecked=0, Total=2756 [2024-10-11 03:07:57,254 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:07:57,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 141 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:07:57,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 03:07:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-11 03:07:57,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 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), 14 states have return successors, (16), 14 states have call predecessors, (16), 4 states have call successors, (16) [2024-10-11 03:07:57,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-10-11 03:07:57,265 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 215 [2024-10-11 03:07:57,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:07:57,266 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-10-11 03:07:57,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 36 states have (on average 1.5) internal successors, (54), 37 states have internal predecessors, (54), 18 states have call successors, (21), 10 states have call predecessors, (21), 14 states have return successors, (26), 20 states have call predecessors, (26), 18 states have call successors, (26) [2024-10-11 03:07:57,266 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-10-11 03:07:57,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-11 03:07:57,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:07:57,270 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] [2024-10-11 03:07:57,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 03:07:57,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 03:07:57,471 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:07:57,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:07:57,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1043833273, now seen corresponding path program 8 times [2024-10-11 03:07:57,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:07:57,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176534850] [2024-10-11 03:07:57,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:07:57,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:07:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:58,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:07:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:59,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:59,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:59,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:59,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:59,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:59,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:59,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:07:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:59,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:07:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:00,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:00,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:00,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:00,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:00,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:00,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:00,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:00,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:08:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:00,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:00,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:00,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:00,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:00,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:00,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:00,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:00,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:08:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:08:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:08:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:08:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:01,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 937 proven. 34 refuted. 0 times theorem prover too weak. 3232 trivial. 0 not checked. [2024-10-11 03:08:01,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:08:01,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176534850] [2024-10-11 03:08:01,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176534850] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:08:01,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562207117] [2024-10-11 03:08:01,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 03:08:01,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:08:01,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:08:01,892 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:08:01,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 03:08:02,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 03:08:02,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:08:02,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 144 conjuncts are in the unsatisfiable core [2024-10-11 03:08:02,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:08:02,314 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-10-11 03:08:02,587 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-10-11 03:08:02,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 1171 proven. 81 refuted. 0 times theorem prover too weak. 2951 trivial. 0 not checked. [2024-10-11 03:08:02,625 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:08:03,580 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-10-11 03:08:04,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-10-11 03:08:04,400 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-10-11 03:08:04,726 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-10-11 03:08:05,015 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-10-11 03:08:05,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562207117] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:08:05,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 03:08:05,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 23 [2024-10-11 03:08:05,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940898709] [2024-10-11 03:08:05,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 03:08:05,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 03:08:05,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:08:05,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 03:08:05,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2024-10-11 03:08:05,793 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 23 states, 20 states have (on average 2.05) internal successors, (41), 22 states have internal predecessors, (41), 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-10-11 03:08:06,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:08:06,281 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2024-10-11 03:08:06,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 03:08:06,282 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.05) internal successors, (41), 22 states have internal predecessors, (41), 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 256 [2024-10-11 03:08:06,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:08:06,283 INFO L225 Difference]: With dead ends: 48 [2024-10-11 03:08:06,283 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 03:08:06,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=1375, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 03:08:06,284 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:08:06,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 191 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:08:06,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 03:08:06,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-10-11 03:08:06,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 26 states have internal predecessors, (26), 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-10-11 03:08:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2024-10-11 03:08:06,292 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 256 [2024-10-11 03:08:06,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:08:06,293 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2024-10-11 03:08:06,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.05) internal successors, (41), 22 states have internal predecessors, (41), 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-10-11 03:08:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2024-10-11 03:08:06,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-11 03:08:06,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:08:06,294 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] [2024-10-11 03:08:06,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 03:08:06,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:08:06,495 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:08:06,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:08:06,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1043831351, now seen corresponding path program 2 times [2024-10-11 03:08:06,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:08:06,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90919839] [2024-10-11 03:08:06,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:08:06,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:08:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:07,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:08:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:07,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:07,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:07,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:07,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:07,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:07,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:07,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:07,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:08:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:08:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:08:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:08:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:08:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:08:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:08:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:08:08,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 4165 trivial. 0 not checked. [2024-10-11 03:08:08,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:08:08,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90919839] [2024-10-11 03:08:08,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90919839] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:08:08,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554985871] [2024-10-11 03:08:08,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 03:08:08,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:08:08,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:08:08,968 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:08:08,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 03:08:09,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 03:08:09,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:08:09,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-10-11 03:08:09,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:08:09,539 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-10-11 03:08:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 1186 proven. 18 refuted. 0 times theorem prover too weak. 2999 trivial. 0 not checked. [2024-10-11 03:08:09,621 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:08:10,654 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-11 03:08:10,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2024-10-11 03:08:11,068 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-11 03:08:11,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2024-10-11 03:08:11,401 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-11 03:08:11,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2024-10-11 03:08:11,614 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-11 03:08:11,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2024-10-11 03:08:11,777 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-11 03:08:11,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2024-10-11 03:08:12,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554985871] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:08:12,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 03:08:12,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2024-10-11 03:08:12,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051019904] [2024-10-11 03:08:12,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 03:08:12,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 03:08:12,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:08:12,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 03:08:12,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:08:12,040 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-11 03:08:16,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 03:08:16,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:08:16,306 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2024-10-11 03:08:16,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:08:16,307 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 256 [2024-10-11 03:08:16,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:08:16,308 INFO L225 Difference]: With dead ends: 47 [2024-10-11 03:08:16,308 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 03:08:16,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 373 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2024-10-11 03:08:16,309 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 23 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:08:16,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 28 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 162 Invalid, 3 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 03:08:16,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 03:08:16,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 03:08:16,310 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-10-11 03:08:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 03:08:16,310 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 256 [2024-10-11 03:08:16,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:08:16,310 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 03:08:16,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-11 03:08:16,311 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 03:08:16,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 03:08:16,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 03:08:16,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 03:08:16,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 03:08:16,517 INFO L407 BasicCegarLoop]: Path program histogram: [8, 2, 1, 1] [2024-10-11 03:08:16,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 03:08:17,623 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 03:08:17,629 WARN L155 FloydHoareUtils]: Requires clause for func_to_recursive_line_20_to_21_0 contained old-variable. Original clause: (and (= (select (select |old(#memory_int#1)| |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#2| |old(#memory_int#2)|) (= |#memory_int#1| |old(#memory_int#1)|)) Eliminated clause: (= 6 (select (select |#memory_int#1| |func_to_recursive_line_20_to_21_0_#in~b.base|) |func_to_recursive_line_20_to_21_0_#in~b.offset|)) [2024-10-11 03:08:17,637 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-11 03:08:17,638 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-11 03:08:17,638 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-10-11 03:08:17,640 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-11 03:08:17,640 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-10-11 03:08:17,640 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-10-11 03:08:17,640 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 03:08:17,640 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-11 03:08:17,640 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-10-11 03:08:17,640 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 03:08:17,640 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 03:08:17,640 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-11 03:08:17,640 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-11 03:08:17,641 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-11 03:08:17,641 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-11 03:08:17,641 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-10-11 03:08:17,642 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 03:08:17,642 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-11 03:08:17,642 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-10-11 03:08:17,643 WARN L155 FloydHoareUtils]: Requires clause for func_to_recursive_line_21_to_21_0 contained old-variable. Original clause: (and (exists ((|v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_71| Int) (|v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_71| Int)) (<= (select (select |#memory_int#2| |v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_71|) |v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_71|) 5)) (= |#memory_int#1| |old(#memory_int#1)|)) Eliminated clause: (exists ((|v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_71| Int) (|v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_71| Int)) (<= (select (select |#memory_int#2| |v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_71|) |v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_71|) 5)) [2024-10-11 03:08:17,645 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 03:08:17,647 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 03:08:17,647 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-11 03:08:17,647 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-11 03:08:17,647 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-11 03:08:17,647 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-10-11 03:08:17,647 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-10-11 03:08:17,647 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 03:08:17,648 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-11 03:08:17,648 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-11 03:08:17,648 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-10-11 03:08:17,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:08:17 BoogieIcfgContainer [2024-10-11 03:08:17,649 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 03:08:17,649 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 03:08:17,650 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 03:08:17,650 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 03:08:17,650 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:07:20" (3/4) ... [2024-10-11 03:08:17,653 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 03:08:17,656 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_21_0 [2024-10-11 03:08:17,657 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_21_to_21_0 [2024-10-11 03:08:17,661 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-11 03:08:17,661 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 03:08:17,661 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 03:08:17,661 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 03:08:17,756 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 03:08:17,757 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 03:08:17,757 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 03:08:17,757 INFO L158 Benchmark]: Toolchain (without parser) took 57939.24ms. Allocated memory was 186.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 119.0MB in the beginning and 517.1MB in the end (delta: -398.1MB). Peak memory consumption was 756.4MB. Max. memory is 16.1GB. [2024-10-11 03:08:17,758 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 117.4MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:08:17,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.95ms. Allocated memory is still 186.6MB. Free memory was 118.8MB in the beginning and 107.0MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 03:08:17,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.15ms. Allocated memory is still 186.6MB. Free memory was 107.0MB in the beginning and 105.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:08:17,758 INFO L158 Benchmark]: Boogie Preprocessor took 31.23ms. Allocated memory is still 186.6MB. Free memory was 105.6MB in the beginning and 103.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:08:17,759 INFO L158 Benchmark]: RCFGBuilder took 348.17ms. Allocated memory is still 186.6MB. Free memory was 103.6MB in the beginning and 90.4MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 03:08:17,759 INFO L158 Benchmark]: TraceAbstraction took 57168.45ms. Allocated memory was 186.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 89.7MB in the beginning and 521.3MB in the end (delta: -431.7MB). Peak memory consumption was 722.8MB. Max. memory is 16.1GB. [2024-10-11 03:08:17,759 INFO L158 Benchmark]: Witness Printer took 107.48ms. Allocated memory is still 1.3GB. Free memory was 521.3MB in the beginning and 517.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 03:08:17,760 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.57ms. Allocated memory is still 117.4MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.95ms. Allocated memory is still 186.6MB. Free memory was 118.8MB in the beginning and 107.0MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.15ms. Allocated memory is still 186.6MB. Free memory was 107.0MB in the beginning and 105.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.23ms. Allocated memory is still 186.6MB. Free memory was 105.6MB in the beginning and 103.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 348.17ms. Allocated memory is still 186.6MB. Free memory was 103.6MB in the beginning and 90.4MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 57168.45ms. Allocated memory was 186.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 89.7MB in the beginning and 521.3MB in the end (delta: -431.7MB). Peak memory consumption was 722.8MB. Max. memory is 16.1GB. * Witness Printer took 107.48ms. Allocated memory is still 1.3GB. Free memory was 521.3MB in the beginning and 517.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,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~a!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~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~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - 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 UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - 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~b!base,]]] * 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, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.0s, OverallIterations: 12, TraceHistogramMax: 42, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 315 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 309 mSDsluCounter, 1287 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1144 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2275 IncrementalHoareTripleChecker+Invalid, 2441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 143 mSDtfsCounter, 2275 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3070 GetRequests, 2646 SyntacticMatches, 22 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5592 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=9, InterpolantAutomatonStates: 154, 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, 12 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 43.5s InterpolantComputationTime, 2821 NumberOfCodeBlocks, 2729 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3674 ConstructedInterpolants, 34 QuantifiedInterpolants, 13922 SizeOfPredicates, 132 NumberOfNonLiveVariables, 5536 ConjunctsInSsa, 687 ConjunctsInUnsatCore, 30 InterpolantComputations, 2 PerfectInterpolantSequences, 36871/38647 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-10-11 03:08:17,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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