./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array20_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array20_pattern.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4595fcce7ed27c87f4b36557925b67d85fd0fff83d482c199564b06ae0d3b884 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 20:59:23,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 20:59:23,231 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 20:59:23,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 20:59:23,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 20:59:23,261 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 20:59:23,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 20:59:23,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 20:59:23,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 20:59:23,263 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 20:59:23,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 20:59:23,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 20:59:23,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 20:59:23,265 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 20:59:23,265 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 20:59:23,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 20:59:23,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 20:59:23,266 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 20:59:23,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 20:59:23,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 20:59:23,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 20:59:23,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 20:59:23,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 20:59:23,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 20:59:23,270 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 20:59:23,270 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 20:59:23,270 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 20:59:23,270 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 20:59:23,270 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 20:59:23,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 20:59:23,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 20:59:23,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 20:59:23,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 20:59:23,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 20:59:23,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 20:59:23,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 20:59:23,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 20:59:23,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 20:59:23,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 20:59:23,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 20:59:23,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 20:59:23,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 20:59:23,273 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 -> 4595fcce7ed27c87f4b36557925b67d85fd0fff83d482c199564b06ae0d3b884 [2024-11-21 20:59:23,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 20:59:23,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 20:59:23,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 20:59:23,502 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 20:59:23,502 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 20:59:23,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array20_pattern.c [2024-11-21 20:59:24,696 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 20:59:24,829 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 20:59:24,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array20_pattern.c [2024-11-21 20:59:24,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ded495392/5d5940876a8f4ef9988accb704d580db/FLAGfaa8135c7 [2024-11-21 20:59:24,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ded495392/5d5940876a8f4ef9988accb704d580db [2024-11-21 20:59:24,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 20:59:24,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 20:59:24,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 20:59:24,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 20:59:24,855 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 20:59:24,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:59:24" (1/1) ... [2024-11-21 20:59:24,856 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66a62a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:24, skipping insertion in model container [2024-11-21 20:59:24,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:59:24" (1/1) ... [2024-11-21 20:59:24,873 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 20:59:25,054 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/array-patterns/array20_pattern.c[1444,1457] [2024-11-21 20:59:25,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 20:59:25,089 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 20:59:25,099 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/array-patterns/array20_pattern.c[1444,1457] [2024-11-21 20:59:25,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 20:59:25,126 INFO L204 MainTranslator]: Completed translation [2024-11-21 20:59:25,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:25 WrapperNode [2024-11-21 20:59:25,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 20:59:25,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 20:59:25,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 20:59:25,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 20:59:25,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:25" (1/1) ... [2024-11-21 20:59:25,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:25" (1/1) ... [2024-11-21 20:59:25,155 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 104 [2024-11-21 20:59:25,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 20:59:25,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 20:59:25,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 20:59:25,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 20:59:25,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:25" (1/1) ... [2024-11-21 20:59:25,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:25" (1/1) ... [2024-11-21 20:59:25,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:25" (1/1) ... [2024-11-21 20:59:25,178 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-11-21 20:59:25,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:25" (1/1) ... [2024-11-21 20:59:25,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:25" (1/1) ... [2024-11-21 20:59:25,183 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:25" (1/1) ... [2024-11-21 20:59:25,186 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:25" (1/1) ... [2024-11-21 20:59:25,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:25" (1/1) ... [2024-11-21 20:59:25,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:25" (1/1) ... [2024-11-21 20:59:25,193 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 20:59:25,195 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 20:59:25,195 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 20:59:25,195 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 20:59:25,196 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:25" (1/1) ... [2024-11-21 20:59:25,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 20:59:25,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:59:25,220 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-21 20:59:25,222 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-21 20:59:25,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 20:59:25,254 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-21 20:59:25,254 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-21 20:59:25,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 20:59:25,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-21 20:59:25,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-21 20:59:25,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-21 20:59:25,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-21 20:59:25,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 20:59:25,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 20:59:25,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-21 20:59:25,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-21 20:59:25,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-21 20:59:25,326 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 20:59:25,328 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 20:59:25,515 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-21 20:59:25,516 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 20:59:25,531 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 20:59:25,531 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-21 20:59:25,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:59:25 BoogieIcfgContainer [2024-11-21 20:59:25,532 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 20:59:25,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 20:59:25,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 20:59:25,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 20:59:25,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 08:59:24" (1/3) ... [2024-11-21 20:59:25,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7815597d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:59:25, skipping insertion in model container [2024-11-21 20:59:25,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:25" (2/3) ... [2024-11-21 20:59:25,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7815597d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:59:25, skipping insertion in model container [2024-11-21 20:59:25,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:59:25" (3/3) ... [2024-11-21 20:59:25,541 INFO L112 eAbstractionObserver]: Analyzing ICFG array20_pattern.c [2024-11-21 20:59:25,553 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 20:59:25,553 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 20:59:25,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 20:59:25,596 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;@6591ed07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 20:59:25,596 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 20:59:25,599 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:59:25,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-21 20:59:25,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:59:25,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:59:25,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:59:25,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:59:25,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2132324569, now seen corresponding path program 1 times [2024-11-21 20:59:25,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:59:25,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201760055] [2024-11-21 20:59:25,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:59:25,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:59:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:59:25,721 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-21 20:59:25,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:59:25,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201760055] [2024-11-21 20:59:25,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201760055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:59:25,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:59:25,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 20:59:25,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774572956] [2024-11-21 20:59:25,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:59:25,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 20:59:25,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:59:25,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 20:59:25,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 20:59:25,751 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 20:59:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:59:25,764 INFO L93 Difference]: Finished difference Result 63 states and 97 transitions. [2024-11-21 20:59:25,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 20:59:25,767 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-21 20:59:25,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:59:25,771 INFO L225 Difference]: With dead ends: 63 [2024-11-21 20:59:25,771 INFO L226 Difference]: Without dead ends: 29 [2024-11-21 20:59:25,773 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-21 20:59:25,776 INFO L432 NwaCegarLoop]: 41 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, 41 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-21 20:59:25,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:59:25,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-21 20:59:25,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-21 20:59:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:59:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-11-21 20:59:25,801 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 [2024-11-21 20:59:25,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:59:25,801 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-21 20:59:25,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 20:59:25,801 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-11-21 20:59:25,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-21 20:59:25,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:59:25,803 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:59:25,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 20:59:25,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:59:25,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:59:25,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1872922357, now seen corresponding path program 1 times [2024-11-21 20:59:25,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:59:25,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972321053] [2024-11-21 20:59:25,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:59:25,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:59:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:59:26,103 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-21 20:59:26,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:59:26,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972321053] [2024-11-21 20:59:26,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972321053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:59:26,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:59:26,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 20:59:26,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308906004] [2024-11-21 20:59:26,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:59:26,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 20:59:26,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:59:26,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 20:59:26,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 20:59:26,110 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 20:59:26,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:59:26,130 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-11-21 20:59:26,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 20:59:26,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2024-11-21 20:59:26,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:59:26,132 INFO L225 Difference]: With dead ends: 36 [2024-11-21 20:59:26,132 INFO L226 Difference]: Without dead ends: 32 [2024-11-21 20:59:26,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 20:59:26,134 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 11 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:59:26,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 84 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:59:26,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-21 20:59:26,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-21 20:59:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:59:26,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-11-21 20:59:26,144 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 30 [2024-11-21 20:59:26,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:59:26,145 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-11-21 20:59:26,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 20:59:26,145 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-11-21 20:59:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-21 20:59:26,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:59:26,147 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:59:26,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 20:59:26,148 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:59:26,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:59:26,149 INFO L85 PathProgramCache]: Analyzing trace with hash 212512359, now seen corresponding path program 1 times [2024-11-21 20:59:26,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:59:26,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614291754] [2024-11-21 20:59:26,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:59:26,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:59:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:59:26,310 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-21 20:59:26,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:59:26,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614291754] [2024-11-21 20:59:26,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614291754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:59:26,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:59:26,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-21 20:59:26,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520058652] [2024-11-21 20:59:26,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:59:26,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 20:59:26,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:59:26,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 20:59:26,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 20:59:26,312 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 20:59:26,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:59:26,405 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2024-11-21 20:59:26,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 20:59:26,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-11-21 20:59:26,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:59:26,406 INFO L225 Difference]: With dead ends: 67 [2024-11-21 20:59:26,406 INFO L226 Difference]: Without dead ends: 42 [2024-11-21 20:59:26,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 20:59:26,408 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:59:26,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 59 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 20:59:26,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-21 20:59:26,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2024-11-21 20:59:26,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:59:26,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2024-11-21 20:59:26,413 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 35 [2024-11-21 20:59:26,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:59:26,414 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2024-11-21 20:59:26,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 20:59:26,414 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2024-11-21 20:59:26,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-21 20:59:26,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:59:26,415 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:59:26,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 20:59:26,416 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:59:26,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:59:26,416 INFO L85 PathProgramCache]: Analyzing trace with hash -654332553, now seen corresponding path program 1 times [2024-11-21 20:59:26,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:59:26,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416097119] [2024-11-21 20:59:26,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:59:26,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:59:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:59:26,519 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-21 20:59:26,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:59:26,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416097119] [2024-11-21 20:59:26,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416097119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:59:26,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:59:26,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 20:59:26,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644863016] [2024-11-21 20:59:26,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:59:26,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 20:59:26,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:59:26,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 20:59:26,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 20:59:26,523 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 20:59:26,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:59:26,566 INFO L93 Difference]: Finished difference Result 69 states and 89 transitions. [2024-11-21 20:59:26,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 20:59:26,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-11-21 20:59:26,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:59:26,568 INFO L225 Difference]: With dead ends: 69 [2024-11-21 20:59:26,568 INFO L226 Difference]: Without dead ends: 41 [2024-11-21 20:59:26,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 20:59:26,569 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:59:26,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 55 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:59:26,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-21 20:59:26,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2024-11-21 20:59:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:59:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2024-11-21 20:59:26,576 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 38 [2024-11-21 20:59:26,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:59:26,576 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-11-21 20:59:26,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 20:59:26,576 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2024-11-21 20:59:26,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-21 20:59:26,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:59:26,577 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:59:26,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 20:59:26,577 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:59:26,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:59:26,578 INFO L85 PathProgramCache]: Analyzing trace with hash 579061941, now seen corresponding path program 1 times [2024-11-21 20:59:26,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:59:26,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121748111] [2024-11-21 20:59:26,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:59:26,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:59:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-21 20:59:26,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [100644062] [2024-11-21 20:59:26,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:59:26,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:59:26,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:59:26,620 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-21 20:59:26,621 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-21 20:59:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:59:26,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-21 20:59:26,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:59:26,894 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-21 20:59:27,369 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-21 20:59:27,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 18 [2024-11-21 20:59:27,452 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-21 20:59:27,666 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-21 20:59:27,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:59:41,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:59:41,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121748111] [2024-11-21 20:59:41,763 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-21 20:59:41,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100644062] [2024-11-21 20:59:41,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100644062] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:59:41,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-21 20:59:41,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2024-11-21 20:59:41,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139997089] [2024-11-21 20:59:41,763 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-21 20:59:41,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-21 20:59:41,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:59:41,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-21 20:59:41,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1182, Unknown=0, NotChecked=0, Total=1406 [2024-11-21 20:59:41,767 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 20:59:42,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:59:42,508 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2024-11-21 20:59:42,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-21 20:59:42,508 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.36) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-11-21 20:59:42,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:59:42,510 INFO L225 Difference]: With dead ends: 110 [2024-11-21 20:59:42,511 INFO L226 Difference]: Without dead ends: 81 [2024-11-21 20:59:42,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=338, Invalid=1918, Unknown=0, NotChecked=0, Total=2256 [2024-11-21 20:59:42,514 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 68 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 20:59:42,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 187 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 20:59:42,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-21 20:59:42,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 63. [2024-11-21 20:59:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 54 states have internal predecessors, (67), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-21 20:59:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2024-11-21 20:59:42,530 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 40 [2024-11-21 20:59:42,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:59:42,530 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2024-11-21 20:59:42,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.36) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 20:59:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2024-11-21 20:59:42,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-21 20:59:42,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:59:42,532 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:59:42,540 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-21 20:59:42,733 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-21 20:59:42,735 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:59:42,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:59:42,735 INFO L85 PathProgramCache]: Analyzing trace with hash -700801737, now seen corresponding path program 1 times [2024-11-21 20:59:42,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:59:42,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668952470] [2024-11-21 20:59:42,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:59:42,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:59:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:59:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-21 20:59:42,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:59:42,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668952470] [2024-11-21 20:59:42,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668952470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:59:42,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:59:42,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 20:59:42,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130094953] [2024-11-21 20:59:42,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:59:42,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 20:59:42,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:59:42,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 20:59:42,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 20:59:42,782 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 20:59:42,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:59:42,822 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2024-11-21 20:59:42,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 20:59:42,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-11-21 20:59:42,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:59:42,823 INFO L225 Difference]: With dead ends: 89 [2024-11-21 20:59:42,824 INFO L226 Difference]: Without dead ends: 66 [2024-11-21 20:59:42,825 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-21 20:59:42,825 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:59:42,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:59:42,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-21 20:59:42,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-11-21 20:59:42,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 56 states have internal predecessors, (69), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-21 20:59:42,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2024-11-21 20:59:42,838 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 40 [2024-11-21 20:59:42,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:59:42,838 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2024-11-21 20:59:42,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 20:59:42,839 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2024-11-21 20:59:42,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-21 20:59:42,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:59:42,840 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:59:42,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 20:59:42,841 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:59:42,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:59:42,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1287607751, now seen corresponding path program 1 times [2024-11-21 20:59:42,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:59:42,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400716175] [2024-11-21 20:59:42,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:59:42,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:59:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:59:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-21 20:59:43,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:59:43,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400716175] [2024-11-21 20:59:43,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400716175] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:59:43,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034564433] [2024-11-21 20:59:43,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:59:43,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:59:43,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:59:43,114 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-21 20:59:43,115 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-21 20:59:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:59:43,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-21 20:59:43,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:59:43,296 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-21 20:59:43,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:59:43,499 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-21 20:59:43,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034564433] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:59:43,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:59:43,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 23 [2024-11-21 20:59:43,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635821279] [2024-11-21 20:59:43,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:59:43,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-21 20:59:43,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:59:43,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-21 20:59:43,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2024-11-21 20:59:43,502 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand has 23 states, 19 states have (on average 2.526315789473684) internal successors, (48), 17 states have internal predecessors, (48), 6 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-21 20:59:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:59:44,091 INFO L93 Difference]: Finished difference Result 214 states and 270 transitions. [2024-11-21 20:59:44,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-21 20:59:44,092 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 2.526315789473684) internal successors, (48), 17 states have internal predecessors, (48), 6 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 40 [2024-11-21 20:59:44,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:59:44,094 INFO L225 Difference]: With dead ends: 214 [2024-11-21 20:59:44,094 INFO L226 Difference]: Without dead ends: 182 [2024-11-21 20:59:44,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=340, Invalid=1142, Unknown=0, NotChecked=0, Total=1482 [2024-11-21 20:59:44,095 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 159 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 20:59:44,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 414 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 20:59:44,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-21 20:59:44,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 114. [2024-11-21 20:59:44,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 100 states have internal predecessors, (123), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-21 20:59:44,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 141 transitions. [2024-11-21 20:59:44,112 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 141 transitions. Word has length 40 [2024-11-21 20:59:44,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:59:44,113 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 141 transitions. [2024-11-21 20:59:44,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 2.526315789473684) internal successors, (48), 17 states have internal predecessors, (48), 6 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-21 20:59:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 141 transitions. [2024-11-21 20:59:44,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-21 20:59:44,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:59:44,114 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:59:44,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-21 20:59:44,314 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,SelfDestructingSolverStorable6 [2024-11-21 20:59:44,315 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:59:44,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:59:44,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1706965193, now seen corresponding path program 2 times [2024-11-21 20:59:44,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:59:44,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957689034] [2024-11-21 20:59:44,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:59:44,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:59:44,342 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 20:59:44,342 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:59:44,414 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-21 20:59:44,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:59:44,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957689034] [2024-11-21 20:59:44,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957689034] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:59:44,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517230509] [2024-11-21 20:59:44,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:59:44,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:59:44,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:59:44,416 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-21 20:59:44,417 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-21 20:59:44,474 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 20:59:44,474 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:59:44,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-21 20:59:44,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:59:44,525 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-21 20:59:44,527 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:59:44,576 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-21 20:59:44,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517230509] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:59:44,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:59:44,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-21 20:59:44,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602615008] [2024-11-21 20:59:44,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:59:44,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-21 20:59:44,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:59:44,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-21 20:59:44,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-21 20:59:44,579 INFO L87 Difference]: Start difference. First operand 114 states and 141 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-21 20:59:44,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:59:44,666 INFO L93 Difference]: Finished difference Result 171 states and 207 transitions. [2024-11-21 20:59:44,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 20:59:44,667 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2024-11-21 20:59:44,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:59:44,668 INFO L225 Difference]: With dead ends: 171 [2024-11-21 20:59:44,668 INFO L226 Difference]: Without dead ends: 120 [2024-11-21 20:59:44,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-21 20:59:44,668 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:59:44,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 77 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 20:59:44,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-21 20:59:44,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2024-11-21 20:59:44,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.2142857142857142) internal successors, (119), 100 states have internal predecessors, (119), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-21 20:59:44,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2024-11-21 20:59:44,685 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 42 [2024-11-21 20:59:44,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:59:44,686 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2024-11-21 20:59:44,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-21 20:59:44,687 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2024-11-21 20:59:44,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-21 20:59:44,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:59:44,699 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:59:44,706 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-21 20:59:44,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:59:44,900 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:59:44,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:59:44,900 INFO L85 PathProgramCache]: Analyzing trace with hash 460196979, now seen corresponding path program 3 times [2024-11-21 20:59:44,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:59:44,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645761759] [2024-11-21 20:59:44,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 20:59:44,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:59:44,924 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-21 20:59:44,925 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:59:44,990 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-21 20:59:44,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:59:44,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645761759] [2024-11-21 20:59:44,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645761759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:59:44,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395999836] [2024-11-21 20:59:44,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 20:59:44,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:59:44,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:59:44,993 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-21 20:59:44,994 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-21 20:59:45,062 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-21 20:59:45,063 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:59:45,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-21 20:59:45,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:59:45,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2024-11-21 20:59:45,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 134 [2024-11-21 20:59:45,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:59:45,450 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 24 treesize of output 19 [2024-11-21 20:59:45,684 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-21 20:59:45,684 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:59:45,909 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 138 treesize of output 130 [2024-11-21 20:59:45,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:59:45,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 329 [2024-11-21 20:59:46,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:59:46,149 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 368 treesize of output 352 [2024-11-21 20:59:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-21 20:59:46,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395999836] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:59:46,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:59:46,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 16, 16] total 35 [2024-11-21 20:59:46,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897317915] [2024-11-21 20:59:46,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:59:46,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-21 20:59:46,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:59:46,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-21 20:59:46,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1031, Unknown=0, NotChecked=0, Total=1190 [2024-11-21 20:59:46,684 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand has 35 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 33 states have internal predecessors, (80), 4 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-21 20:59:49,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:59:49,541 INFO L93 Difference]: Finished difference Result 227 states and 275 transitions. [2024-11-21 20:59:49,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-11-21 20:59:49,541 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 33 states have internal predecessors, (80), 4 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 42 [2024-11-21 20:59:49,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:59:49,542 INFO L225 Difference]: With dead ends: 227 [2024-11-21 20:59:49,542 INFO L226 Difference]: Without dead ends: 185 [2024-11-21 20:59:49,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1473 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1011, Invalid=5469, Unknown=0, NotChecked=0, Total=6480 [2024-11-21 20:59:49,545 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 209 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-21 20:59:49,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 346 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-21 20:59:49,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-21 20:59:49,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 87. [2024-11-21 20:59:49,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 77 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-21 20:59:49,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2024-11-21 20:59:49,565 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 42 [2024-11-21 20:59:49,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:59:49,566 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2024-11-21 20:59:49,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 33 states have internal predecessors, (80), 4 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-21 20:59:49,566 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2024-11-21 20:59:49,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-21 20:59:49,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:59:49,566 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:59:49,573 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-21 20:59:49,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:59:49,767 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:59:49,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:59:49,768 INFO L85 PathProgramCache]: Analyzing trace with hash 822903975, now seen corresponding path program 4 times [2024-11-21 20:59:49,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:59:49,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246381321] [2024-11-21 20:59:49,769 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-21 20:59:49,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:59:49,786 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-21 20:59:49,786 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:59:49,832 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-21 20:59:49,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:59:49,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246381321] [2024-11-21 20:59:49,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246381321] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:59:49,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193998157] [2024-11-21 20:59:49,832 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-21 20:59:49,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:59:49,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:59:49,834 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-21 20:59:49,836 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-21 20:59:49,882 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-21 20:59:49,882 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:59:49,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-21 20:59:49,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:59:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-21 20:59:49,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:59:49,985 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-21 20:59:49,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193998157] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:59:49,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:59:49,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-21 20:59:49,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677782781] [2024-11-21 20:59:49,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:59:49,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-21 20:59:49,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:59:49,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-21 20:59:49,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-21 20:59:49,987 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-21 20:59:50,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:59:50,104 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2024-11-21 20:59:50,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-21 20:59:50,105 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2024-11-21 20:59:50,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:59:50,105 INFO L225 Difference]: With dead ends: 105 [2024-11-21 20:59:50,105 INFO L226 Difference]: Without dead ends: 64 [2024-11-21 20:59:50,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-21 20:59:50,106 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 20 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:59:50,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 111 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 20:59:50,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-21 20:59:50,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2024-11-21 20:59:50,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:59:50,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2024-11-21 20:59:50,112 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 45 [2024-11-21 20:59:50,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:59:50,112 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2024-11-21 20:59:50,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-21 20:59:50,112 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2024-11-21 20:59:50,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-21 20:59:50,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:59:50,113 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:59:50,119 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-21 20:59:50,313 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,SelfDestructingSolverStorable9 [2024-11-21 20:59:50,314 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:59:50,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:59:50,314 INFO L85 PathProgramCache]: Analyzing trace with hash -749934679, now seen corresponding path program 5 times [2024-11-21 20:59:50,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:59:50,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588643871] [2024-11-21 20:59:50,315 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-21 20:59:50,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:59:50,324 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-21 20:59:50,324 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:59:50,369 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-21 20:59:50,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:59:50,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588643871] [2024-11-21 20:59:50,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588643871] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:59:50,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581596407] [2024-11-21 20:59:50,370 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-21 20:59:50,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:59:50,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:59:50,372 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-21 20:59:50,374 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-21 20:59:50,415 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-21 20:59:50,415 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:59:50,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-21 20:59:50,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:59:50,459 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-21 20:59:50,459 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:59:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-21 20:59:50,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581596407] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:59:50,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:59:50,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-21 20:59:50,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90514187] [2024-11-21 20:59:50,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:59:50,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-21 20:59:50,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:59:50,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-21 20:59:50,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-21 20:59:50,500 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-21 20:59:50,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:59:50,597 INFO L93 Difference]: Finished difference Result 118 states and 141 transitions. [2024-11-21 20:59:50,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 20:59:50,597 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2024-11-21 20:59:50,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:59:50,598 INFO L225 Difference]: With dead ends: 118 [2024-11-21 20:59:50,598 INFO L226 Difference]: Without dead ends: 77 [2024-11-21 20:59:50,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2024-11-21 20:59:50,600 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 31 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:59:50,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 144 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 20:59:50,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-21 20:59:50,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 64. [2024-11-21 20:59:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 58 states have internal predecessors, (69), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:59:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2024-11-21 20:59:50,608 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 47 [2024-11-21 20:59:50,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:59:50,608 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2024-11-21 20:59:50,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-21 20:59:50,608 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2024-11-21 20:59:50,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-21 20:59:50,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:59:50,609 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:59:50,616 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-21 20:59:50,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:59:50,810 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:59:50,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:59:50,810 INFO L85 PathProgramCache]: Analyzing trace with hash 538416053, now seen corresponding path program 6 times [2024-11-21 20:59:50,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:59:50,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562268888] [2024-11-21 20:59:50,810 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-21 20:59:50,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:59:50,842 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2024-11-21 20:59:50,842 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:59:50,932 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-21 20:59:50,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:59:50,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562268888] [2024-11-21 20:59:50,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562268888] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:59:50,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980759229] [2024-11-21 20:59:50,933 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-21 20:59:50,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:59:50,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:59:50,935 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-21 20:59:50,936 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-21 20:59:51,254 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2024-11-21 20:59:51,255 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:59:51,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-21 20:59:51,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:59:51,327 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 17 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-21 20:59:51,327 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:59:51,377 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-21 20:59:51,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980759229] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:59:51,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:59:51,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-11-21 20:59:51,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377572782] [2024-11-21 20:59:51,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:59:51,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-21 20:59:51,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:59:51,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-21 20:59:51,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-21 20:59:51,378 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-21 20:59:51,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:59:51,535 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2024-11-21 20:59:51,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-21 20:59:51,535 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2024-11-21 20:59:51,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:59:51,536 INFO L225 Difference]: With dead ends: 71 [2024-11-21 20:59:51,536 INFO L226 Difference]: Without dead ends: 60 [2024-11-21 20:59:51,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 101 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2024-11-21 20:59:51,536 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:59:51,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 79 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 20:59:51,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-21 20:59:51,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2024-11-21 20:59:51,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:59:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2024-11-21 20:59:51,542 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 54 [2024-11-21 20:59:51,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:59:51,543 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2024-11-21 20:59:51,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-21 20:59:51,543 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2024-11-21 20:59:51,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-21 20:59:51,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:59:51,543 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:59:51,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-21 20:59:51,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:59:51,744 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:59:51,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:59:51,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1673343477, now seen corresponding path program 7 times [2024-11-21 20:59:51,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:59:51,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396997897] [2024-11-21 20:59:51,745 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-21 20:59:51,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:59:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-21 20:59:51,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1299167631] [2024-11-21 20:59:51,776 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-21 20:59:51,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:59:51,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:59:51,778 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-21 20:59:51,779 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-21 20:59:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:59:52,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-21 20:59:52,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:59:52,279 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-21 20:59:52,354 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 19 treesize of output 18 [2024-11-21 20:59:52,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:59:52,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-21 20:59:52,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:59:52,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-11-21 20:59:53,178 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-21 20:59:53,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 172 [2024-11-21 20:59:53,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,256 INFO L349 Elim1Store]: treesize reduction 74, result has 1.3 percent of original size [2024-11-21 20:59:53,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 4 select indices, 4 select index equivalence classes, 26 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 549 [2024-11-21 20:59:53,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,323 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 20:59:53,324 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 20:59:53,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,334 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 20:59:53,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,348 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 20:59:53,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,360 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 20:59:53,373 INFO L349 Elim1Store]: treesize reduction 74, result has 1.3 percent of original size [2024-11-21 20:59:53,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 36 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 170 treesize of output 316 [2024-11-21 20:59:53,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,429 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 20:59:53,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,440 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 20:59:53,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,451 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 20:59:53,458 INFO L349 Elim1Store]: treesize reduction 82, result has 1.2 percent of original size [2024-11-21 20:59:53,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 25 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 142 [2024-11-21 20:59:53,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,490 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 20:59:53,514 INFO L349 Elim1Store]: treesize reduction 44, result has 47.0 percent of original size [2024-11-21 20:59:53,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 162 treesize of output 162 [2024-11-21 20:59:53,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 95 [2024-11-21 20:59:53,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,728 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-21 20:59:53,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 95 treesize of output 182 [2024-11-21 20:59:53,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 20:59:53,891 INFO L349 Elim1Store]: treesize reduction 65, result has 32.3 percent of original size [2024-11-21 20:59:53,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 212 [2024-11-21 20:59:54,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2024-11-21 20:59:55,573 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 134 treesize of output 108 [2024-11-21 20:59:55,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:59:55,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 123 treesize of output 161 [2024-11-21 20:59:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 53 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-21 20:59:55,934 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:00:32,175 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 743 treesize of output 719 [2024-11-21 21:00:32,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 21:00:32,379 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 61781004 treesize of output 58887180 [2024-11-21 21:00:38,558 WARN L286 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 4698 DAG size of output: 491 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-21 21:00:39,242 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 509 treesize of output 493 [2024-11-21 21:00:39,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 21:00:39,317 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 15128027 treesize of output 14407131 [2024-11-21 21:00:42,222 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 977 treesize of output 945 [2024-11-21 21:00:42,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 21:00:42,353 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 28937089 treesize of output 1 [2024-11-21 21:00:42,356 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 169 treesize of output 161 [2024-11-21 21:00:42,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 21:00:42,362 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 691 treesize of output 1 [2024-11-21 21:00:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 49 refuted. 1 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-21 21:00:42,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:00:42,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396997897] [2024-11-21 21:00:42,923 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-21 21:00:42,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299167631] [2024-11-21 21:00:42,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299167631] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:00:42,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-21 21:00:42,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 35] total 73 [2024-11-21 21:00:42,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098149581] [2024-11-21 21:00:42,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-21 21:00:42,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-11-21 21:00:42,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:00:42,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-11-21 21:00:42,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=4604, Unknown=1, NotChecked=0, Total=5256 [2024-11-21 21:00:42,925 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 73 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 70 states have internal predecessors, (99), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-21 21:00:47,042 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse179 (mod |c_ULTIMATE.start_main_~index2~0#1| 4294967296)) (.cse203 (mod (+ (* 4294967295 |c_ULTIMATE.start_main_~index1~0#1|) 1) 4294967296)) (.cse147 (* |c_ULTIMATE.start_main_~row~0#1| 8)) (.cse168 (+ |c_ULTIMATE.start_main_~row~0#1| 1)) (.cse204 (* c_~ARR_SIZE~0 4))) (let ((.cse181 (* .cse168 .cse204)) (.cse182 (* |c_ULTIMATE.start_main_~row~0#1| .cse204)) (.cse183 (* |c_ULTIMATE.start_main_~column~0#1| 4)) (.cse4 (+ 12 |c_ULTIMATE.start_main_~#array~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) (.cse11 (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) (.cse148 (+ .cse147 |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) (.cse95 (+ .cse147 8 |c_ULTIMATE.start_main_~#array~0#1.offset|)) (.cse96 (+ .cse147 12 |c_ULTIMATE.start_main_~#array~0#1.offset|)) (.cse202 (* .cse203 8)) (.cse9 (* .cse179 4)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~#array~0#1.offset|)) (.cse7 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#array~0#1.base|))) (let ((.cse36 (select .cse7 |c_ULTIMATE.start_main_~#array~0#1.offset|)) (.cse37 (select .cse7 .cse5)) (.cse10 (+ (- 17179869184) .cse202 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9)) (.cse14 (< .cse203 2147483648)) (.cse18 (+ .cse202 |c_ULTIMATE.start_main_~#array~0#1.offset| (- 34359738368) .cse9)) (.cse19 (< 2147483647 .cse203)) (.cse22 (+ .cse202 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9)) (.cse126 (let ((.cse187 (store (store (store .cse7 .cse148 0) .cse95 0) .cse96 0))) (and (forall ((v_z_39 Int)) (or (< 4294967295 v_z_39) (< v_z_39 0) (= v_z_39 4294967295) (forall ((v_y_39 Int)) (let ((.cse185 (let ((.cse186 (store (store .cse187 (+ (* v_z_39 17179869188) (* 17179869184 v_y_39) 8 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~num~0#1|) (+ (* v_y_39 51539607552) (* v_z_39 51539607540) |c_ULTIMATE.start_main_~#array~0#1.offset|) .cse11))) (+ (select .cse186 .cse4) (select .cse186 .cse6) |c_ULTIMATE.start_main_~sum~0#1| (select .cse186 .cse5) (select .cse186 |c_ULTIMATE.start_main_~#array~0#1.offset|)))) (.cse184 (+ (* v_z_39 4294967295) (* v_y_39 4294967296)))) (or (< .cse184 0) (= .cse185 0) (= .cse185 1) (< 1 .cse184)))))) (forall ((v_z_39 Int)) (or (forall ((v_y_39 Int)) (let ((.cse190 (* 17179869184 v_y_39)) (.cse191 (* v_y_39 51539607552))) (let ((.cse192 (let ((.cse193 (store (store .cse187 (+ (* v_z_39 17179869188) .cse190 8 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse191 (* v_z_39 51539607540) |c_ULTIMATE.start_main_~#array~0#1.offset|) .cse11))) (+ (select .cse193 .cse4) (select .cse193 .cse6) |c_ULTIMATE.start_main_~sum~0#1| (select .cse193 .cse5) (select .cse193 |c_ULTIMATE.start_main_~#array~0#1.offset|)))) (.cse188 (+ (* v_z_39 4294967295) (* v_y_39 4294967296)))) (or (< .cse188 0) (= (let ((.cse189 (store (store .cse187 (+ .cse190 |c_ULTIMATE.start_main_~#array~0#1.offset| 73786976260478468100) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse191 |c_ULTIMATE.start_main_~#array~0#1.offset| 221360928781435404300) .cse11))) (+ (select .cse189 .cse4) |c_ULTIMATE.start_main_~sum~0#1| (select .cse189 .cse6) (select .cse189 .cse5) (select .cse189 |c_ULTIMATE.start_main_~#array~0#1.offset|))) 1) (= .cse192 0) (= .cse192 1) (< 1 .cse188))))) (< 4294967295 v_z_39) (< v_z_39 0) (= v_z_39 4294967295))) (let ((.cse194 (+ |c_ULTIMATE.start_main_~sum~0#1| (select .cse187 |c_ULTIMATE.start_main_~#array~0#1.offset|) (select .cse187 .cse5) |c_ULTIMATE.start_main_~num~0#1| .cse11))) (or (= .cse194 1) (= .cse194 0))) (forall ((v_z_39 Int)) (or (< 4294967295 v_z_39) (< v_z_39 0) (forall ((v_y_39 Int)) (let ((.cse199 (* 17179869184 v_y_39)) (.cse200 (* v_y_39 51539607552))) (let ((.cse196 (let ((.cse201 (store (store .cse187 (+ .cse199 |c_ULTIMATE.start_main_~#array~0#1.offset| 73786976260478468100) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse200 |c_ULTIMATE.start_main_~#array~0#1.offset| 221360928781435404300) .cse11))) (+ (select .cse201 .cse4) |c_ULTIMATE.start_main_~sum~0#1| (select .cse201 .cse6) (select .cse201 .cse5) (select .cse201 |c_ULTIMATE.start_main_~#array~0#1.offset|)))) (.cse197 (let ((.cse198 (store (store .cse187 (+ (* v_z_39 17179869188) .cse199 8 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse200 (* v_z_39 51539607540) |c_ULTIMATE.start_main_~#array~0#1.offset|) .cse11))) (+ (select .cse198 .cse4) (select .cse198 .cse6) |c_ULTIMATE.start_main_~sum~0#1| (select .cse198 .cse5) (select .cse198 |c_ULTIMATE.start_main_~#array~0#1.offset|)))) (.cse195 (+ (* v_z_39 4294967295) (* v_y_39 4294967296)))) (or (< .cse195 0) (= .cse196 1) (= .cse196 0) (= .cse197 0) (= .cse197 1) (< 1 .cse195)))))))))) (.cse45 (store .cse7 (+ .cse147 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse183) 0)) (.cse116 (+ .cse147 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse183)) (.cse117 (< 0 |c_ULTIMATE.start_main_~column~0#1|)) (.cse72 (select .cse7 (+ .cse182 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (.cse74 (select .cse7 (+ .cse182 |c_ULTIMATE.start_main_~#array~0#1.offset| 4))) (.cse1 (< .cse179 2147483648)) (.cse12 (< 2147483647 .cse179)) (.cse0 (not (= c_~ARR_SIZE~0 2))) (.cse70 (< c_~ARR_SIZE~0 2)) (.cse71 (not (= c_~ARR_SIZE~0 (+ |c_ULTIMATE.start_main_~row~0#1| 2)))) (.cse73 (select .cse7 (+ .cse181 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (.cse128 (select .cse7 (+ .cse182 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse183))) (.cse125 (select .cse7 (+ .cse182 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse183))) (.cse75 (select .cse7 (+ .cse181 |c_ULTIMATE.start_main_~#array~0#1.offset| 4)))) (and (or .cse0 (let ((.cse13 (mod |c_ULTIMATE.start_main_~index1~0#1| 4294967296))) (let ((.cse8 (* .cse13 8))) (and (let ((.cse2 (let ((.cse3 (store (store .cse7 (+ (- 17179869184) .cse8 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9) |c_ULTIMATE.start_main_#t~ite10#1|) .cse10 .cse11))) (+ |c_ULTIMATE.start_main_~sum~0#1| (select .cse3 .cse4) (select .cse3 .cse5) (select .cse3 .cse6) (select .cse3 |c_ULTIMATE.start_main_~#array~0#1.offset|))))) (or .cse1 (= .cse2 1) (= .cse2 0))) (or .cse12 (and (or (< 2147483647 .cse13) (let ((.cse17 (store .cse7 (+ .cse8 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9) |c_ULTIMATE.start_main_#t~ite10#1|))) (and (let ((.cse15 (let ((.cse16 (store .cse17 .cse18 .cse11))) (+ (select .cse16 .cse5) |c_ULTIMATE.start_main_~sum~0#1| (select .cse16 .cse4) (select .cse16 .cse6) (select .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset|))))) (or .cse14 (= .cse15 0) (= .cse15 1))) (let ((.cse20 (let ((.cse21 (store .cse17 .cse22 .cse11))) (+ (select .cse21 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse21 .cse5) (select .cse21 .cse4) (select .cse21 .cse6))))) (or .cse19 (= .cse20 1) (= 0 .cse20)))))) (let ((.cse23 (let ((.cse24 (store (store .cse7 (+ .cse8 |c_ULTIMATE.start_main_~#array~0#1.offset| (- 34359738368) .cse9) |c_ULTIMATE.start_main_#t~ite10#1|) .cse22 .cse11))) (+ (select .cse24 .cse6) (select .cse24 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse24 .cse4) (select .cse24 .cse5))))) (or (= .cse23 0) (= .cse23 1) (< .cse13 2147483648))))))))) (or (and (forall ((v_z_39 Int)) (or (< 4294967295 v_z_39) (< v_z_39 0) (= v_z_39 4294967295) (forall ((v_y_39 Int)) (let ((.cse25 (let ((.cse27 (store (store .cse7 (+ (* v_z_39 17179869188) (* 17179869184 v_y_39) 8 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~num~0#1|) (+ (* v_y_39 51539607552) (* v_z_39 51539607540) |c_ULTIMATE.start_main_~#array~0#1.offset|) .cse11))) (+ (select .cse27 .cse4) (select .cse27 |c_ULTIMATE.start_main_~#array~0#1.offset|) (select .cse27 .cse6) |c_ULTIMATE.start_main_~sum~0#1| (select .cse27 .cse5)))) (.cse26 (+ (* v_z_39 4294967295) (* v_y_39 4294967296)))) (or (= .cse25 0) (< .cse26 0) (= .cse25 1) (< 1 .cse26)))))) (forall ((v_z_39 Int)) (or (< 4294967295 v_z_39) (< v_z_39 0) (forall ((v_y_39 Int)) (let ((.cse32 (* 17179869184 v_y_39)) (.cse33 (* v_y_39 51539607552))) (let ((.cse28 (let ((.cse34 (store (store .cse7 (+ (* v_z_39 17179869188) .cse32 8 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse33 (* v_z_39 51539607540) |c_ULTIMATE.start_main_~#array~0#1.offset|) .cse11))) (+ (select .cse34 .cse4) (select .cse34 |c_ULTIMATE.start_main_~#array~0#1.offset|) (select .cse34 .cse6) |c_ULTIMATE.start_main_~sum~0#1| (select .cse34 .cse5)))) (.cse30 (let ((.cse31 (store (store .cse7 (+ .cse32 |c_ULTIMATE.start_main_~#array~0#1.offset| 73786976260478468100) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse33 |c_ULTIMATE.start_main_~#array~0#1.offset| 221360928781435404300) .cse11))) (+ (select .cse31 .cse4) (select .cse31 .cse5) |c_ULTIMATE.start_main_~sum~0#1| (select .cse31 .cse6) (select .cse31 |c_ULTIMATE.start_main_~#array~0#1.offset|)))) (.cse29 (+ (* v_z_39 4294967295) (* v_y_39 4294967296)))) (or (= .cse28 0) (< .cse29 0) (= .cse28 1) (= .cse30 0) (= .cse30 1) (< 1 .cse29))))))) (let ((.cse35 (+ .cse36 |c_ULTIMATE.start_main_~sum~0#1| .cse37 |c_ULTIMATE.start_main_~num~0#1| .cse11))) (or (= .cse35 1) (= .cse35 0))) (forall ((v_z_39 Int)) (or (< 4294967295 v_z_39) (< v_z_39 0) (= v_z_39 4294967295) (forall ((v_y_39 Int)) (let ((.cse41 (* 17179869184 v_y_39)) (.cse42 (* v_y_39 51539607552))) (let ((.cse38 (let ((.cse43 (store (store .cse7 (+ (* v_z_39 17179869188) .cse41 8 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse42 (* v_z_39 51539607540) |c_ULTIMATE.start_main_~#array~0#1.offset|) .cse11))) (+ (select .cse43 .cse4) (select .cse43 |c_ULTIMATE.start_main_~#array~0#1.offset|) (select .cse43 .cse6) |c_ULTIMATE.start_main_~sum~0#1| (select .cse43 .cse5)))) (.cse39 (+ (* v_z_39 4294967295) (* v_y_39 4294967296)))) (or (= .cse38 0) (< .cse39 0) (= .cse38 1) (= (let ((.cse40 (store (store .cse7 (+ .cse41 |c_ULTIMATE.start_main_~#array~0#1.offset| 73786976260478468100) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse42 |c_ULTIMATE.start_main_~#array~0#1.offset| 221360928781435404300) .cse11))) (+ (select .cse40 .cse4) (select .cse40 .cse5) |c_ULTIMATE.start_main_~sum~0#1| (select .cse40 .cse6) (select .cse40 |c_ULTIMATE.start_main_~#array~0#1.offset|))) 1) (< 1 .cse39)))))))) .cse0) (or .cse0 (and (let ((.cse44 (+ |c_ULTIMATE.start_main_~sum~0#1| (select .cse45 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~num~0#1| .cse11 (select .cse45 .cse5)))) (or (= 0 .cse44) (= 1 .cse44))) (forall ((v_z_39 Int)) (or (< 4294967295 v_z_39) (< v_z_39 0) (= v_z_39 4294967295) (forall ((v_y_39 Int)) (let ((.cse46 (let ((.cse48 (store (store .cse45 (+ (* v_z_39 17179869188) (* 17179869184 v_y_39) 8 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~num~0#1|) (+ (* v_y_39 51539607552) (* v_z_39 51539607540) |c_ULTIMATE.start_main_~#array~0#1.offset|) .cse11))) (+ (select .cse48 .cse4) |c_ULTIMATE.start_main_~sum~0#1| (select .cse48 .cse5) (select .cse48 .cse6) (select .cse48 |c_ULTIMATE.start_main_~#array~0#1.offset|)))) (.cse47 (+ (* v_z_39 4294967295) (* v_y_39 4294967296)))) (or (= .cse46 1) (< .cse47 0) (= .cse46 0) (< 1 .cse47)))))) (forall ((v_z_39 Int)) (or (< 4294967295 v_z_39) (< v_z_39 0) (forall ((v_y_39 Int)) (let ((.cse52 (* 17179869184 v_y_39)) (.cse53 (* v_y_39 51539607552))) (let ((.cse49 (let ((.cse54 (store (store .cse45 (+ (* v_z_39 17179869188) .cse52 8 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse53 (* v_z_39 51539607540) |c_ULTIMATE.start_main_~#array~0#1.offset|) .cse11))) (+ (select .cse54 .cse4) |c_ULTIMATE.start_main_~sum~0#1| (select .cse54 .cse5) (select .cse54 .cse6) (select .cse54 |c_ULTIMATE.start_main_~#array~0#1.offset|)))) (.cse50 (+ (* v_z_39 4294967295) (* v_y_39 4294967296)))) (or (= .cse49 1) (< .cse50 0) (= .cse49 0) (= (let ((.cse51 (store (store .cse45 (+ .cse52 |c_ULTIMATE.start_main_~#array~0#1.offset| 73786976260478468100) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse53 |c_ULTIMATE.start_main_~#array~0#1.offset| 221360928781435404300) .cse11))) (+ |c_ULTIMATE.start_main_~sum~0#1| (select .cse51 .cse6) (select .cse51 .cse5) (select .cse51 .cse4) (select .cse51 |c_ULTIMATE.start_main_~#array~0#1.offset|))) 1) (< 1 .cse50))))) (= v_z_39 4294967295))) (forall ((v_z_39 Int)) (or (< 4294967295 v_z_39) (< v_z_39 0) (forall ((v_y_39 Int)) (let ((.cse59 (* 17179869184 v_y_39)) (.cse60 (* v_y_39 51539607552))) (let ((.cse55 (let ((.cse61 (store (store .cse45 (+ (* v_z_39 17179869188) .cse59 8 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse60 (* v_z_39 51539607540) |c_ULTIMATE.start_main_~#array~0#1.offset|) .cse11))) (+ (select .cse61 .cse4) |c_ULTIMATE.start_main_~sum~0#1| (select .cse61 .cse5) (select .cse61 .cse6) (select .cse61 |c_ULTIMATE.start_main_~#array~0#1.offset|)))) (.cse56 (let ((.cse58 (store (store .cse45 (+ .cse59 |c_ULTIMATE.start_main_~#array~0#1.offset| 73786976260478468100) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse60 |c_ULTIMATE.start_main_~#array~0#1.offset| 221360928781435404300) .cse11))) (+ |c_ULTIMATE.start_main_~sum~0#1| (select .cse58 .cse6) (select .cse58 .cse5) (select .cse58 .cse4) (select .cse58 |c_ULTIMATE.start_main_~#array~0#1.offset|)))) (.cse57 (+ (* v_z_39 4294967295) (* v_y_39 4294967296)))) (or (= .cse55 1) (= .cse56 0) (< .cse57 0) (= .cse55 0) (= .cse56 1) (< 1 .cse57)))))))) (< 1 |c_ULTIMATE.start_main_~column~0#1|)) (or .cse0 (and (let ((.cse62 (+ |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_~num~0#1| .cse11))) (or (= .cse62 1) (= .cse62 0))) (= |c_ULTIMATE.start_main_~row~0#1| 0))) (or .cse0 (and (let ((.cse63 (let ((.cse64 (store .cse7 .cse10 |c_ULTIMATE.start_main_#t~ite12#1|))) (+ (select .cse64 .cse4) |c_ULTIMATE.start_main_~sum~0#1| (select .cse64 .cse5) (select .cse64 |c_ULTIMATE.start_main_~#array~0#1.offset|) (select .cse64 .cse6))))) (or .cse1 (= .cse63 1) (= .cse63 0))) (or .cse12 (and (let ((.cse65 (let ((.cse66 (store .cse7 .cse22 |c_ULTIMATE.start_main_#t~ite12#1|))) (+ (select .cse66 .cse5) (select .cse66 .cse4) (select .cse66 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse66 .cse6))))) (or .cse19 (= .cse65 0) (= .cse65 1))) (let ((.cse67 (let ((.cse68 (store .cse7 .cse18 |c_ULTIMATE.start_main_#t~ite12#1|))) (+ (select .cse68 .cse6) (select .cse68 .cse4) |c_ULTIMATE.start_main_~sum~0#1| (select .cse68 .cse5) (select .cse68 |c_ULTIMATE.start_main_~#array~0#1.offset|))))) (or .cse14 (= .cse67 0) (= .cse67 1))))))) (let ((.cse69 (+ .cse72 .cse73 |c_ULTIMATE.start_main_~sum~0#1| .cse74 .cse75))) (or (= .cse69 0) .cse70 (= .cse69 1) .cse71)) (<= c_~ARR_SIZE~0 32767) (let ((.cse76 (+ .cse36 |c_ULTIMATE.start_main_~sum~0#1| (select .cse7 .cse4) .cse37 (select .cse7 .cse6)))) (or (= .cse76 0) (= .cse76 1) .cse0)) (or (let ((.cse80 (store (store .cse7 .cse95 0) .cse96 0))) (and (forall ((v_z_39 Int)) (or (< 4294967295 v_z_39) (< v_z_39 0) (= v_z_39 4294967295) (forall ((v_y_39 Int)) (let ((.cse77 (+ (* v_z_39 4294967295) (* v_y_39 4294967296))) (.cse78 (let ((.cse79 (store (store .cse80 (+ (* v_z_39 17179869188) (* 17179869184 v_y_39) 8 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~num~0#1|) (+ (* v_y_39 51539607552) (* v_z_39 51539607540) |c_ULTIMATE.start_main_~#array~0#1.offset|) .cse11))) (+ (select .cse79 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse79 .cse6) (select .cse79 .cse4) (select .cse79 .cse5))))) (or (< .cse77 0) (= .cse78 1) (< 1 .cse77) (= .cse78 0)))))) (forall ((v_z_39 Int)) (or (< 4294967295 v_z_39) (< v_z_39 0) (forall ((v_y_39 Int)) (let ((.cse85 (* 17179869184 v_y_39)) (.cse86 (* v_y_39 51539607552))) (let ((.cse83 (let ((.cse87 (store (store .cse80 (+ .cse85 |c_ULTIMATE.start_main_~#array~0#1.offset| 73786976260478468100) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse86 |c_ULTIMATE.start_main_~#array~0#1.offset| 221360928781435404300) .cse11))) (+ (select .cse87 .cse6) (select .cse87 .cse4) |c_ULTIMATE.start_main_~sum~0#1| (select .cse87 |c_ULTIMATE.start_main_~#array~0#1.offset|) (select .cse87 .cse5)))) (.cse81 (+ (* v_z_39 4294967295) (* v_y_39 4294967296))) (.cse82 (let ((.cse84 (store (store .cse80 (+ (* v_z_39 17179869188) .cse85 8 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse86 (* v_z_39 51539607540) |c_ULTIMATE.start_main_~#array~0#1.offset|) .cse11))) (+ (select .cse84 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse84 .cse6) (select .cse84 .cse4) (select .cse84 .cse5))))) (or (< .cse81 0) (= .cse82 1) (= .cse83 0) (= .cse83 1) (< 1 .cse81) (= .cse82 0))))))) (let ((.cse88 (+ (select .cse80 |c_ULTIMATE.start_main_~#array~0#1.offset|) (select .cse80 .cse5) |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_~num~0#1| .cse11))) (or (= .cse88 0) (= .cse88 1))) (forall ((v_z_39 Int)) (or (< 4294967295 v_z_39) (< v_z_39 0) (= v_z_39 4294967295) (forall ((v_y_39 Int)) (let ((.cse92 (* 17179869184 v_y_39)) (.cse93 (* v_y_39 51539607552))) (let ((.cse89 (+ (* v_z_39 4294967295) (* v_y_39 4294967296))) (.cse90 (let ((.cse94 (store (store .cse80 (+ (* v_z_39 17179869188) .cse92 8 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse93 (* v_z_39 51539607540) |c_ULTIMATE.start_main_~#array~0#1.offset|) .cse11))) (+ (select .cse94 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse94 .cse6) (select .cse94 .cse4) (select .cse94 .cse5))))) (or (< .cse89 0) (= .cse90 1) (= (let ((.cse91 (store (store .cse80 (+ .cse92 |c_ULTIMATE.start_main_~#array~0#1.offset| 73786976260478468100) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse93 |c_ULTIMATE.start_main_~#array~0#1.offset| 221360928781435404300) .cse11))) (+ (select .cse91 .cse6) (select .cse91 .cse4) |c_ULTIMATE.start_main_~sum~0#1| (select .cse91 |c_ULTIMATE.start_main_~#array~0#1.offset|) (select .cse91 .cse5))) 1) (< 1 .cse89) (= .cse90 0))))))))) .cse0) (let ((.cse97 (+ .cse73 |c_ULTIMATE.start_main_~sum~0#1| .cse75))) (or (= .cse97 1) .cse70 (= .cse97 0) .cse71)) (or (let ((.cse99 (store .cse7 .cse116 0))) (and (forall ((v_z_39 Int)) (or (< 4294967295 v_z_39) (< v_z_39 0) (= v_z_39 4294967295) (forall ((v_y_39 Int)) (let ((.cse100 (* 17179869184 v_y_39)) (.cse101 (* v_y_39 51539607552))) (let ((.cse103 (let ((.cse104 (store (store .cse99 (+ (* v_z_39 17179869188) .cse100 8 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse101 (* v_z_39 51539607540) |c_ULTIMATE.start_main_~#array~0#1.offset|) .cse11))) (+ (select .cse104 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse104 .cse4) (select .cse104 .cse6) (select .cse104 .cse5)))) (.cse102 (+ (* v_z_39 4294967295) (* v_y_39 4294967296)))) (or (= (let ((.cse98 (store (store .cse99 (+ .cse100 |c_ULTIMATE.start_main_~#array~0#1.offset| 73786976260478468100) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse101 |c_ULTIMATE.start_main_~#array~0#1.offset| 221360928781435404300) .cse11))) (+ |c_ULTIMATE.start_main_~sum~0#1| (select .cse98 .cse6) (select .cse98 .cse5) (select .cse98 |c_ULTIMATE.start_main_~#array~0#1.offset|) (select .cse98 .cse4))) 1) (< .cse102 0) (= .cse103 0) (= .cse103 1) (< 1 .cse102))))))) (forall ((v_z_39 Int)) (or (< 4294967295 v_z_39) (< v_z_39 0) (forall ((v_y_39 Int)) (let ((.cse109 (* 17179869184 v_y_39)) (.cse110 (* v_y_39 51539607552))) (let ((.cse107 (let ((.cse111 (store (store .cse99 (+ (* v_z_39 17179869188) .cse109 8 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse110 (* v_z_39 51539607540) |c_ULTIMATE.start_main_~#array~0#1.offset|) .cse11))) (+ (select .cse111 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse111 .cse4) (select .cse111 .cse6) (select .cse111 .cse5)))) (.cse106 (+ (* v_z_39 4294967295) (* v_y_39 4294967296))) (.cse105 (let ((.cse108 (store (store .cse99 (+ .cse109 |c_ULTIMATE.start_main_~#array~0#1.offset| 73786976260478468100) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse110 |c_ULTIMATE.start_main_~#array~0#1.offset| 221360928781435404300) .cse11))) (+ |c_ULTIMATE.start_main_~sum~0#1| (select .cse108 .cse6) (select .cse108 .cse5) (select .cse108 |c_ULTIMATE.start_main_~#array~0#1.offset|) (select .cse108 .cse4))))) (or (= .cse105 1) (< .cse106 0) (= .cse107 0) (= .cse107 1) (< 1 .cse106) (= .cse105 0))))))) (let ((.cse112 (+ (select .cse99 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse99 .cse5) |c_ULTIMATE.start_main_~num~0#1| .cse11))) (or (= .cse112 1) (= .cse112 0))) (forall ((v_z_39 Int)) (or (< 4294967295 v_z_39) (< v_z_39 0) (= v_z_39 4294967295) (forall ((v_y_39 Int)) (let ((.cse114 (let ((.cse115 (store (store .cse99 (+ (* v_z_39 17179869188) (* 17179869184 v_y_39) 8 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~num~0#1|) (+ (* v_y_39 51539607552) (* v_z_39 51539607540) |c_ULTIMATE.start_main_~#array~0#1.offset|) .cse11))) (+ (select .cse115 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse115 .cse4) (select .cse115 .cse6) (select .cse115 .cse5)))) (.cse113 (+ (* v_z_39 4294967295) (* v_y_39 4294967296)))) (or (< .cse113 0) (= .cse114 0) (= .cse114 1) (< 1 .cse113)))))))) .cse0 .cse117) (or (and (let ((.cse118 (let ((.cse119 (store .cse7 .cse10 .cse11))) (+ (select .cse119 .cse5) (select .cse119 .cse4) (select .cse119 .cse6) |c_ULTIMATE.start_main_~sum~0#1| (select .cse119 |c_ULTIMATE.start_main_~#array~0#1.offset|))))) (or (= .cse118 1) .cse1 (= .cse118 0))) (or .cse12 (and (let ((.cse120 (let ((.cse121 (store .cse7 .cse18 .cse11))) (+ (select .cse121 .cse6) (select .cse121 .cse4) (select .cse121 .cse5) |c_ULTIMATE.start_main_~sum~0#1| (select .cse121 |c_ULTIMATE.start_main_~#array~0#1.offset|))))) (or .cse14 (= .cse120 0) (= .cse120 1))) (let ((.cse122 (let ((.cse123 (store .cse7 .cse22 .cse11))) (+ (select .cse123 .cse4) |c_ULTIMATE.start_main_~sum~0#1| (select .cse123 .cse6) (select .cse123 .cse5) (select .cse123 |c_ULTIMATE.start_main_~#array~0#1.offset|))))) (or (= .cse122 1) .cse19 (= .cse122 0)))))) .cse0) (let ((.cse124 (+ .cse73 .cse125 |c_ULTIMATE.start_main_~sum~0#1| .cse75))) (or .cse70 .cse71 (= .cse124 0) (= .cse124 1))) (or (not (= |c_ULTIMATE.start_main_~column~0#1| 0)) .cse126 .cse0) (or .cse0 (not (= |c_assume_abort_if_not_#in~cond| 0))) (or .cse126 .cse0 (not (= |c_ULTIMATE.start_main_~column~0#1| 1))) (let ((.cse127 (+ .cse73 .cse128 |c_ULTIMATE.start_main_~sum~0#1| .cse75))) (or (= .cse127 0) (= .cse127 1) .cse70 .cse71)) (or (let ((.cse132 (store (store .cse7 (+ .cse147 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0) .cse148 0))) (and (forall ((v_z_39 Int)) (or (< 4294967295 v_z_39) (< v_z_39 0) (= v_z_39 4294967295) (forall ((v_y_39 Int)) (let ((.cse130 (let ((.cse131 (store (store .cse132 (+ (* v_z_39 17179869188) (* 17179869184 v_y_39) 8 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~num~0#1|) (+ (* v_y_39 51539607552) (* v_z_39 51539607540) |c_ULTIMATE.start_main_~#array~0#1.offset|) .cse11))) (+ (select .cse131 .cse4) (select .cse131 .cse5) (select .cse131 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse131 .cse6)))) (.cse129 (+ (* v_z_39 4294967295) (* v_y_39 4294967296)))) (or (< .cse129 0) (= .cse130 0) (= .cse130 1) (< 1 .cse129)))))) (let ((.cse133 (+ (select .cse132 |c_ULTIMATE.start_main_~#array~0#1.offset|) (select .cse132 .cse5) |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_~num~0#1| .cse11))) (or (= .cse133 1) (= .cse133 0))) (forall ((v_z_39 Int)) (or (< 4294967295 v_z_39) (< v_z_39 0) (= v_z_39 4294967295) (forall ((v_y_39 Int)) (let ((.cse137 (* 17179869184 v_y_39)) (.cse138 (* v_y_39 51539607552))) (let ((.cse135 (let ((.cse139 (store (store .cse132 (+ (* v_z_39 17179869188) .cse137 8 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse138 (* v_z_39 51539607540) |c_ULTIMATE.start_main_~#array~0#1.offset|) .cse11))) (+ (select .cse139 .cse4) (select .cse139 .cse5) (select .cse139 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse139 .cse6)))) (.cse134 (+ (* v_z_39 4294967295) (* v_y_39 4294967296)))) (or (< .cse134 0) (= .cse135 0) (= (let ((.cse136 (store (store .cse132 (+ .cse137 |c_ULTIMATE.start_main_~#array~0#1.offset| 73786976260478468100) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse138 |c_ULTIMATE.start_main_~#array~0#1.offset| 221360928781435404300) .cse11))) (+ (select .cse136 .cse5) |c_ULTIMATE.start_main_~sum~0#1| (select .cse136 .cse6) (select .cse136 .cse4) (select .cse136 |c_ULTIMATE.start_main_~#array~0#1.offset|))) 1) (= .cse135 1) (< 1 .cse134))))))) (forall ((v_z_39 Int)) (or (< 4294967295 v_z_39) (< v_z_39 0) (forall ((v_y_39 Int)) (let ((.cse144 (* 17179869184 v_y_39)) (.cse145 (* v_y_39 51539607552))) (let ((.cse140 (let ((.cse146 (store (store .cse132 (+ .cse144 |c_ULTIMATE.start_main_~#array~0#1.offset| 73786976260478468100) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse145 |c_ULTIMATE.start_main_~#array~0#1.offset| 221360928781435404300) .cse11))) (+ (select .cse146 .cse5) |c_ULTIMATE.start_main_~sum~0#1| (select .cse146 .cse6) (select .cse146 .cse4) (select .cse146 |c_ULTIMATE.start_main_~#array~0#1.offset|)))) (.cse142 (let ((.cse143 (store (store .cse132 (+ (* v_z_39 17179869188) .cse144 8 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse145 (* v_z_39 51539607540) |c_ULTIMATE.start_main_~#array~0#1.offset|) .cse11))) (+ (select .cse143 .cse4) (select .cse143 .cse5) (select .cse143 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse143 .cse6)))) (.cse141 (+ (* v_z_39 4294967295) (* v_y_39 4294967296)))) (or (= .cse140 0) (< .cse141 0) (= .cse142 0) (= .cse140 1) (= .cse142 1) (< 1 .cse141))))))))) .cse0) (or (let ((.cse150 (store .cse45 .cse116 0))) (and (let ((.cse149 (+ (select .cse150 .cse5) |c_ULTIMATE.start_main_~sum~0#1| (select .cse150 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~num~0#1| .cse11))) (or (= .cse149 1) (= .cse149 0))) (forall ((v_z_39 Int)) (or (< 4294967295 v_z_39) (< v_z_39 0) (= v_z_39 4294967295) (forall ((v_y_39 Int)) (let ((.cse154 (* 17179869184 v_y_39)) (.cse155 (* v_y_39 51539607552))) (let ((.cse152 (let ((.cse156 (store (store .cse150 (+ (* v_z_39 17179869188) .cse154 8 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse155 (* v_z_39 51539607540) |c_ULTIMATE.start_main_~#array~0#1.offset|) .cse11))) (+ (select .cse156 .cse5) |c_ULTIMATE.start_main_~sum~0#1| (select .cse156 .cse6) (select .cse156 |c_ULTIMATE.start_main_~#array~0#1.offset|) (select .cse156 .cse4)))) (.cse151 (+ (* v_z_39 4294967295) (* v_y_39 4294967296)))) (or (< .cse151 0) (= .cse152 1) (= .cse152 0) (= (let ((.cse153 (store (store .cse150 (+ .cse154 |c_ULTIMATE.start_main_~#array~0#1.offset| 73786976260478468100) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse155 |c_ULTIMATE.start_main_~#array~0#1.offset| 221360928781435404300) .cse11))) (+ |c_ULTIMATE.start_main_~sum~0#1| (select .cse153 .cse4) (select .cse153 .cse6) (select .cse153 |c_ULTIMATE.start_main_~#array~0#1.offset|) (select .cse153 .cse5))) 1) (< 1 .cse151))))))) (forall ((v_z_39 Int)) (or (< 4294967295 v_z_39) (< v_z_39 0) (forall ((v_y_39 Int)) (let ((.cse161 (* 17179869184 v_y_39)) (.cse162 (* v_y_39 51539607552))) (let ((.cse158 (let ((.cse163 (store (store .cse150 (+ (* v_z_39 17179869188) .cse161 8 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse162 (* v_z_39 51539607540) |c_ULTIMATE.start_main_~#array~0#1.offset|) .cse11))) (+ (select .cse163 .cse5) |c_ULTIMATE.start_main_~sum~0#1| (select .cse163 .cse6) (select .cse163 |c_ULTIMATE.start_main_~#array~0#1.offset|) (select .cse163 .cse4)))) (.cse159 (let ((.cse160 (store (store .cse150 (+ .cse161 |c_ULTIMATE.start_main_~#array~0#1.offset| 73786976260478468100) |c_ULTIMATE.start_main_~num~0#1|) (+ .cse162 |c_ULTIMATE.start_main_~#array~0#1.offset| 221360928781435404300) .cse11))) (+ |c_ULTIMATE.start_main_~sum~0#1| (select .cse160 .cse4) (select .cse160 .cse6) (select .cse160 |c_ULTIMATE.start_main_~#array~0#1.offset|) (select .cse160 .cse5)))) (.cse157 (+ (* v_z_39 4294967295) (* v_y_39 4294967296)))) (or (< .cse157 0) (= .cse158 1) (= .cse159 0) (= .cse158 0) (= .cse159 1) (< 1 .cse157))))))) (forall ((v_z_39 Int)) (or (< 4294967295 v_z_39) (< v_z_39 0) (= v_z_39 4294967295) (forall ((v_y_39 Int)) (let ((.cse165 (let ((.cse166 (store (store .cse150 (+ (* v_z_39 17179869188) (* 17179869184 v_y_39) 8 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~num~0#1|) (+ (* v_y_39 51539607552) (* v_z_39 51539607540) |c_ULTIMATE.start_main_~#array~0#1.offset|) .cse11))) (+ (select .cse166 .cse5) |c_ULTIMATE.start_main_~sum~0#1| (select .cse166 .cse6) (select .cse166 |c_ULTIMATE.start_main_~#array~0#1.offset|) (select .cse166 .cse4)))) (.cse164 (+ (* v_z_39 4294967295) (* v_y_39 4294967296)))) (or (< .cse164 0) (= .cse165 1) (= .cse165 0) (< 1 .cse164)))))))) .cse0 .cse117) (let ((.cse167 (+ .cse72 |c_ULTIMATE.start_main_~sum~0#1| .cse74))) (or (= .cse167 1) .cse70 (not (= c_~ARR_SIZE~0 .cse168)) (= .cse167 0))) (or (let ((.cse173 (mod (+ (* 4294967295 |c_ULTIMATE.start_main_~index2~0#1|) 1) 4294967296))) (let ((.cse171 (* 8 .cse173)) (.cse172 (* .cse179 12))) (and (let ((.cse169 (let ((.cse170 (store (store .cse7 (+ (- 17179869184) .cse171 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9) |c_ULTIMATE.start_main_~num~0#1|) (+ (- 17179869184) .cse172 |c_ULTIMATE.start_main_~#array~0#1.offset|) .cse11))) (+ |c_ULTIMATE.start_main_~sum~0#1| (select .cse170 |c_ULTIMATE.start_main_~#array~0#1.offset|) (select .cse170 .cse6) (select .cse170 .cse4) (select .cse170 .cse5))))) (or .cse1 (= .cse169 0) (= .cse169 1))) (or .cse12 (let ((.cse176 (+ .cse172 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (and (let ((.cse174 (let ((.cse175 (store (store .cse7 (+ .cse171 |c_ULTIMATE.start_main_~#array~0#1.offset| (- 34359738368) .cse9) |c_ULTIMATE.start_main_~num~0#1|) .cse176 .cse11))) (+ (select .cse175 |c_ULTIMATE.start_main_~#array~0#1.offset|) (select .cse175 .cse4) |c_ULTIMATE.start_main_~sum~0#1| (select .cse175 .cse6) (select .cse175 .cse5))))) (or (< .cse173 2147483648) (= .cse174 1) (= .cse174 0))) (let ((.cse177 (let ((.cse178 (store (store .cse7 (+ .cse171 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse9) |c_ULTIMATE.start_main_~num~0#1|) .cse176 .cse11))) (+ (select .cse178 .cse6) |c_ULTIMATE.start_main_~sum~0#1| (select .cse178 |c_ULTIMATE.start_main_~#array~0#1.offset|) (select .cse178 .cse4) (select .cse178 .cse5))))) (or (= .cse177 0) (= .cse177 1) (< 2147483647 .cse173))))))))) .cse0) (let ((.cse180 (+ .cse73 .cse128 .cse125 |c_ULTIMATE.start_main_~sum~0#1| .cse75))) (or (= .cse180 0) (= .cse180 1) .cse70 .cse71)))))) is different from true [2024-11-21 21:00:55,057 WARN L286 SmtUtils]: Spent 5.23s on a formula simplification. DAG size of input: 374 DAG size of output: 165 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)