./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/list_flag-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-properties/list_flag-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:06:08,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:06:08,203 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:06:08,210 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:06:08,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:06:08,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:06:08,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:06:08,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:06:08,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:06:08,256 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:06:08,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:06:08,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:06:08,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:06:08,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:06:08,259 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:06:08,259 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:06:08,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:06:08,260 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:06:08,260 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:06:08,261 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:06:08,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:06:08,265 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:06:08,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:06:08,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:06:08,266 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:06:08,266 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:06:08,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:06:08,266 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:06:08,267 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:06:08,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:06:08,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:06:08,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:06:08,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:06:08,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:06:08,268 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:06:08,268 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:06:08,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:06:08,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:06:08,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:06:08,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:06:08,269 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:06:08,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:06:08,271 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da [2024-11-09 22:06:08,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:06:08,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:06:08,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:06:08,545 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:06:08,546 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:06:08,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_flag-2.i [2024-11-09 22:06:09,920 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:06:10,243 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:06:10,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i [2024-11-09 22:06:10,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/430beccd3/9f6e798eebb14f039795c5c3c171e150/FLAG46e9f6301 [2024-11-09 22:06:10,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/430beccd3/9f6e798eebb14f039795c5c3c171e150 [2024-11-09 22:06:10,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:06:10,509 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:06:10,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:06:10,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:06:10,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:06:10,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:06:10" (1/1) ... [2024-11-09 22:06:10,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@459bbc2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:10, skipping insertion in model container [2024-11-09 22:06:10,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:06:10" (1/1) ... [2024-11-09 22:06:10,554 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:06:10,830 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i[23375,23388] [2024-11-09 22:06:10,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:06:10,843 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:06:10,891 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i[23375,23388] [2024-11-09 22:06:10,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:06:10,924 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:06:10,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:10 WrapperNode [2024-11-09 22:06:10,925 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:06:10,926 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:06:10,926 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:06:10,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:06:10,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:10" (1/1) ... [2024-11-09 22:06:10,942 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:10" (1/1) ... [2024-11-09 22:06:10,958 INFO L138 Inliner]: procedures = 124, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 66 [2024-11-09 22:06:10,959 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:06:10,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:06:10,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:06:10,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:06:10,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:10" (1/1) ... [2024-11-09 22:06:10,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:10" (1/1) ... [2024-11-09 22:06:10,974 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:10" (1/1) ... [2024-11-09 22:06:10,988 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-11-09 22:06:10,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:10" (1/1) ... [2024-11-09 22:06:10,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:10" (1/1) ... [2024-11-09 22:06:10,994 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:10" (1/1) ... [2024-11-09 22:06:10,994 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:10" (1/1) ... [2024-11-09 22:06:10,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:10" (1/1) ... [2024-11-09 22:06:10,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:10" (1/1) ... [2024-11-09 22:06:10,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:06:11,004 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:06:11,004 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:06:11,004 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:06:11,005 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:10" (1/1) ... [2024-11-09 22:06:11,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:06:11,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:06:11,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 22:06:11,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 22:06:11,082 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-09 22:06:11,082 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-09 22:06:11,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 22:06:11,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 22:06:11,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 22:06:11,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 22:06:11,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 22:06:11,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:06:11,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 22:06:11,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 22:06:11,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 22:06:11,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 22:06:11,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:06:11,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 22:06:11,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:06:11,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:06:11,189 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:06:11,191 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:06:11,216 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-09 22:06:11,318 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-09 22:06:11,318 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:06:11,332 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:06:11,332 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:06:11,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:06:11 BoogieIcfgContainer [2024-11-09 22:06:11,332 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:06:11,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:06:11,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:06:11,339 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:06:11,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:06:10" (1/3) ... [2024-11-09 22:06:11,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776c87e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:06:11, skipping insertion in model container [2024-11-09 22:06:11,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:10" (2/3) ... [2024-11-09 22:06:11,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776c87e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:06:11, skipping insertion in model container [2024-11-09 22:06:11,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:06:11" (3/3) ... [2024-11-09 22:06:11,343 INFO L112 eAbstractionObserver]: Analyzing ICFG list_flag-2.i [2024-11-09 22:06:11,358 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:06:11,359 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:06:11,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:06:11,417 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;@2f2bc707, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:06:11,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:06:11,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 25 states have (on average 1.48) internal successors, (37), 27 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:11,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 22:06:11,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:06:11,427 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:06:11,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:06:11,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:06:11,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1436629864, now seen corresponding path program 1 times [2024-11-09 22:06:11,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:06:11,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572121024] [2024-11-09 22:06:11,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:06:11,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:06:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:06:11,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:11,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:06:11,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572121024] [2024-11-09 22:06:11,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572121024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:06:11,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:06:11,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 22:06:11,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959485973] [2024-11-09 22:06:11,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:06:11,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 22:06:11,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:06:11,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 22:06:11,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:06:11,631 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.48) internal successors, (37), 27 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:11,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:06:11,643 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2024-11-09 22:06:11,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 22:06:11,645 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) Word has length 12 [2024-11-09 22:06:11,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:06:11,649 INFO L225 Difference]: With dead ends: 43 [2024-11-09 22:06:11,649 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 22:06:11,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:06:11,654 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:06:11,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:06:11,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 22:06:11,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-09 22:06:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:11,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-11-09 22:06:11,681 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 12 [2024-11-09 22:06:11,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:06:11,681 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-11-09 22:06:11,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:11,682 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-11-09 22:06:11,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 22:06:11,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:06:11,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:06:11,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:06:11,683 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:06:11,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:06:11,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1793720211, now seen corresponding path program 1 times [2024-11-09 22:06:11,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:06:11,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300702182] [2024-11-09 22:06:11,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:06:11,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:06:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:06:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:12,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:06:12,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300702182] [2024-11-09 22:06:12,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300702182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:06:12,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:06:12,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:06:12,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100059432] [2024-11-09 22:06:12,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:06:12,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:06:12,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:06:12,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:06:12,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:06:12,037 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:12,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:06:12,104 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-11-09 22:06:12,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:06:12,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) Word has length 14 [2024-11-09 22:06:12,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:06:12,106 INFO L225 Difference]: With dead ends: 38 [2024-11-09 22:06:12,106 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 22:06:12,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:06:12,108 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:06:12,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 57 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:06:12,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 22:06:12,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2024-11-09 22:06:12,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-09 22:06:12,114 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 14 [2024-11-09 22:06:12,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:06:12,115 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-09 22:06:12,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-09 22:06:12,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 22:06:12,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:06:12,116 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:06:12,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:06:12,117 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:06:12,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:06:12,118 INFO L85 PathProgramCache]: Analyzing trace with hash -889791470, now seen corresponding path program 1 times [2024-11-09 22:06:12,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:06:12,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571897772] [2024-11-09 22:06:12,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:06:12,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:06:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:06:12,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:12,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:06:12,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571897772] [2024-11-09 22:06:12,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571897772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:06:12,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:06:12,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:06:12,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085146972] [2024-11-09 22:06:12,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:06:12,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:06:12,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:06:12,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:06:12,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:06:12,286 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:12,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:06:12,348 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-11-09 22:06:12,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:06:12,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) Word has length 16 [2024-11-09 22:06:12,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:06:12,350 INFO L225 Difference]: With dead ends: 40 [2024-11-09 22:06:12,350 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 22:06:12,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:06:12,353 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:06:12,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 60 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:06:12,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 22:06:12,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-09 22:06:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-09 22:06:12,360 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 16 [2024-11-09 22:06:12,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:06:12,361 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-09 22:06:12,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:12,361 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-09 22:06:12,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 22:06:12,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:06:12,362 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:06:12,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 22:06:12,362 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:06:12,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:06:12,363 INFO L85 PathProgramCache]: Analyzing trace with hash 377052307, now seen corresponding path program 1 times [2024-11-09 22:06:12,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:06:12,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122650480] [2024-11-09 22:06:12,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:06:12,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:06:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:06:12,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:12,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:06:12,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122650480] [2024-11-09 22:06:12,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122650480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:06:12,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:06:12,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:06:12,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18674586] [2024-11-09 22:06:12,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:06:12,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:06:12,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:06:12,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:06:12,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:06:12,500 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:12,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:06:12,562 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-11-09 22:06:12,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:06:12,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) Word has length 16 [2024-11-09 22:06:12,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:06:12,564 INFO L225 Difference]: With dead ends: 38 [2024-11-09 22:06:12,564 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 22:06:12,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:06:12,565 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:06:12,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 64 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:06:12,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 22:06:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-11-09 22:06:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-09 22:06:12,571 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2024-11-09 22:06:12,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:06:12,571 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-09 22:06:12,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:12,571 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-09 22:06:12,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 22:06:12,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:06:12,572 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:06:12,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 22:06:12,574 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:06:12,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:06:12,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1958559474, now seen corresponding path program 1 times [2024-11-09 22:06:12,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:06:12,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658080595] [2024-11-09 22:06:12,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:06:12,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:06:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:06:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:12,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:06:12,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658080595] [2024-11-09 22:06:12,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658080595] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:06:12,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137129996] [2024-11-09 22:06:12,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:06:12,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:06:12,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:06:12,938 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:06:12,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 22:06:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:06:13,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 22:06:13,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:06:13,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:06:13,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:06:13,163 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 22:06:13,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 22:06:13,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 22:06:13,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 22:06:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:13,269 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:06:13,296 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_81 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_81) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2024-11-09 22:06:13,344 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_79 (Array Int Int)) (v_ArrVal_81 (Array Int Int))) (or (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_79 .cse0))) v_ArrVal_79)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_79) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_81) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2024-11-09 22:06:13,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:13,423 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 70 treesize of output 74 [2024-11-09 22:06:13,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2024-11-09 22:06:13,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 22:06:13,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 98 [2024-11-09 22:06:13,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 22:06:13,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137129996] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:06:13,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:06:13,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-11-09 22:06:13,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97611589] [2024-11-09 22:06:13,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:06:13,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 22:06:13,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:06:13,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 22:06:13,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=99, Unknown=4, NotChecked=42, Total=182 [2024-11-09 22:06:13,638 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:13,868 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_9| Int)) (or (forall ((v_ArrVal_79 (Array Int Int)) (v_ArrVal_81 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_79) |v_ULTIMATE.start_main_~t~0#1.base_9| v_ArrVal_81) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (store .cse0 .cse1 (select v_ArrVal_79 .cse1)) v_ArrVal_79)))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_9|))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_79 (Array Int Int)) (v_ArrVal_81 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_79 .cse1)) v_ArrVal_79)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_79) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_81) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) is different from false [2024-11-09 22:06:14,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:06:14,631 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2024-11-09 22:06:14,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 22:06:14,632 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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) Word has length 20 [2024-11-09 22:06:14,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:06:14,634 INFO L225 Difference]: With dead ends: 71 [2024-11-09 22:06:14,634 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 22:06:14,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=104, Invalid=278, Unknown=10, NotChecked=114, Total=506 [2024-11-09 22:06:14,636 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 47 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 21 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:06:14,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 129 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 133 Invalid, 7 Unknown, 186 Unchecked, 0.2s Time] [2024-11-09 22:06:14,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 22:06:14,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 39. [2024-11-09 22:06:14,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2024-11-09 22:06:14,646 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 20 [2024-11-09 22:06:14,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:06:14,646 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-11-09 22:06:14,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:14,647 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2024-11-09 22:06:14,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 22:06:14,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:06:14,647 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:06:14,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 22:06:14,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:06:14,848 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:06:14,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:06:14,849 INFO L85 PathProgramCache]: Analyzing trace with hash -893739761, now seen corresponding path program 1 times [2024-11-09 22:06:14,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:06:14,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749300946] [2024-11-09 22:06:14,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:06:14,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:06:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:06:14,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:14,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:06:14,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749300946] [2024-11-09 22:06:14,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749300946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:06:14,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:06:14,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:06:14,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944788604] [2024-11-09 22:06:14,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:06:14,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:06:14,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:06:14,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:06:14,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:06:14,880 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:14,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:06:14,890 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2024-11-09 22:06:14,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:06:14,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) Word has length 20 [2024-11-09 22:06:14,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:06:14,892 INFO L225 Difference]: With dead ends: 73 [2024-11-09 22:06:14,892 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 22:06:14,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:06:14,897 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:06:14,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 46 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:06:14,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 22:06:14,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-09 22:06:14,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:14,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-11-09 22:06:14,908 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 20 [2024-11-09 22:06:14,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:06:14,908 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-11-09 22:06:14,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:14,908 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-11-09 22:06:14,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 22:06:14,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:06:14,909 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:06:14,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 22:06:14,909 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:06:14,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:06:14,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1830849197, now seen corresponding path program 1 times [2024-11-09 22:06:14,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:06:14,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934786899] [2024-11-09 22:06:14,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:06:14,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:06:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:06:14,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:14,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:06:14,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934786899] [2024-11-09 22:06:14,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934786899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:06:14,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:06:14,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:06:14,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178413632] [2024-11-09 22:06:14,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:06:14,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:06:14,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:06:14,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:06:14,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:06:14,951 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:14,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:06:14,961 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2024-11-09 22:06:14,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:06:14,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) Word has length 20 [2024-11-09 22:06:14,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:06:14,963 INFO L225 Difference]: With dead ends: 62 [2024-11-09 22:06:14,963 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 22:06:14,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:06:14,966 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:06:14,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:06:14,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 22:06:14,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-09 22:06:14,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2024-11-09 22:06:14,974 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 20 [2024-11-09 22:06:14,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:06:14,974 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2024-11-09 22:06:14,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:14,976 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2024-11-09 22:06:14,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 22:06:14,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:06:14,976 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:06:14,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 22:06:14,977 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:06:14,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:06:14,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1399298386, now seen corresponding path program 1 times [2024-11-09 22:06:14,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:06:14,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339275663] [2024-11-09 22:06:14,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:06:14,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:06:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:06:15,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:15,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:06:15,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339275663] [2024-11-09 22:06:15,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339275663] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:06:15,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294163779] [2024-11-09 22:06:15,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:06:15,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:06:15,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:06:15,277 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:06:15,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 22:06:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:06:15,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 22:06:15,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:06:15,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:06:15,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:06:15,421 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 22:06:15,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 22:06:15,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 22:06:15,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 22:06:15,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:15,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:06:15,542 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_172 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (or (not (= v_ArrVal_172 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_172 .cse0))))) (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2024-11-09 22:06:15,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:15,604 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 132 treesize of output 134 [2024-11-09 22:06:15,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-09 22:06:15,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 22:06:15,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2024-11-09 22:06:15,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:15,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294163779] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:06:15,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:06:15,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2024-11-09 22:06:15,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541276997] [2024-11-09 22:06:15,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:06:15,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 22:06:15,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:06:15,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 22:06:15,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=4, NotChecked=24, Total=210 [2024-11-09 22:06:15,732 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:15,964 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_12| Int)) (or (forall ((v_ArrVal_172 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (or (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_172) |v_ULTIMATE.start_main_~t~0#1.base_12| v_ArrVal_174) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= v_ArrVal_172 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_172 .cse0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_12|) 0)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (forall ((v_ArrVal_174 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))) is different from false [2024-11-09 22:06:16,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:06:16,004 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2024-11-09 22:06:16,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 22:06:16,004 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 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) Word has length 20 [2024-11-09 22:06:16,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:06:16,005 INFO L225 Difference]: With dead ends: 72 [2024-11-09 22:06:16,005 INFO L226 Difference]: Without dead ends: 67 [2024-11-09 22:06:16,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=258, Unknown=5, NotChecked=70, Total=420 [2024-11-09 22:06:16,006 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 13 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:06:16,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 160 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 167 Invalid, 3 Unknown, 58 Unchecked, 0.1s Time] [2024-11-09 22:06:16,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-09 22:06:16,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2024-11-09 22:06:16,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:16,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2024-11-09 22:06:16,012 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 20 [2024-11-09 22:06:16,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:06:16,012 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2024-11-09 22:06:16,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:16,012 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2024-11-09 22:06:16,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 22:06:16,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:06:16,013 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:06:16,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 22:06:16,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-09 22:06:16,217 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:06:16,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:06:16,217 INFO L85 PathProgramCache]: Analyzing trace with hash 941959885, now seen corresponding path program 1 times [2024-11-09 22:06:16,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:06:16,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594492389] [2024-11-09 22:06:16,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:06:16,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:06:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:06:16,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:16,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:06:16,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594492389] [2024-11-09 22:06:16,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594492389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:06:16,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415544492] [2024-11-09 22:06:16,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:06:16,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:06:16,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:06:16,554 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:06:16,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 22:06:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:06:16,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 22:06:16,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:06:16,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:06:16,706 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 22:06:16,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 22:06:16,737 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 19 treesize of output 1 [2024-11-09 22:06:16,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 22:06:16,794 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 22:06:16,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2024-11-09 22:06:16,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2024-11-09 22:06:16,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2024-11-09 22:06:16,844 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 39 treesize of output 21 [2024-11-09 22:06:16,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 22:06:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:16,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:06:16,892 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 79 treesize of output 57 [2024-11-09 22:06:16,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:16,957 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-09 22:06:16,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:16,965 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 36 treesize of output 35 [2024-11-09 22:06:16,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 22:06:16,981 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 22:06:16,982 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-11-09 22:06:17,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:17,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415544492] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:06:17,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:06:17,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-09 22:06:17,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644906142] [2024-11-09 22:06:17,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:06:17,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 22:06:17,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:06:17,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 22:06:17,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=249, Unknown=6, NotChecked=0, Total=306 [2024-11-09 22:06:17,087 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:17,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:06:17,305 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2024-11-09 22:06:17,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 22:06:17,306 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 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) Word has length 22 [2024-11-09 22:06:17,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:06:17,307 INFO L225 Difference]: With dead ends: 79 [2024-11-09 22:06:17,307 INFO L226 Difference]: Without dead ends: 74 [2024-11-09 22:06:17,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=340, Unknown=6, NotChecked=0, Total=420 [2024-11-09 22:06:17,308 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 41 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:06:17,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 151 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 22:06:17,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-09 22:06:17,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2024-11-09 22:06:17,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 69 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:17,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2024-11-09 22:06:17,318 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 22 [2024-11-09 22:06:17,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:06:17,318 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-11-09 22:06:17,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:17,319 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2024-11-09 22:06:17,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 22:06:17,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:06:17,321 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:06:17,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 22:06:17,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:06:17,522 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:06:17,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:06:17,522 INFO L85 PathProgramCache]: Analyzing trace with hash 907288780, now seen corresponding path program 2 times [2024-11-09 22:06:17,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:06:17,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482822238] [2024-11-09 22:06:17,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:06:17,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:06:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:06:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:17,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:06:17,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482822238] [2024-11-09 22:06:17,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482822238] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:06:17,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162532672] [2024-11-09 22:06:17,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:06:17,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:06:17,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:06:17,852 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:06:17,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 22:06:17,945 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:06:17,945 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:06:17,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 22:06:17,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:06:17,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:06:18,002 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 22:06:18,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 22:06:18,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 22:06:18,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 22:06:18,072 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 22:06:18,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2024-11-09 22:06:18,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-09 22:06:18,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2024-11-09 22:06:18,133 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 31 treesize of output 19 [2024-11-09 22:06:18,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 22:06:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:18,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:06:18,189 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 52 treesize of output 30 [2024-11-09 22:06:18,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:18,241 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-09 22:06:18,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:18,248 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 36 treesize of output 35 [2024-11-09 22:06:18,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 22:06:18,263 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 22:06:18,263 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-11-09 22:06:18,369 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:18,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162532672] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:06:18,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:06:18,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-11-09 22:06:18,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125023247] [2024-11-09 22:06:18,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:06:18,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 22:06:18,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:06:18,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 22:06:18,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=224, Unknown=5, NotChecked=0, Total=272 [2024-11-09 22:06:18,371 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:18,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:06:18,640 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2024-11-09 22:06:18,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 22:06:18,640 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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) Word has length 24 [2024-11-09 22:06:18,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:06:18,641 INFO L225 Difference]: With dead ends: 81 [2024-11-09 22:06:18,641 INFO L226 Difference]: Without dead ends: 68 [2024-11-09 22:06:18,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=450, Unknown=5, NotChecked=0, Total=552 [2024-11-09 22:06:18,642 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 54 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:06:18,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 139 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 22:06:18,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-09 22:06:18,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-11-09 22:06:18,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.123076923076923) internal successors, (73), 65 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:18,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2024-11-09 22:06:18,648 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 24 [2024-11-09 22:06:18,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:06:18,648 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2024-11-09 22:06:18,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:18,648 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2024-11-09 22:06:18,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 22:06:18,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:06:18,649 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:06:18,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 22:06:18,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:06:18,850 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:06:18,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:06:18,850 INFO L85 PathProgramCache]: Analyzing trace with hash 2048657388, now seen corresponding path program 1 times [2024-11-09 22:06:18,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:06:18,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625304705] [2024-11-09 22:06:18,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:06:18,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:06:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:06:19,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:19,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:06:19,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625304705] [2024-11-09 22:06:19,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625304705] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:06:19,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502488104] [2024-11-09 22:06:19,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:06:19,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:06:19,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:06:19,137 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:06:19,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 22:06:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:06:19,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 22:06:19,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:06:19,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:06:19,289 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 22:06:19,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 22:06:19,318 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 19 treesize of output 1 [2024-11-09 22:06:19,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 22:06:19,366 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 22:06:19,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2024-11-09 22:06:19,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2024-11-09 22:06:19,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2024-11-09 22:06:19,404 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 39 treesize of output 21 [2024-11-09 22:06:19,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 22:06:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:19,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:06:19,467 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 52 treesize of output 30 [2024-11-09 22:06:19,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:19,526 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-09 22:06:19,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:19,535 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 36 treesize of output 35 [2024-11-09 22:06:19,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 22:06:19,574 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 22:06:19,574 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-11-09 22:06:19,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:19,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502488104] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:06:19,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:06:19,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-09 22:06:19,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532479589] [2024-11-09 22:06:19,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:06:19,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 22:06:19,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:06:19,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 22:06:19,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=318, Unknown=5, NotChecked=0, Total=380 [2024-11-09 22:06:19,661 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:19,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:06:19,931 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2024-11-09 22:06:19,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 22:06:19,931 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 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) Word has length 24 [2024-11-09 22:06:19,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:06:19,932 INFO L225 Difference]: With dead ends: 75 [2024-11-09 22:06:19,932 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 22:06:19,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=624, Unknown=5, NotChecked=0, Total=756 [2024-11-09 22:06:19,934 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 80 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:06:19,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 164 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:06:19,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 22:06:19,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-09 22:06:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:19,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2024-11-09 22:06:19,940 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 24 [2024-11-09 22:06:19,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:06:19,940 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2024-11-09 22:06:19,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:19,941 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2024-11-09 22:06:19,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 22:06:19,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:06:19,941 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:06:19,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 22:06:20,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 22:06:20,142 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:06:20,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:06:20,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1426997576, now seen corresponding path program 3 times [2024-11-09 22:06:20,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:06:20,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254200765] [2024-11-09 22:06:20,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:06:20,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:06:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:06:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:20,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:06:20,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254200765] [2024-11-09 22:06:20,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254200765] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:06:20,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018890589] [2024-11-09 22:06:20,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 22:06:20,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:06:20,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:06:20,738 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:06:20,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 22:06:20,833 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 22:06:20,833 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:06:20,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-09 22:06:20,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:06:20,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:06:20,908 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 22:06:20,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 22:06:20,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:06:20,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 22:06:21,042 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 22:06:21,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 22:06:21,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:06:21,064 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 22:06:21,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 22:06:21,120 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-09 22:06:21,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-09 22:06:21,188 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-09 22:06:21,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 79 [2024-11-09 22:06:21,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 22:06:21,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-09 22:06:21,275 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-09 22:06:21,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 77 [2024-11-09 22:06:21,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2024-11-09 22:06:21,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-09 22:06:21,337 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 22:06:21,338 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 26 [2024-11-09 22:06:21,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 22:06:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:21,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:06:21,398 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_409) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_408) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_407) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 1)) is different from false [2024-11-09 22:06:21,414 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_407 (Array Int Int)) (v_ArrVal_406 (Array Int Int)) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= v_ArrVal_406 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_406 .cse0)))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_406) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_409) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_408) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_407) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 1)))) is different from false [2024-11-09 22:06:21,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:21,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2024-11-09 22:06:21,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:21,505 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 540 treesize of output 526 [2024-11-09 22:06:21,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 72 [2024-11-09 22:06:21,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2024-11-09 22:06:21,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 322 [2024-11-09 22:06:21,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 379 treesize of output 325 [2024-11-09 22:06:21,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-09 22:06:21,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:21,750 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2024-11-09 22:06:21,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:21,764 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 205 treesize of output 198 [2024-11-09 22:06:21,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:21,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 69 [2024-11-09 22:06:21,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2024-11-09 22:06:21,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:21,848 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-11-09 22:06:21,850 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:06:21,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:21,858 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 36 treesize of output 35 [2024-11-09 22:06:21,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:21,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2024-11-09 22:06:21,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:21,889 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-09 22:06:21,891 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:06:21,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:21,900 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 36 treesize of output 35 [2024-11-09 22:06:21,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 22:06:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-09 22:06:22,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018890589] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:06:22,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:06:22,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 28 [2024-11-09 22:06:22,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713572672] [2024-11-09 22:06:22,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:06:22,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 22:06:22,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:06:22,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 22:06:22,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=560, Unknown=6, NotChecked=98, Total=756 [2024-11-09 22:06:22,482 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 28 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:23,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:06:23,082 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2024-11-09 22:06:23,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 22:06:23,082 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 28 states have internal predecessors, (65), 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) Word has length 28 [2024-11-09 22:06:23,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:06:23,083 INFO L225 Difference]: With dead ends: 73 [2024-11-09 22:06:23,083 INFO L226 Difference]: Without dead ends: 68 [2024-11-09 22:06:23,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=164, Invalid=957, Unknown=9, NotChecked=130, Total=1260 [2024-11-09 22:06:23,084 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 41 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 19 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 22:06:23,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 264 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 353 Invalid, 2 Unknown, 101 Unchecked, 0.3s Time] [2024-11-09 22:06:23,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-09 22:06:23,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2024-11-09 22:06:23,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:23,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2024-11-09 22:06:23,089 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 28 [2024-11-09 22:06:23,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:06:23,090 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2024-11-09 22:06:23,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 28 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:23,090 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2024-11-09 22:06:23,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 22:06:23,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:06:23,091 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:06:23,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 22:06:23,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:06:23,295 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:06:23,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:06:23,296 INFO L85 PathProgramCache]: Analyzing trace with hash 145250887, now seen corresponding path program 2 times [2024-11-09 22:06:23,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:06:23,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018458804] [2024-11-09 22:06:23,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:06:23,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:06:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:06:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:23,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:06:23,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018458804] [2024-11-09 22:06:23,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018458804] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:06:23,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656099082] [2024-11-09 22:06:23,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:06:23,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:06:23,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:06:23,899 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:06:23,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 22:06:23,990 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:06:23,990 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:06:23,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 22:06:23,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:06:23,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:06:24,046 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 22:06:24,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 22:06:24,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 22:06:24,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 22:06:24,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:06:24,175 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 22:06:24,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 22:06:24,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:06:24,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 22:06:24,236 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-09 22:06:24,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-09 22:06:24,326 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2024-11-09 22:06:24,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 125 [2024-11-09 22:06:24,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 105 [2024-11-09 22:06:24,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2024-11-09 22:06:24,424 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-11-09 22:06:24,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 135 [2024-11-09 22:06:24,437 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-09 22:06:24,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 121 [2024-11-09 22:06:24,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 19 [2024-11-09 22:06:24,506 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-09 22:06:24,506 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 30 [2024-11-09 22:06:24,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 22:06:24,513 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:24,514 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:06:24,600 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_492) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 2) (not (= v_ArrVal_490 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_490 .cse0))))))) is different from false [2024-11-09 22:06:24,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:24,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2024-11-09 22:06:24,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:24,690 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 262 treesize of output 266 [2024-11-09 22:06:24,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 198 [2024-11-09 22:06:24,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2024-11-09 22:06:24,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 322 [2024-11-09 22:06:24,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-09 22:06:24,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-09 22:06:24,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:24,928 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-09 22:06:24,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:24,936 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 84 treesize of output 65 [2024-11-09 22:06:24,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2024-11-09 22:06:24,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-09 22:06:24,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:24,981 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2024-11-09 22:06:24,983 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:06:24,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:24,992 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 47 treesize of output 46 [2024-11-09 22:06:25,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:25,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2024-11-09 22:06:25,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:25,037 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2024-11-09 22:06:25,039 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:06:25,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:25,045 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 38 [2024-11-09 22:06:25,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2024-11-09 22:06:25,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:25,073 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-11-09 22:06:25,080 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:06:25,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:25,092 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 36 treesize of output 35 [2024-11-09 22:06:25,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:06:25,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2024-11-09 22:06:25,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 22:06:25,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656099082] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:06:25,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:06:25,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 27 [2024-11-09 22:06:25,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897665489] [2024-11-09 22:06:25,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:06:25,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 22:06:25,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:06:25,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 22:06:25,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=549, Unknown=17, NotChecked=48, Total=702 [2024-11-09 22:06:25,724 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 27 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:26,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:06:26,294 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2024-11-09 22:06:26,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 22:06:26,294 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 27 states have internal predecessors, (64), 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) Word has length 28 [2024-11-09 22:06:26,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:06:26,295 INFO L225 Difference]: With dead ends: 75 [2024-11-09 22:06:26,295 INFO L226 Difference]: Without dead ends: 70 [2024-11-09 22:06:26,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=151, Invalid=891, Unknown=18, NotChecked=62, Total=1122 [2024-11-09 22:06:26,298 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 38 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 22:06:26,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 307 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 491 Invalid, 1 Unknown, 51 Unchecked, 0.4s Time] [2024-11-09 22:06:26,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-09 22:06:26,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2024-11-09 22:06:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 65 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:26,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2024-11-09 22:06:26,309 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 28 [2024-11-09 22:06:26,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:06:26,309 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2024-11-09 22:06:26,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:06:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2024-11-09 22:06:26,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 22:06:26,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:06:26,311 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:06:26,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 22:06:26,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:06:26,516 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:06:26,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:06:26,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1122925433, now seen corresponding path program 4 times [2024-11-09 22:06:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:06:26,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254007057] [2024-11-09 22:06:26,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:06:26,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:06:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:06:27,232 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:27,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:06:27,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254007057] [2024-11-09 22:06:27,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254007057] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:06:27,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266781323] [2024-11-09 22:06:27,233 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 22:06:27,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:06:27,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:06:27,235 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:06:27,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 22:06:27,352 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 22:06:27,353 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:06:27,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-09 22:06:27,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:06:27,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:06:27,400 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 22:06:27,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 22:06:27,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:06:27,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 22:06:27,496 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 22:06:27,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-09 22:06:27,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:06:27,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 22:06:27,555 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-09 22:06:27,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 51 [2024-11-09 22:06:27,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-11-09 22:06:27,637 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-09 22:06:27,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 80 [2024-11-09 22:06:27,658 INFO L349 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2024-11-09 22:06:27,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 37 [2024-11-09 22:06:27,663 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 9 [2024-11-09 22:06:27,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2024-11-09 22:06:27,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2024-11-09 22:06:28,091 INFO L349 Elim1Store]: treesize reduction 25, result has 49.0 percent of original size [2024-11-09 22:06:28,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 94 [2024-11-09 22:06:28,115 INFO L349 Elim1Store]: treesize reduction 21, result has 48.8 percent of original size [2024-11-09 22:06:28,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 75 [2024-11-09 22:06:28,207 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:06:28,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:06:28,388 INFO L349 Elim1Store]: treesize reduction 29, result has 83.7 percent of original size [2024-11-09 22:06:28,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 253 treesize of output 317 [2024-11-09 22:07:13,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:13,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 73 [2024-11-09 22:07:13,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:13,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2024-11-09 22:07:13,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:13,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2024-11-09 22:07:13,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:13,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 79 [2024-11-09 22:07:13,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:13,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 73 [2024-11-09 22:07:13,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:13,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2024-11-09 22:07:13,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:13,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2024-11-09 22:07:13,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:13,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 79 [2024-11-09 22:07:13,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:13,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-09 22:07:13,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:13,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 64 [2024-11-09 22:07:14,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:14,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2024-11-09 22:07:14,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:14,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 83 [2024-11-09 22:07:14,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:14,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-09 22:07:14,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:14,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 64 [2024-11-09 22:07:14,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:14,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2024-11-09 22:07:14,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:14,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 83 [2024-11-09 22:07:14,074 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (forall ((v_arrayElimArr_19 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_574 (Array Int Int)) (v_ArrVal_576 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_18 .cse4))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_19) .cse1 v_ArrVal_574))) (let ((.cse3 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_18) .cse1 v_ArrVal_576) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (+ 4 .cse3)) 0) (= .cse3 0) (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select v_arrayElimArr_19 .cse4) 0))))))) (forall ((v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int)) (v_ArrVal_574 (Array Int Int)) (v_ArrVal_576 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_28 .cse4))) (let ((.cse7 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_28) .cse5 v_ArrVal_576))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse5 .cse6) (= .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select v_arrayElimArr_29 .cse4) 0)) (= .cse5 (select (select .cse7 .cse6) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse5 v_ArrVal_574) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4)))))))) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_574 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_ArrVal_576 (Array Int Int))) (let ((.cse9 (select v_arrayElimArr_20 .cse4))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_20) .cse9 v_ArrVal_576) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse8 .cse9) (not (= (select v_arrayElimArr_21 .cse4) 0)) (= (let ((.cse10 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_21) .cse9 v_ArrVal_574))) (select (select .cse10 .cse8) (+ (select (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))) 0))))) (forall ((v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (v_ArrVal_574 (Array Int Int)) (v_ArrVal_576 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_26 .cse4))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_27) .cse11 v_ArrVal_574) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_27 .cse4) 0)) (= .cse11 (select (let ((.cse12 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_26) .cse11 v_ArrVal_576))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse13 4))) (= .cse13 0))))) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_574 (Array Int Int)) (v_ArrVal_576 (Array Int Int))) (let ((.cse16 (select v_arrayElimArr_22 .cse4))) (let ((.cse15 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) .cse16 v_ArrVal_574))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= 0 .cse14) (not (= (select v_arrayElimArr_23 .cse4) 0)) (= (select (select .cse15 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_22) .cse16 v_ArrVal_576) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (+ 4 .cse14)) 0)))))) (forall ((v_arrayElimArr_24 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_ArrVal_574 (Array Int Int)) (v_ArrVal_576 (Array Int Int))) (let ((.cse18 (select v_arrayElimArr_24 .cse4))) (let ((.cse19 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse18 v_ArrVal_576))) (let ((.cse17 (select (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse17 .cse18) (= (select (select .cse19 .cse17) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse18 v_ArrVal_574) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4)) .cse18) (not (= (select v_arrayElimArr_25 .cse4) 0)))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_ArrVal_574 (Array Int Int)) (v_arrayElimArr_31 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_576 (Array Int Int))) (let ((.cse20 (select v_arrayElimArr_30 .cse4))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) .cse20 v_ArrVal_574) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse20 (select (let ((.cse21 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse20 v_ArrVal_576))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse22 4))) (= .cse20 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select v_arrayElimArr_31 .cse4) 0)) (= .cse22 0))))) (forall ((v_arrayElimArr_17 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_574 (Array Int Int)) (v_ArrVal_576 (Array Int Int))) (let ((.cse23 (select v_arrayElimArr_16 .cse4))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_16) .cse23 v_ArrVal_576) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse23) (not (= (select v_arrayElimArr_17 .cse4) 0)) (= (let ((.cse24 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse23 v_ArrVal_574))) (select (select .cse24 .cse25) (+ (select (select .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))) 0) (= .cse25 .cse23))))))) is different from false [2024-11-09 22:07:14,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:14,308 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 86 [2024-11-09 22:07:14,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:14,315 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 89 [2024-11-09 22:07:14,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:14,332 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 230 treesize of output 229 [2024-11-09 22:07:14,938 INFO L349 Elim1Store]: treesize reduction 390, result has 58.3 percent of original size [2024-11-09 22:07:14,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 5769 treesize of output 5580 [2024-11-09 22:07:15,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:15,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 765 treesize of output 605 [2024-11-09 22:07:15,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:15,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 508 treesize of output 420 [2024-11-09 22:07:15,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 191 [2024-11-09 22:07:15,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:15,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 255 treesize of output 183