./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/mono-crafted_10.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 8c5f43b3e9ff1d4598a5a525fe9e716f863331c4c517b4b8adb0491943243286 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 14:11:53,492 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 14:11:53,564 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 14:11:53,569 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 14:11:53,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 14:11:53,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 14:11:53,605 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 14:11:53,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 14:11:53,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 14:11:53,607 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 14:11:53,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 14:11:53,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 14:11:53,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 14:11:53,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 14:11:53,611 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 14:11:53,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 14:11:53,612 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 14:11:53,612 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 14:11:53,613 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 14:11:53,613 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 14:11:53,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 14:11:53,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 14:11:53,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 14:11:53,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 14:11:53,616 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 14:11:53,617 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 14:11:53,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 14:11:53,617 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 14:11:53,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 14:11:53,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 14:11:53,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 14:11:53,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 14:11:53,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:11:53,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 14:11:53,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 14:11:53,620 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 14:11:53,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 14:11:53,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 14:11:53,621 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 14:11:53,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 14:11:53,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 14:11:53,622 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 14:11:53,623 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 -> 8c5f43b3e9ff1d4598a5a525fe9e716f863331c4c517b4b8adb0491943243286 [2024-11-08 14:11:53,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 14:11:53,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 14:11:53,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 14:11:53,926 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 14:11:53,927 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 14:11:53,928 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c [2024-11-08 14:11:55,325 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 14:11:55,502 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 14:11:55,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c [2024-11-08 14:11:55,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44299ebc7/625d753aad6e45c590379fd8204139e3/FLAG8aa4ab1ee [2024-11-08 14:11:55,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44299ebc7/625d753aad6e45c590379fd8204139e3 [2024-11-08 14:11:55,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 14:11:55,903 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 14:11:55,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 14:11:55,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 14:11:55,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 14:11:55,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:11:55" (1/1) ... [2024-11-08 14:11:55,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@93e5025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:11:55, skipping insertion in model container [2024-11-08 14:11:55,911 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:11:55" (1/1) ... [2024-11-08 14:11:55,925 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 14:11:56,083 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/loops-crafted-1/mono-crafted_10.c[319,332] [2024-11-08 14:11:56,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:11:56,100 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 14:11:56,110 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/loops-crafted-1/mono-crafted_10.c[319,332] [2024-11-08 14:11:56,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:11:56,126 INFO L204 MainTranslator]: Completed translation [2024-11-08 14:11:56,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:11:56 WrapperNode [2024-11-08 14:11:56,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 14:11:56,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 14:11:56,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 14:11:56,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 14:11:56,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:11:56" (1/1) ... [2024-11-08 14:11:56,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:11:56" (1/1) ... [2024-11-08 14:11:56,152 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 30 [2024-11-08 14:11:56,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 14:11:56,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 14:11:56,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 14:11:56,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 14:11:56,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:11:56" (1/1) ... [2024-11-08 14:11:56,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:11:56" (1/1) ... [2024-11-08 14:11:56,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:11:56" (1/1) ... [2024-11-08 14:11:56,171 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 14:11:56,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:11:56" (1/1) ... [2024-11-08 14:11:56,171 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:11:56" (1/1) ... [2024-11-08 14:11:56,173 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:11:56" (1/1) ... [2024-11-08 14:11:56,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:11:56" (1/1) ... [2024-11-08 14:11:56,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:11:56" (1/1) ... [2024-11-08 14:11:56,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:11:56" (1/1) ... [2024-11-08 14:11:56,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 14:11:56,180 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 14:11:56,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 14:11:56,180 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 14:11:56,181 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:11:56" (1/1) ... [2024-11-08 14:11:56,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:11:56,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:11:56,209 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-08 14:11:56,211 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-08 14:11:56,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 14:11:56,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 14:11:56,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 14:11:56,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 14:11:56,333 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 14:11:56,335 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 14:11:56,437 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-08 14:11:56,437 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 14:11:56,453 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 14:11:56,454 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 14:11:56,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:11:56 BoogieIcfgContainer [2024-11-08 14:11:56,455 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 14:11:56,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 14:11:56,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 14:11:56,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 14:11:56,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 02:11:55" (1/3) ... [2024-11-08 14:11:56,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509539ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:11:56, skipping insertion in model container [2024-11-08 14:11:56,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:11:56" (2/3) ... [2024-11-08 14:11:56,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509539ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:11:56, skipping insertion in model container [2024-11-08 14:11:56,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:11:56" (3/3) ... [2024-11-08 14:11:56,463 INFO L112 eAbstractionObserver]: Analyzing ICFG mono-crafted_10.c [2024-11-08 14:11:56,478 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 14:11:56,479 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 14:11:56,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 14:11:56,539 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;@3c4f51f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 14:11:56,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 14:11:56,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:11:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 14:11:56,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:11:56,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 14:11:56,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:11:56,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:11:56,552 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2024-11-08 14:11:56,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:11:56,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884695891] [2024-11-08 14:11:56,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:11:56,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:11:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:11:56,694 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-08 14:11:56,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:11:56,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884695891] [2024-11-08 14:11:56,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884695891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:11:56,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:11:56,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 14:11:56,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134071227] [2024-11-08 14:11:56,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:11:56,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 14:11:56,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:11:56,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 14:11:56,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 14:11:56,732 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:11:56,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:11:56,745 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-11-08 14:11:56,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 14:11:56,750 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-08 14:11:56,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:11:56,755 INFO L225 Difference]: With dead ends: 21 [2024-11-08 14:11:56,756 INFO L226 Difference]: Without dead ends: 9 [2024-11-08 14:11:56,758 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-08 14:11:56,761 INFO L432 NwaCegarLoop]: 14 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, 14 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-08 14:11:56,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:11:56,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-08 14:11:56,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-08 14:11:56,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:11:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-11-08 14:11:56,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2024-11-08 14:11:56,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:11:56,784 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-08 14:11:56,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:11:56,785 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2024-11-08 14:11:56,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 14:11:56,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:11:56,785 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 14:11:56,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 14:11:56,785 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:11:56,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:11:56,786 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2024-11-08 14:11:56,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:11:56,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124805020] [2024-11-08 14:11:56,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:11:56,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:11:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:11:56,995 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-08 14:11:56,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:11:56,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124805020] [2024-11-08 14:11:56,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124805020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:11:56,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:11:56,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 14:11:56,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318091861] [2024-11-08 14:11:56,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:11:56,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 14:11:56,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:11:56,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 14:11:56,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 14:11:56,999 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:11:57,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:11:57,032 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2024-11-08 14:11:57,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 14:11:57,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-08 14:11:57,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:11:57,033 INFO L225 Difference]: With dead ends: 19 [2024-11-08 14:11:57,033 INFO L226 Difference]: Without dead ends: 12 [2024-11-08 14:11:57,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-08 14:11:57,035 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:11:57,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:11:57,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-08 14:11:57,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-11-08 14:11:57,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:11:57,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2024-11-08 14:11:57,040 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2024-11-08 14:11:57,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:11:57,040 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-08 14:11:57,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:11:57,044 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2024-11-08 14:11:57,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 14:11:57,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:11:57,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:11:57,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 14:11:57,048 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:11:57,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:11:57,049 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2024-11-08 14:11:57,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:11:57,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281741062] [2024-11-08 14:11:57,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:11:57,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:11:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:11:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:11:57,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:11:57,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281741062] [2024-11-08 14:11:57,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281741062] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:11:57,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60217074] [2024-11-08 14:11:57,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:11:57,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:11:57,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:11:57,334 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-08 14:11:57,336 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-08 14:11:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:11:57,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 14:11:57,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:11:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:11:57,428 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:11:57,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:11:57,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60217074] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:11:57,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:11:57,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 9 [2024-11-08 14:11:57,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383811972] [2024-11-08 14:11:57,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:11:57,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 14:11:57,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:11:57,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 14:11:57,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2024-11-08 14:11:57,523 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:11:57,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:11:57,615 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2024-11-08 14:11:57,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 14:11:57,616 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-08 14:11:57,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:11:57,617 INFO L225 Difference]: With dead ends: 26 [2024-11-08 14:11:57,617 INFO L226 Difference]: Without dead ends: 19 [2024-11-08 14:11:57,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:11:57,619 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 11 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:11:57,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 15 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:11:57,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-08 14:11:57,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-08 14:11:57,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:11:57,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-08 14:11:57,628 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 9 [2024-11-08 14:11:57,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:11:57,628 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-08 14:11:57,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:11:57,629 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-08 14:11:57,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 14:11:57,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:11:57,629 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-08 14:11:57,647 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-08 14:11:57,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:11:57,830 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:11:57,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:11:57,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1171899538, now seen corresponding path program 2 times [2024-11-08 14:11:57,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:11:57,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394252453] [2024-11-08 14:11:57,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:11:57,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:11:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:11:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:11:58,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:11:58,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394252453] [2024-11-08 14:11:58,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394252453] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:11:58,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810564336] [2024-11-08 14:11:58,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 14:11:58,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:11:58,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:11:58,130 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-08 14:11:58,132 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-08 14:11:58,173 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 14:11:58,173 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:11:58,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 14:11:58,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:11:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:11:58,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:11:58,428 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:11:58,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810564336] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:11:58,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:11:58,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2024-11-08 14:11:58,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349658520] [2024-11-08 14:11:58,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:11:58,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 14:11:58,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:11:58,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 14:11:58,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2024-11-08 14:11:58,435 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:11:58,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:11:58,812 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2024-11-08 14:11:58,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 14:11:58,813 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-08 14:11:58,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:11:58,814 INFO L225 Difference]: With dead ends: 46 [2024-11-08 14:11:58,814 INFO L226 Difference]: Without dead ends: 37 [2024-11-08 14:11:58,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2024-11-08 14:11:58,815 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:11:58,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 24 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:11:58,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-08 14:11:58,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-08 14:11:58,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:11:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-11-08 14:11:58,828 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 18 [2024-11-08 14:11:58,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:11:58,828 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-11-08 14:11:58,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:11:58,829 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-11-08 14:11:58,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 14:11:58,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:11:58,830 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2024-11-08 14:11:58,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 14:11:59,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 14:11:59,035 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:11:59,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:11:59,035 INFO L85 PathProgramCache]: Analyzing trace with hash -51731342, now seen corresponding path program 3 times [2024-11-08 14:11:59,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:11:59,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106654862] [2024-11-08 14:11:59,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:11:59,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:11:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:11:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:11:59,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:11:59,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106654862] [2024-11-08 14:11:59,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106654862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:11:59,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164655486] [2024-11-08 14:11:59,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 14:11:59,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:11:59,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:11:59,552 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-08 14:11:59,554 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-08 14:11:59,595 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-08 14:11:59,596 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:11:59,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 14:11:59,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:11:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-08 14:11:59,727 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:11:59,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164655486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:11:59,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 14:11:59,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2024-11-08 14:11:59,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308185816] [2024-11-08 14:11:59,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:11:59,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 14:11:59,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:11:59,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 14:11:59,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-08 14:11:59,729 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:11:59,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:11:59,790 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2024-11-08 14:11:59,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 14:11:59,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-08 14:11:59,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:11:59,792 INFO L225 Difference]: With dead ends: 63 [2024-11-08 14:11:59,793 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 14:11:59,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-11-08 14:11:59,794 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 5 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:11:59,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 15 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:11:59,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 14:11:59,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2024-11-08 14:11:59,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:11:59,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-11-08 14:11:59,807 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 36 [2024-11-08 14:11:59,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:11:59,808 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-11-08 14:11:59,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:11:59,811 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-11-08 14:11:59,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 14:11:59,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:11:59,812 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:11:59,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 14:12:00,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:12:00,013 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:12:00,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:12:00,013 INFO L85 PathProgramCache]: Analyzing trace with hash -108989644, now seen corresponding path program 1 times [2024-11-08 14:12:00,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:12:00,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139346466] [2024-11-08 14:12:00,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:12:00,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:12:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:12:00,268 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:12:00,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:12:00,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139346466] [2024-11-08 14:12:00,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139346466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:12:00,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943881156] [2024-11-08 14:12:00,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:12:00,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:12:00,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:12:00,272 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-08 14:12:00,273 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-08 14:12:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:12:00,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 14:12:00,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:12:00,388 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:12:00,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:12:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:12:00,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943881156] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:12:00,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:12:00,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 24 [2024-11-08 14:12:00,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511524911] [2024-11-08 14:12:00,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:12:00,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 14:12:00,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:12:00,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 14:12:00,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2024-11-08 14:12:00,889 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 24 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:12:03,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:12:03,477 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2024-11-08 14:12:03,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 14:12:03,478 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-08 14:12:03,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:12:03,479 INFO L225 Difference]: With dead ends: 88 [2024-11-08 14:12:03,479 INFO L226 Difference]: Without dead ends: 70 [2024-11-08 14:12:03,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=393, Invalid=663, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 14:12:03,481 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 14:12:03,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 37 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 14:12:03,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-08 14:12:03,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-08 14:12:03,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:12:03,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2024-11-08 14:12:03,492 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 36 [2024-11-08 14:12:03,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:12:03,492 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2024-11-08 14:12:03,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:12:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2024-11-08 14:12:03,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 14:12:03,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:12:03,494 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:12:03,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 14:12:03,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:12:03,699 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:12:03,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:12:03,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1647036101, now seen corresponding path program 2 times [2024-11-08 14:12:03,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:12:03,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129124803] [2024-11-08 14:12:03,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:12:03,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:12:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:12:04,258 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:12:04,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:12:04,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129124803] [2024-11-08 14:12:04,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129124803] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:12:04,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252232915] [2024-11-08 14:12:04,259 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 14:12:04,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:12:04,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:12:04,261 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-08 14:12:04,263 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-08 14:12:04,318 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 14:12:04,318 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:12:04,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-08 14:12:04,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:12:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:12:04,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:12:05,707 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:12:05,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252232915] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:12:05,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:12:05,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 47 [2024-11-08 14:12:05,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018867165] [2024-11-08 14:12:05,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:12:05,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-08 14:12:05,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:12:05,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-08 14:12:05,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=621, Invalid=1541, Unknown=0, NotChecked=0, Total=2162 [2024-11-08 14:12:05,713 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 47 states, 47 states have (on average 2.872340425531915) internal successors, (135), 47 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:12:47,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:12:47,847 INFO L93 Difference]: Finished difference Result 145 states and 169 transitions. [2024-11-08 14:12:47,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-08 14:12:47,847 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.872340425531915) internal successors, (135), 47 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-08 14:12:47,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:12:47,849 INFO L225 Difference]: With dead ends: 145 [2024-11-08 14:12:47,849 INFO L226 Difference]: Without dead ends: 136 [2024-11-08 14:12:47,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=1561, Invalid=2861, Unknown=0, NotChecked=0, Total=4422 [2024-11-08 14:12:47,851 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 45 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 14:12:47,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 73 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 14:12:47,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-08 14:12:47,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-08 14:12:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.0148148148148148) internal successors, (137), 135 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:12:47,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2024-11-08 14:12:47,868 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 69 [2024-11-08 14:12:47,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:12:47,869 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2024-11-08 14:12:47,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.872340425531915) internal successors, (135), 47 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:12:47,869 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2024-11-08 14:12:47,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 14:12:47,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:12:47,875 INFO L215 NwaCegarLoop]: trace histogram [43, 43, 42, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:12:47,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 14:12:48,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:12:48,075 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:12:48,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:12:48,076 INFO L85 PathProgramCache]: Analyzing trace with hash 420755547, now seen corresponding path program 3 times [2024-11-08 14:12:48,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:12:48,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047826292] [2024-11-08 14:12:48,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:12:48,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:12:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:12:49,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 85 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:12:49,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:12:49,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047826292] [2024-11-08 14:12:49,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047826292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:12:49,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451945975] [2024-11-08 14:12:49,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 14:12:49,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:12:49,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:12:49,806 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-08 14:12:49,807 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-08 14:12:49,864 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-08 14:12:49,864 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:12:49,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 14:12:49,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:12:50,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 208 proven. 2 refuted. 0 times theorem prover too weak. 2542 trivial. 0 not checked. [2024-11-08 14:12:50,219 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:12:51,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2542 trivial. 0 not checked. [2024-11-08 14:12:51,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451945975] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:12:51,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:12:51,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 7, 8] total 56 [2024-11-08 14:12:51,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010259003] [2024-11-08 14:12:51,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:12:51,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-08 14:12:51,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:12:51,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-08 14:12:51,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=2767, Unknown=0, NotChecked=0, Total=3080 [2024-11-08 14:12:51,006 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand has 56 states, 56 states have (on average 2.767857142857143) internal successors, (155), 56 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:12:54,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:12:54,319 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2024-11-08 14:12:54,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-11-08 14:12:54,320 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.767857142857143) internal successors, (155), 56 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2024-11-08 14:12:54,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:12:54,321 INFO L225 Difference]: With dead ends: 164 [2024-11-08 14:12:54,321 INFO L226 Difference]: Without dead ends: 155 [2024-11-08 14:12:54,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1267 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1133, Invalid=9373, Unknown=0, NotChecked=0, Total=10506 [2024-11-08 14:12:54,326 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 104 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5759 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 5811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 5759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:12:54,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 28 Invalid, 5811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 5759 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 14:12:54,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-08 14:12:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2024-11-08 14:12:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:12:54,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions. [2024-11-08 14:12:54,344 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 135 [2024-11-08 14:12:54,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:12:54,344 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions. [2024-11-08 14:12:54,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.767857142857143) internal successors, (155), 56 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:12:54,345 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2024-11-08 14:12:54,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 14:12:54,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:12:54,347 INFO L215 NwaCegarLoop]: trace histogram [49, 49, 44, 5, 1, 1, 1, 1, 1, 1] [2024-11-08 14:12:54,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 14:12:54,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:12:54,548 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:12:54,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:12:54,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1171799301, now seen corresponding path program 4 times [2024-11-08 14:12:54,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:12:54,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991516679] [2024-11-08 14:12:54,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:12:54,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:12:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:12:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 625 proven. 2926 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 14:12:56,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:12:56,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991516679] [2024-11-08 14:12:56,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991516679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:12:56,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859677524] [2024-11-08 14:12:56,203 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 14:12:56,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:12:56,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:12:56,205 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-08 14:12:56,206 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-08 14:12:56,290 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 14:12:56,290 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:12:56,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 103 conjuncts are in the unsatisfiable core [2024-11-08 14:12:56,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:12:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 625 proven. 2926 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 14:12:56,540 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:13:09,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:13:09,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859677524] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:13:09,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:13:09,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 48, 54] total 101 [2024-11-08 14:13:09,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202631256] [2024-11-08 14:13:09,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:13:09,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2024-11-08 14:13:09,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:13:09,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2024-11-08 14:13:09,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2410, Invalid=7690, Unknown=0, NotChecked=0, Total=10100 [2024-11-08 14:13:09,007 INFO L87 Difference]: Start difference. First operand 154 states and 158 transitions. Second operand has 101 states, 101 states have (on average 2.9207920792079207) internal successors, (295), 101 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:13:16,186 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse26 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296)) (.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296)) (.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296)) (.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296)) (.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296)) (.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296)) (.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296)) (.cse17 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296)) (.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296)) (.cse12 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296)) (.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296)) (.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296)) (.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296)) (.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296)) (.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296)) (.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296)) (.cse32 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296)) (.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296)) (.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296)) (.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296)) (.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296)) (.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296)) (.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296)) (.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296)) (.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296)) (.cse27 (< .cse26 5000000)) (.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296)) (.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296)) (.cse7 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296)) (.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296)) (.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296)) (.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296)) (.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296)) (.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296)) (.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296)) (.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296)) (.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296)) (.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296)) (.cse44 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296)) (.cse45 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296)) (.cse40 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (and (or (< .cse0 5000000) (< .cse1 (+ .cse0 1))) (or (< .cse2 5000000) (< .cse3 (+ 1 .cse2))) (or (< .cse4 (+ .cse5 1)) (< .cse5 5000000)) (or (< .cse6 5000000) (< .cse7 (+ .cse6 1))) (or (< .cse8 5000000) (< .cse9 (+ .cse8 1))) (or (< .cse10 5000000) (< .cse5 (+ .cse10 1))) (or (< .cse11 (+ .cse12 1)) (< .cse12 5000000)) (or (< .cse13 5000000) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296) (+ .cse13 1))) (or (< .cse14 5000000) (< .cse15 (+ .cse14 1))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< .cse16 5000000) (< .cse17 (+ .cse16 1)))) (or (< .cse18 (+ .cse9 1)) (< .cse9 5000000)) (or (< .cse19 5000000) (< .cse20 (+ 1 .cse19))) (or (< .cse21 (+ .cse22 1)) (< .cse22 5000000)) (or (< .cse0 (+ .cse11 1)) (< .cse11 5000000)) (or (< .cse15 5000000) (< .cse23 (+ .cse15 1))) (or (< .cse24 5000000) (< .cse25 (+ .cse24 1))) (or (< .cse19 (+ .cse26 1)) .cse27) (or (< .cse23 5000000) (< .cse8 (+ .cse23 1))) (or (< .cse17 5000000) (< .cse28 (+ .cse17 1))) (or (< .cse29 (+ .cse25 1)) (< .cse25 5000000)) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< .cse30 (+ .cse31 1)) (< .cse31 5000000))) (or (< .cse12 (+ .cse3 1)) (< .cse3 5000000)) (or (< .cse18 5000000) (< .cse32 (+ .cse18 1))) (or (< .cse33 (+ .cse4 1)) (< .cse4 5000000)) (or (< .cse34 (+ .cse33 1)) (< .cse33 5000000)) (or (< .cse30 5000000) (< .cse2 (+ .cse30 1))) (or (< .cse35 5000000) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296) (+ .cse35 1))) (or (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296) (+ .cse32 1)) (< .cse32 5000000)) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< .cse36 5000000) (< .cse37 (+ .cse36 1)))) (or (< .cse38 (+ .cse39 1)) (< .cse39 5000000)) (or (< .cse34 5000000) (< .cse35 (+ .cse34 1))) (or (< .cse40 (+ .cse41 1)) (< .cse41 5000000)) (or (< .cse13 (+ .cse29 1)) (< .cse29 5000000)) (or (< .cse21 5000000) (< .cse6 (+ .cse21 1))) (or (< .cse42 (+ .cse1 1)) (< .cse1 5000000)) (or (< .cse19 (mod |c_ULTIMATE.start_main_~y~0#1| 4294967296)) .cse27) (or (< .cse20 5000000) (< .cse39 (+ .cse20 1))) (or (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296) (+ .cse7 1)) (< .cse7 5000000)) (or (< .cse14 (+ .cse37 1)) (< .cse37 5000000)) (or (< .cse38 5000000) (< .cse22 (+ .cse38 1))) (or (< .cse42 5000000) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296) (+ .cse42 1))) (or (< .cse28 5000000) (< .cse10 (+ .cse28 1))) (let ((.cse43 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< .cse43 5000000) (< .cse44 (+ .cse43 1)))) (or (< .cse24 (+ .cse45 1)) (< .cse45 5000000)) (or (< .cse44 5000000) (< .cse41 (+ .cse44 1))) (or (< .cse40 5000000) (< .cse45 (+ .cse40 1)))))) is different from false [2024-11-08 14:13:20,210 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296)) (.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296)) (.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296)) (.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296)) (.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296)) (.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296)) (.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296)) (.cse17 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296)) (.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296)) (.cse12 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296)) (.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296)) (.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296)) (.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296)) (.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296)) (.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296)) (.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296)) (.cse30 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296)) (.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296)) (.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296)) (.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296)) (.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296)) (.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296)) (.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296)) (.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296)) (.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296)) (.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296)) (.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296)) (.cse7 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296)) (.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296)) (.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296)) (.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296)) (.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296)) (.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296)) (.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296)) (.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296)) (.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296)) (.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296)) (.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296)) (.cse43 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296)) (.cse38 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (and (or (< .cse0 5000000) (< .cse1 (+ .cse0 1))) (or (< .cse2 5000000) (< .cse3 (+ 1 .cse2))) (or (< .cse4 (+ .cse5 1)) (< .cse5 5000000)) (or (< .cse6 5000000) (< .cse7 (+ .cse6 1))) (or (< .cse8 5000000) (< .cse9 (+ .cse8 1))) (or (< .cse10 5000000) (< .cse5 (+ .cse10 1))) (or (< .cse11 (+ .cse12 1)) (< .cse12 5000000)) (or (< .cse13 5000000) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296) (+ .cse13 1))) (or (< .cse14 5000000) (< .cse15 (+ .cse14 1))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< .cse16 5000000) (< .cse17 (+ .cse16 1)))) (or (< .cse18 (+ .cse9 1)) (< .cse9 5000000)) (or (< .cse19 5000000) (< .cse20 (+ 1 .cse19))) (or (< .cse21 (+ .cse22 1)) (< .cse22 5000000)) (or (< .cse0 (+ .cse11 1)) (< .cse11 5000000)) (or (< .cse15 5000000) (< .cse23 (+ .cse15 1))) (or (< .cse24 5000000) (< .cse25 (+ .cse24 1))) (or (< .cse23 5000000) (< .cse8 (+ .cse23 1))) (or (< .cse17 5000000) (< .cse26 (+ .cse17 1))) (or (< .cse27 (+ .cse25 1)) (< .cse25 5000000)) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< .cse28 (+ .cse29 1)) (< .cse29 5000000))) (or (< .cse12 (+ .cse3 1)) (< .cse3 5000000)) (or (< .cse18 5000000) (< .cse30 (+ .cse18 1))) (or (< .cse31 (+ .cse4 1)) (< .cse4 5000000)) (or (< .cse32 (+ .cse31 1)) (< .cse31 5000000)) (or (< .cse28 5000000) (< .cse2 (+ .cse28 1))) (or (< .cse33 5000000) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296) (+ .cse33 1))) (or (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296) (+ .cse30 1)) (< .cse30 5000000)) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< .cse34 5000000) (< .cse35 (+ .cse34 1)))) (or (< .cse36 (+ .cse37 1)) (< .cse37 5000000)) (or (< .cse32 5000000) (< .cse33 (+ .cse32 1))) (or (< .cse38 (+ .cse39 1)) (< .cse39 5000000)) (or (< .cse13 (+ .cse27 1)) (< .cse27 5000000)) (or (< .cse21 5000000) (< .cse6 (+ .cse21 1))) (or (< .cse40 (+ .cse1 1)) (< .cse1 5000000)) (or (< .cse19 (mod |c_ULTIMATE.start_main_~y~0#1| 4294967296)) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 5000000)) (or (< .cse20 5000000) (< .cse37 (+ .cse20 1))) (or (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296) (+ .cse7 1)) (< .cse7 5000000)) (or (< .cse14 (+ .cse35 1)) (< .cse35 5000000)) (or (< .cse36 5000000) (< .cse22 (+ .cse36 1))) (or (< .cse40 5000000) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296) (+ .cse40 1))) (or (< .cse26 5000000) (< .cse10 (+ .cse26 1))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< .cse41 5000000) (< .cse42 (+ .cse41 1)))) (or (< .cse24 (+ .cse43 1)) (< .cse43 5000000)) (or (< .cse42 5000000) (< .cse39 (+ .cse42 1))) (or (< .cse38 5000000) (< .cse43 (+ .cse38 1))))) is different from false [2024-11-08 14:13:24,224 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296)) (.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296)) (.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296)) (.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296)) (.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296)) (.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296)) (.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296)) (.cse17 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296)) (.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296)) (.cse12 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296)) (.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296)) (.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296)) (.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296)) (.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296)) (.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296)) (.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296)) (.cse30 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296)) (.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296)) (.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296)) (.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296)) (.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296)) (.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296)) (.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296)) (.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296)) (.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296)) (.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296)) (.cse7 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296)) (.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296)) (.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296)) (.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296)) (.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296)) (.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296)) (.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296)) (.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296)) (.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296)) (.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296)) (.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296)) (.cse43 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296)) (.cse38 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (and (or (< .cse0 5000000) (< .cse1 (+ .cse0 1))) (or (< .cse2 5000000) (< .cse3 (+ 1 .cse2))) (or (< .cse4 (+ .cse5 1)) (< .cse5 5000000)) (or (< .cse6 5000000) (< .cse7 (+ .cse6 1))) (or (< .cse8 5000000) (< .cse9 (+ .cse8 1))) (or (< .cse10 5000000) (< .cse5 (+ .cse10 1))) (or (< .cse11 (+ .cse12 1)) (< .cse12 5000000)) (or (< .cse13 5000000) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296) (+ .cse13 1))) (or (< .cse14 5000000) (< .cse15 (+ .cse14 1))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< .cse16 5000000) (< .cse17 (+ .cse16 1)))) (or (< .cse18 (+ .cse9 1)) (< .cse9 5000000)) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< .cse19 5000000) (< .cse20 (+ 1 .cse19)))) (or (< .cse21 (+ .cse22 1)) (< .cse22 5000000)) (or (< .cse0 (+ .cse11 1)) (< .cse11 5000000)) (or (< .cse15 5000000) (< .cse23 (+ .cse15 1))) (or (< .cse24 5000000) (< .cse25 (+ .cse24 1))) (or (< .cse23 5000000) (< .cse8 (+ .cse23 1))) (or (< .cse17 5000000) (< .cse26 (+ .cse17 1))) (or (< .cse27 (+ .cse25 1)) (< .cse25 5000000)) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< .cse28 (+ .cse29 1)) (< .cse29 5000000))) (or (< .cse12 (+ .cse3 1)) (< .cse3 5000000)) (or (< .cse18 5000000) (< .cse30 (+ .cse18 1))) (or (< .cse31 (+ .cse4 1)) (< .cse4 5000000)) (or (< .cse32 (+ .cse31 1)) (< .cse31 5000000)) (or (< .cse28 5000000) (< .cse2 (+ .cse28 1))) (or (< .cse33 5000000) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296) (+ .cse33 1))) (or (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296) (+ .cse30 1)) (< .cse30 5000000)) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< .cse34 5000000) (< .cse35 (+ .cse34 1)))) (or (< .cse36 (+ .cse37 1)) (< .cse37 5000000)) (or (< .cse32 5000000) (< .cse33 (+ .cse32 1))) (or (< .cse38 (+ .cse39 1)) (< .cse39 5000000)) (or (< .cse13 (+ .cse27 1)) (< .cse27 5000000)) (or (< .cse21 5000000) (< .cse6 (+ .cse21 1))) (or (< .cse40 (+ .cse1 1)) (< .cse1 5000000)) (or (< .cse20 5000000) (< .cse37 (+ .cse20 1))) (or (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296) (+ .cse7 1)) (< .cse7 5000000)) (or (< .cse14 (+ .cse35 1)) (< .cse35 5000000)) (or (< .cse36 5000000) (< .cse22 (+ .cse36 1))) (or (< .cse40 5000000) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296) (+ .cse40 1))) (or (< .cse26 5000000) (< .cse10 (+ .cse26 1))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< .cse41 5000000) (< .cse42 (+ .cse41 1)))) (or (< .cse24 (+ .cse43 1)) (< .cse43 5000000)) (or (< .cse42 5000000) (< .cse39 (+ .cse42 1))) (or (< .cse38 5000000) (< .cse43 (+ .cse38 1))))) is different from false [2024-11-08 14:13:28,236 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296)) (.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296)) (.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296)) (.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296)) (.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296)) (.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296)) (.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296)) (.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296)) (.cse16 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296)) (.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296)) (.cse12 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296)) (.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296)) (.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296)) (.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296)) (.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296)) (.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296)) (.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296)) (.cse30 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296)) (.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296)) (.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296)) (.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296)) (.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296)) (.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296)) (.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296)) (.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296)) (.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296)) (.cse7 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296)) (.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296)) (.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296)) (.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296)) (.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296)) (.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296)) (.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296)) (.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296)) (.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296)) (.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296)) (.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296)) (.cse43 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296)) (.cse38 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (and (or (< .cse0 5000000) (< .cse1 (+ .cse0 1))) (or (< .cse2 5000000) (< .cse3 (+ 1 .cse2))) (or (< .cse4 (+ .cse5 1)) (< .cse5 5000000)) (or (< .cse6 5000000) (< .cse7 (+ .cse6 1))) (or (< .cse8 5000000) (< .cse9 (+ .cse8 1))) (or (< .cse10 5000000) (< .cse5 (+ .cse10 1))) (or (< .cse11 (+ .cse12 1)) (< .cse12 5000000)) (or (< .cse13 5000000) (< .cse14 (+ .cse13 1))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< .cse15 5000000) (< .cse16 (+ .cse15 1)))) (or (< .cse17 (+ .cse9 1)) (< .cse9 5000000)) (or (< .cse18 5000000) (< .cse19 (+ 1 .cse18))) (or (< .cse20 (+ .cse21 1)) (< .cse21 5000000)) (or (< .cse0 (+ .cse11 1)) (< .cse11 5000000)) (or (< .cse14 5000000) (< .cse22 (+ .cse14 1))) (or (< .cse23 5000000) (< .cse24 (+ .cse23 1))) (let ((.cse25 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (or (< .cse18 (+ .cse25 1)) (< .cse25 5000000))) (or (< .cse22 5000000) (< .cse8 (+ .cse22 1))) (or (< .cse16 5000000) (< .cse26 (+ .cse16 1))) (or (< .cse27 (+ .cse24 1)) (< .cse24 5000000)) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< .cse28 (+ .cse29 1)) (< .cse29 5000000))) (or (< .cse12 (+ .cse3 1)) (< .cse3 5000000)) (or (< .cse17 5000000) (< .cse30 (+ .cse17 1))) (or (< .cse31 (+ .cse4 1)) (< .cse4 5000000)) (or (< .cse32 (+ .cse31 1)) (< .cse31 5000000)) (or (< .cse28 5000000) (< .cse2 (+ .cse28 1))) (or (< .cse33 5000000) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296) (+ .cse33 1))) (or (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296) (+ .cse30 1)) (< .cse30 5000000)) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< .cse34 5000000) (< .cse35 (+ .cse34 1)))) (or (< .cse36 (+ .cse37 1)) (< .cse37 5000000)) (or (< .cse32 5000000) (< .cse33 (+ .cse32 1))) (or (< .cse38 (+ .cse39 1)) (< .cse39 5000000)) (or (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296) (+ .cse27 1)) (< .cse27 5000000)) (or (< .cse20 5000000) (< .cse6 (+ .cse20 1))) (or (< .cse40 (+ .cse1 1)) (< .cse1 5000000)) (or (< .cse19 5000000) (< .cse37 (+ .cse19 1))) (or (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296) (+ .cse7 1)) (< .cse7 5000000)) (or (< .cse13 (+ .cse35 1)) (< .cse35 5000000)) (or (< .cse36 5000000) (< .cse21 (+ .cse36 1))) (or (< .cse40 5000000) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296) (+ .cse40 1))) (or (< .cse26 5000000) (< .cse10 (+ .cse26 1))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< .cse41 5000000) (< .cse42 (+ .cse41 1)))) (or (< .cse23 (+ .cse43 1)) (< .cse43 5000000)) (or (< .cse42 5000000) (< .cse39 (+ .cse42 1))) (or (< .cse38 5000000) (< .cse43 (+ .cse38 1))))) is different from false