/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 18:23:05,847 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 18:23:05,904 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 18:23:05,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 18:23:05,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 18:23:05,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 18:23:05,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 18:23:05,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 18:23:05,934 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 18:23:05,936 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 18:23:05,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 18:23:05,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 18:23:05,937 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 18:23:05,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 18:23:05,938 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 18:23:05,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 18:23:05,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 18:23:05,939 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 18:23:05,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 18:23:05,939 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 18:23:05,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 18:23:05,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 18:23:05,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 18:23:05,940 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 18:23:05,940 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 18:23:05,940 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 18:23:05,940 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 18:23:05,940 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 18:23:05,941 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 18:23:05,941 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 18:23:05,941 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 18:23:05,941 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 18:23:05,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 18:23:05,942 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 18:23:05,942 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 18:23:05,942 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 18:23:05,942 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 18:23:05,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 18:23:05,942 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 18:23:05,942 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 18:23:05,942 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 18:23:05,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 18:23:05,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 18:23:05,943 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: Use bitabs translation -> true [2023-12-19 18:23:06,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 18:23:06,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 18:23:06,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 18:23:06,115 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 18:23:06,115 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 18:23:06,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_10.c [2023-12-19 18:23:07,108 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 18:23:07,237 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 18:23:07,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_10.c [2023-12-19 18:23:07,245 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/199847226/72e6612acbe04a598ae30734e3f82289/FLAG18238aace [2023-12-19 18:23:07,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/199847226/72e6612acbe04a598ae30734e3f82289 [2023-12-19 18:23:07,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 18:23:07,261 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 18:23:07,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 18:23:07,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 18:23:07,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 18:23:07,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 06:23:07" (1/1) ... [2023-12-19 18:23:07,266 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ce9c35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:23:07, skipping insertion in model container [2023-12-19 18:23:07,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 06:23:07" (1/1) ... [2023-12-19 18:23:07,281 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 18:23:07,379 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_10.c[319,332] [2023-12-19 18:23:07,388 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 18:23:07,395 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 18:23:07,402 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_10.c[319,332] [2023-12-19 18:23:07,405 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 18:23:07,421 INFO L206 MainTranslator]: Completed translation [2023-12-19 18:23:07,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:23:07 WrapperNode [2023-12-19 18:23:07,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 18:23:07,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 18:23:07,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 18:23:07,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 18:23:07,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:23:07" (1/1) ... [2023-12-19 18:23:07,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:23:07" (1/1) ... [2023-12-19 18:23:07,444 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 30 [2023-12-19 18:23:07,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 18:23:07,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 18:23:07,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 18:23:07,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 18:23:07,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:23:07" (1/1) ... [2023-12-19 18:23:07,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:23:07" (1/1) ... [2023-12-19 18:23:07,451 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:23:07" (1/1) ... [2023-12-19 18:23:07,457 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]. [2023-12-19 18:23:07,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:23:07" (1/1) ... [2023-12-19 18:23:07,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:23:07" (1/1) ... [2023-12-19 18:23:07,459 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:23:07" (1/1) ... [2023-12-19 18:23:07,460 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:23:07" (1/1) ... [2023-12-19 18:23:07,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:23:07" (1/1) ... [2023-12-19 18:23:07,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:23:07" (1/1) ... [2023-12-19 18:23:07,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 18:23:07,463 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 18:23:07,463 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 18:23:07,463 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 18:23:07,463 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:23:07" (1/1) ... [2023-12-19 18:23:07,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 18:23:07,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 18:23:07,484 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) [2023-12-19 18:23:07,492 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 [2023-12-19 18:23:07,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 18:23:07,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 18:23:07,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 18:23:07,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 18:23:07,546 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 18:23:07,547 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 18:23:07,611 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 18:23:07,624 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 18:23:07,624 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 18:23:07,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 06:23:07 BoogieIcfgContainer [2023-12-19 18:23:07,625 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 18:23:07,626 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 18:23:07,626 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 18:23:07,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 18:23:07,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 06:23:07" (1/3) ... [2023-12-19 18:23:07,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d23d4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 06:23:07, skipping insertion in model container [2023-12-19 18:23:07,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:23:07" (2/3) ... [2023-12-19 18:23:07,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d23d4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 06:23:07, skipping insertion in model container [2023-12-19 18:23:07,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 06:23:07" (3/3) ... [2023-12-19 18:23:07,630 INFO L112 eAbstractionObserver]: Analyzing ICFG mono-crafted_10.c [2023-12-19 18:23:07,640 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 18:23:07,641 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 18:23:07,666 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 18:23:07,671 INFO L357 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, mHoare=true, 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;@3f016c54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 18:23:07,671 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 18:23:07,674 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 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) [2023-12-19 18:23:07,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-19 18:23:07,680 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 18:23:07,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-19 18:23:07,680 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 18:23:07,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 18:23:07,683 INFO L85 PathProgramCache]: Analyzing trace with hash 63417192, now seen corresponding path program 1 times [2023-12-19 18:23:07,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 18:23:07,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892618503] [2023-12-19 18:23:07,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:23:07,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 18:23:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:23:07,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:23:07,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 18:23:07,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892618503] [2023-12-19 18:23:07,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892618503] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 18:23:07,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 18:23:07,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 18:23:07,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085919492] [2023-12-19 18:23:07,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 18:23:07,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 18:23:07,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 18:23:07,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 18:23:07,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 18:23:07,803 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2023-12-19 18:23:07,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 18:23:07,829 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2023-12-19 18:23:07,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 18:23:07,831 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2023-12-19 18:23:07,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 18:23:07,835 INFO L225 Difference]: With dead ends: 16 [2023-12-19 18:23:07,836 INFO L226 Difference]: Without dead ends: 8 [2023-12-19 18:23:07,837 INFO L412 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 [2023-12-19 18:23:07,839 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 18:23:07,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 18:23:07,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-12-19 18:23:07,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-12-19 18:23:07,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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) [2023-12-19 18:23:07,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2023-12-19 18:23:07,856 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2023-12-19 18:23:07,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 18:23:07,857 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2023-12-19 18:23:07,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2023-12-19 18:23:07,857 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2023-12-19 18:23:07,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-19 18:23:07,857 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 18:23:07,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-19 18:23:07,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 18:23:07,858 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 18:23:07,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 18:23:07,858 INFO L85 PathProgramCache]: Analyzing trace with hash 63089491, now seen corresponding path program 1 times [2023-12-19 18:23:07,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 18:23:07,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33424567] [2023-12-19 18:23:07,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:23:07,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 18:23:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:23:08,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:23:08,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 18:23:08,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33424567] [2023-12-19 18:23:08,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33424567] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 18:23:08,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 18:23:08,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 18:23:08,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332949875] [2023-12-19 18:23:08,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 18:23:08,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 18:23:08,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 18:23:08,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 18:23:08,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 18:23:08,016 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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) [2023-12-19 18:23:08,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 18:23:08,032 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2023-12-19 18:23:08,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 18:23:08,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2023-12-19 18:23:08,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 18:23:08,033 INFO L225 Difference]: With dead ends: 18 [2023-12-19 18:23:08,033 INFO L226 Difference]: Without dead ends: 11 [2023-12-19 18:23:08,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 18:23:08,034 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 18:23:08,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 7 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 18:23:08,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-19 18:23:08,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2023-12-19 18:23:08,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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) [2023-12-19 18:23:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-12-19 18:23:08,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 5 [2023-12-19 18:23:08,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 18:23:08,038 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-12-19 18:23:08,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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) [2023-12-19 18:23:08,038 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-12-19 18:23:08,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-19 18:23:08,038 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 18:23:08,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 18:23:08,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 18:23:08,039 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 18:23:08,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 18:23:08,039 INFO L85 PathProgramCache]: Analyzing trace with hash -100395752, now seen corresponding path program 1 times [2023-12-19 18:23:08,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 18:23:08,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668393123] [2023-12-19 18:23:08,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:23:08,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 18:23:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:23:08,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:23:08,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 18:23:08,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668393123] [2023-12-19 18:23:08,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668393123] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 18:23:08,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014492550] [2023-12-19 18:23:08,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:23:08,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:23:08,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 18:23:08,194 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) [2023-12-19 18:23:08,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 18:23:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:23:08,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-19 18:23:08,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 18:23:08,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:23:08,263 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 18:23:08,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:23:08,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014492550] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 18:23:08,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 18:23:08,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 8 [2023-12-19 18:23:08,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849890440] [2023-12-19 18:23:08,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 18:23:08,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 18:23:08,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 18:23:08,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 18:23:08,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2023-12-19 18:23:08,316 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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) [2023-12-19 18:23:08,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 18:23:08,390 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2023-12-19 18:23:08,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 18:23:08,393 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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 8 [2023-12-19 18:23:08,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 18:23:08,397 INFO L225 Difference]: With dead ends: 25 [2023-12-19 18:23:08,397 INFO L226 Difference]: Without dead ends: 18 [2023-12-19 18:23:08,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2023-12-19 18:23:08,398 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 18:23:08,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 7 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 18:23:08,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-19 18:23:08,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-12-19 18:23:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:23:08,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2023-12-19 18:23:08,402 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 8 [2023-12-19 18:23:08,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 18:23:08,402 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2023-12-19 18:23:08,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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) [2023-12-19 18:23:08,402 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2023-12-19 18:23:08,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-19 18:23:08,403 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 18:23:08,403 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2023-12-19 18:23:08,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 18:23:08,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:23:08,611 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 18:23:08,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 18:23:08,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1140498195, now seen corresponding path program 2 times [2023-12-19 18:23:08,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 18:23:08,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126203267] [2023-12-19 18:23:08,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:23:08,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 18:23:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:23:08,816 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:23:08,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 18:23:08,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126203267] [2023-12-19 18:23:08,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126203267] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 18:23:08,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306475176] [2023-12-19 18:23:08,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 18:23:08,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:23:08,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 18:23:08,819 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) [2023-12-19 18:23:08,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-19 18:23:08,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 18:23:08,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 18:23:08,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-19 18:23:08,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 18:23:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:23:08,951 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 18:23:09,047 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:23:09,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306475176] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 18:23:09,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 18:23:09,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2023-12-19 18:23:09,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238016972] [2023-12-19 18:23:09,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 18:23:09,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-19 18:23:09,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 18:23:09,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-19 18:23:09,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2023-12-19 18:23:09,054 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 16 states have internal predecessors, (44), 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) [2023-12-19 18:23:09,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 18:23:09,400 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2023-12-19 18:23:09,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 18:23:09,401 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 16 states have internal predecessors, (44), 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 17 [2023-12-19 18:23:09,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 18:23:09,401 INFO L225 Difference]: With dead ends: 45 [2023-12-19 18:23:09,401 INFO L226 Difference]: Without dead ends: 36 [2023-12-19 18:23:09,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2023-12-19 18:23:09,402 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 29 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 18:23:09,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 24 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 18:23:09,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-19 18:23:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-12-19 18:23:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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) [2023-12-19 18:23:09,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-12-19 18:23:09,407 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 17 [2023-12-19 18:23:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 18:23:09,408 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-12-19 18:23:09,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 16 states have internal predecessors, (44), 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) [2023-12-19 18:23:09,408 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-12-19 18:23:09,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-19 18:23:09,408 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 18:23:09,408 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1] [2023-12-19 18:23:09,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-19 18:23:09,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-19 18:23:09,609 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 18:23:09,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 18:23:09,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1831092403, now seen corresponding path program 3 times [2023-12-19 18:23:09,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 18:23:09,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454951036] [2023-12-19 18:23:09,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:23:09,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 18:23:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:23:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:23:09,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 18:23:09,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454951036] [2023-12-19 18:23:09,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454951036] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 18:23:09,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131584792] [2023-12-19 18:23:09,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-19 18:23:09,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:23:09,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 18:23:09,981 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) [2023-12-19 18:23:10,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-19 18:23:10,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-19 18:23:10,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 18:23:10,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 18:23:10,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 18:23:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-12-19 18:23:10,099 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 18:23:10,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131584792] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 18:23:10,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 18:23:10,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 16 [2023-12-19 18:23:10,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173200862] [2023-12-19 18:23:10,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 18:23:10,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 18:23:10,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 18:23:10,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 18:23:10,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-12-19 18:23:10,102 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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) [2023-12-19 18:23:10,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 18:23:10,139 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2023-12-19 18:23:10,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 18:23:10,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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) Word has length 35 [2023-12-19 18:23:10,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 18:23:10,142 INFO L225 Difference]: With dead ends: 62 [2023-12-19 18:23:10,143 INFO L226 Difference]: Without dead ends: 58 [2023-12-19 18:23:10,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2023-12-19 18:23:10,144 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 7 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 [2023-12-19 18:23:10,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 7 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 18:23:10,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-19 18:23:10,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 36. [2023-12-19 18:23:10,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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) [2023-12-19 18:23:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-12-19 18:23:10,158 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 35 [2023-12-19 18:23:10,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 18:23:10,159 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-12-19 18:23:10,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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) [2023-12-19 18:23:10,159 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-12-19 18:23:10,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-19 18:23:10,164 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 18:23:10,164 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1] [2023-12-19 18:23:10,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-19 18:23:10,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:23:10,365 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 18:23:10,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 18:23:10,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1773834101, now seen corresponding path program 1 times [2023-12-19 18:23:10,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 18:23:10,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211050253] [2023-12-19 18:23:10,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:23:10,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 18:23:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:23:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:23:10,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 18:23:10,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211050253] [2023-12-19 18:23:10,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211050253] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 18:23:10,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765381526] [2023-12-19 18:23:10,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:23:10,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:23:10,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 18:23:10,483 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) [2023-12-19 18:23:10,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-19 18:23:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:23:10,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-19 18:23:10,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 18:23:10,569 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:23:10,569 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 18:23:10,940 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:23:10,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765381526] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 18:23:10,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 18:23:10,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 14] total 26 [2023-12-19 18:23:10,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76639706] [2023-12-19 18:23:10,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 18:23:10,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-19 18:23:10,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 18:23:10,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-19 18:23:10,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2023-12-19 18:23:10,943 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 27 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:23:18,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 18:23:18,388 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2023-12-19 18:23:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-19 18:23:18,388 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-19 18:23:18,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 18:23:18,389 INFO L225 Difference]: With dead ends: 87 [2023-12-19 18:23:18,389 INFO L226 Difference]: Without dead ends: 69 [2023-12-19 18:23:18,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=977, Invalid=2103, Unknown=0, NotChecked=0, Total=3080 [2023-12-19 18:23:18,390 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 58 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 18:23:18,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 34 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 18:23:18,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-19 18:23:18,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-12-19 18:23:18,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:23:18,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2023-12-19 18:23:18,404 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 35 [2023-12-19 18:23:18,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 18:23:18,404 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2023-12-19 18:23:18,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:23:18,404 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2023-12-19 18:23:18,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-19 18:23:18,407 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 18:23:18,407 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1] [2023-12-19 18:23:18,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-19 18:23:18,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:23:18,613 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 18:23:18,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 18:23:18,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1186010854, now seen corresponding path program 2 times [2023-12-19 18:23:18,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 18:23:18,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603642482] [2023-12-19 18:23:18,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:23:18,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 18:23:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:23:19,030 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:23:19,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 18:23:19,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603642482] [2023-12-19 18:23:19,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603642482] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 18:23:19,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582335348] [2023-12-19 18:23:19,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 18:23:19,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:23:19,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 18:23:19,031 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) [2023-12-19 18:23:19,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-19 18:23:19,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 18:23:19,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 18:23:19,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-19 18:23:19,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 18:23:19,165 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:23:19,165 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 18:23:19,866 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:23:19,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582335348] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 18:23:19,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 18:23:19,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 44 [2023-12-19 18:23:19,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692271465] [2023-12-19 18:23:19,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 18:23:19,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-19 18:23:19,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 18:23:19,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-19 18:23:19,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2023-12-19 18:23:19,868 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 45 states, 45 states have (on average 2.977777777777778) internal successors, (134), 44 states have internal predecessors, (134), 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) [2023-12-19 18:24:27,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 18:24:27,126 INFO L93 Difference]: Finished difference Result 144 states and 168 transitions. [2023-12-19 18:24:27,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-19 18:24:27,127 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.977777777777778) internal successors, (134), 44 states have internal predecessors, (134), 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 68 [2023-12-19 18:24:27,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 18:24:27,127 INFO L225 Difference]: With dead ends: 144 [2023-12-19 18:24:27,127 INFO L226 Difference]: Without dead ends: 135 [2023-12-19 18:24:27,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 67.5s TimeCoverageRelationStatistics Valid=1470, Invalid=2690, Unknown=0, NotChecked=0, Total=4160 [2023-12-19 18:24:27,129 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1487 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 18:24:27,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 57 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 18:24:27,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-12-19 18:24:27,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2023-12-19 18:24:27,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.0149253731343284) internal successors, (136), 134 states have internal predecessors, (136), 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) [2023-12-19 18:24:27,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2023-12-19 18:24:27,139 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 68 [2023-12-19 18:24:27,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 18:24:27,139 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2023-12-19 18:24:27,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.977777777777778) internal successors, (134), 44 states have internal predecessors, (134), 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) [2023-12-19 18:24:27,140 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2023-12-19 18:24:27,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-19 18:24:27,141 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 18:24:27,141 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 42, 1, 1, 1, 1, 1, 1] [2023-12-19 18:24:27,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-19 18:24:27,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:24:27,346 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 18:24:27,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 18:24:27,346 INFO L85 PathProgramCache]: Analyzing trace with hash 523367546, now seen corresponding path program 3 times [2023-12-19 18:24:27,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 18:24:27,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895431617] [2023-12-19 18:24:27,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:24:27,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 18:24:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:24:28,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 85 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:24:28,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 18:24:28,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895431617] [2023-12-19 18:24:28,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895431617] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 18:24:28,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560048093] [2023-12-19 18:24:28,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-19 18:24:28,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:24:28,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 18:24:28,527 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) [2023-12-19 18:24:28,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-19 18:24:28,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-19 18:24:28,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 18:24:28,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-19 18:24:28,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 18:24:28,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 208 proven. 2 refuted. 0 times theorem prover too weak. 2542 trivial. 0 not checked. [2023-12-19 18:24:28,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 18:24:29,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 41 proven. 210 refuted. 0 times theorem prover too weak. 2501 trivial. 0 not checked. [2023-12-19 18:24:29,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560048093] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 18:24:29,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 18:24:29,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 5, 6] total 53 [2023-12-19 18:24:29,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186719053] [2023-12-19 18:24:29,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 18:24:29,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-12-19 18:24:29,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 18:24:29,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-12-19 18:24:29,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2694, Unknown=0, NotChecked=0, Total=2862 [2023-12-19 18:24:29,226 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand has 54 states, 54 states have (on average 2.8703703703703702) internal successors, (155), 53 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) [2023-12-19 18:24:32,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 18:24:32,015 INFO L93 Difference]: Finished difference Result 166 states and 179 transitions. [2023-12-19 18:24:32,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-12-19 18:24:32,016 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.8703703703703702) internal successors, (155), 53 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 134 [2023-12-19 18:24:32,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 18:24:32,017 INFO L225 Difference]: With dead ends: 166 [2023-12-19 18:24:32,017 INFO L226 Difference]: Without dead ends: 157 [2023-12-19 18:24:32,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1340 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1091, Invalid=9415, Unknown=0, NotChecked=0, Total=10506 [2023-12-19 18:24:32,020 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 211 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5463 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 5512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 5463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-19 18:24:32,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 73 Invalid, 5512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 5463 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-19 18:24:32,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-12-19 18:24:32,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2023-12-19 18:24:32,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.0394736842105263) internal successors, (158), 152 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) [2023-12-19 18:24:32,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 158 transitions. [2023-12-19 18:24:32,031 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 158 transitions. Word has length 134 [2023-12-19 18:24:32,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 18:24:32,032 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 158 transitions. [2023-12-19 18:24:32,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.8703703703703702) internal successors, (155), 53 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) [2023-12-19 18:24:32,032 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 158 transitions. [2023-12-19 18:24:32,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-19 18:24:32,033 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 18:24:32,033 INFO L195 NwaCegarLoop]: trace histogram [49, 49, 44, 5, 1, 1, 1, 1, 1] [2023-12-19 18:24:32,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-19 18:24:32,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:24:32,238 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 18:24:32,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 18:24:32,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1517311322, now seen corresponding path program 4 times [2023-12-19 18:24:32,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 18:24:32,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051294358] [2023-12-19 18:24:32,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:24:32,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 18:24:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:24:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 625 proven. 2926 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-19 18:24:33,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 18:24:33,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051294358] [2023-12-19 18:24:33,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051294358] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 18:24:33,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304655135] [2023-12-19 18:24:33,445 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-19 18:24:33,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:24:33,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 18:24:33,446 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) [2023-12-19 18:24:33,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-19 18:24:33,570 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-19 18:24:33,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 18:24:33,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 96 conjunts are in the unsatisfiable core [2023-12-19 18:24:33,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 18:24:33,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 373 proven. 3197 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-19 18:24:33,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 18:24:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 373 proven. 3197 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-19 18:24:37,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304655135] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 18:24:37,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 18:24:37,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 48, 49] total 97 [2023-12-19 18:24:37,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509720934] [2023-12-19 18:24:37,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 18:24:37,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2023-12-19 18:24:37,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 18:24:37,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2023-12-19 18:24:37,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2543, Invalid=6963, Unknown=0, NotChecked=0, Total=9506 [2023-12-19 18:24:37,809 INFO L87 Difference]: Start difference. First operand 153 states and 158 transitions. Second operand has 98 states, 98 states have (on average 2.979591836734694) internal successors, (292), 97 states have internal predecessors, (292), 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) [2023-12-19 18:24:43,644 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (< .cse0 5000000) (< 4294967294 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< 4294967294 .cse1) (< .cse1 5000000))) (let ((.cse2 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse2 5000000) (< 4294967294 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 4294967294 .cse3) (< .cse3 5000000))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse4 5000000) (< 4294967294 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< 4294967294 .cse5) (< .cse5 5000000))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< 4294967294 .cse6) (< .cse6 5000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< .cse7 5000000) (< 4294967294 .cse7))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse8 5000000) (< 4294967294 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< .cse9 5000000) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (< .cse10 5000000) (< 4294967294 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< 4294967294 .cse11) (< .cse11 5000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< .cse12 5000000) (< 4294967294 .cse12))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse13) (< .cse13 5000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (< .cse14 5000000) (< 4294967294 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< .cse15 5000000) (< 4294967294 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< 4294967294 .cse16) (< .cse16 5000000))) (let ((.cse17 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse17 5000000) (< 4294967294 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (< .cse18 5000000) (< 4294967294 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (< .cse19 5000000) (< 4294967294 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< 4294967294 .cse20) (< .cse20 5000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< 4294967294 .cse21) (< .cse21 5000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse22) (< .cse22 5000000))) (let ((.cse23 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse23 5000000) (< 4294967294 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (< 4294967294 .cse24) (< .cse24 5000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse25 5000000) (< 4294967294 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< .cse26 5000000) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse27 5000000) (< 4294967294 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse28 5000000) (< 4294967294 .cse28))) (let ((.cse29 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse29 5000000) (< 4294967294 .cse29))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (< .cse30 5000000) (< 4294967294 .cse30))) (let ((.cse31 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse31) (< .cse31 5000000))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 5000000) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse32 5000000) (< 4294967294 .cse32))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse33) (< .cse33 5000000))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse34) (< .cse34 5000000))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse35 5000000) (< 4294967294 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< .cse36 5000000) (< 4294967294 .cse36))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< 4294967294 .cse37) (< .cse37 5000000))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< 4294967294 .cse38) (< .cse38 5000000))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse39) (< .cse39 5000000))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse40) (< .cse40 5000000))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse41 5000000) (< 4294967294 .cse41))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse42) (< .cse42 5000000))) (let ((.cse43 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse43 5000000) (< 4294967294 .cse43))) (let ((.cse44 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (< 4294967294 .cse44) (< .cse44 5000000))) (let ((.cse45 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< 4294967294 .cse45) (< .cse45 5000000)))) is different from false [2023-12-19 18:27:25,073 WARN L293 SmtUtils]: Spent 34.52s on a formula simplification. DAG size of input: 269 DAG size of output: 16 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-19 18:29:32,314 WARN L293 SmtUtils]: Spent 13.43s on a formula simplification. DAG size of input: 269 DAG size of output: 16 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-19 18:29:36,336 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (< .cse0 5000000) (< 4294967294 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< 4294967294 .cse1) (< .cse1 5000000))) (let ((.cse2 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse2 5000000) (< 4294967294 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 4294967294 .cse3) (< .cse3 5000000))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse4 5000000) (< 4294967294 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< 4294967294 .cse5) (< .cse5 5000000))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< 4294967294 .cse6) (< .cse6 5000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< .cse7 5000000) (< 4294967294 .cse7))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse8 5000000) (< 4294967294 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< .cse9 5000000) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (< .cse10 5000000) (< 4294967294 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< 4294967294 .cse11) (< .cse11 5000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< .cse12 5000000) (< 4294967294 .cse12))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse13) (< .cse13 5000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (< .cse14 5000000) (< 4294967294 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< .cse15 5000000) (< 4294967294 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< 4294967294 .cse16) (< .cse16 5000000))) (let ((.cse17 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse17 5000000) (< 4294967294 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (< .cse18 5000000) (< 4294967294 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (< .cse19 5000000) (< 4294967294 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< 4294967294 .cse20) (< .cse20 5000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< 4294967294 .cse21) (< .cse21 5000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse22) (< .cse22 5000000))) (let ((.cse23 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse23 5000000) (< 4294967294 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (< 4294967294 .cse24) (< .cse24 5000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse25 5000000) (< 4294967294 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< .cse26 5000000) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse27 5000000) (< 4294967294 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse28 5000000) (< 4294967294 .cse28))) (let ((.cse29 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse29 5000000) (< 4294967294 .cse29))) (let ((.cse30 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse30) (< .cse30 5000000))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 5000000) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse31 5000000) (< 4294967294 .cse31))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse32) (< .cse32 5000000))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse33) (< .cse33 5000000))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse34 5000000) (< 4294967294 .cse34))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< .cse35 5000000) (< 4294967294 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< 4294967294 .cse36) (< .cse36 5000000))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< 4294967294 .cse37) (< .cse37 5000000))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse38) (< .cse38 5000000))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse39) (< .cse39 5000000))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse40 5000000) (< 4294967294 .cse40))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse41) (< .cse41 5000000))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse42 5000000) (< 4294967294 .cse42))) (let ((.cse43 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (< 4294967294 .cse43) (< .cse43 5000000))) (let ((.cse44 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< 4294967294 .cse44) (< .cse44 5000000)))) is different from false [2023-12-19 18:32:04,033 WARN L293 SmtUtils]: Spent 21.30s on a formula simplification. DAG size of input: 275 DAG size of output: 16 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-19 18:32:08,046 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (< .cse0 5000000) (< 4294967294 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< 4294967294 .cse1) (< .cse1 5000000))) (let ((.cse2 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse2 5000000) (< 4294967294 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 4294967294 .cse3) (< .cse3 5000000))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse4 5000000) (< 4294967294 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< 4294967294 .cse5) (< .cse5 5000000))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< 4294967294 .cse6) (< .cse6 5000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< .cse7 5000000) (< 4294967294 .cse7))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse8 5000000) (< 4294967294 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< .cse9 5000000) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (< .cse10 5000000) (< 4294967294 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< 4294967294 .cse11) (< .cse11 5000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< .cse12 5000000) (< 4294967294 .cse12))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse13) (< .cse13 5000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (< .cse14 5000000) (< 4294967294 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< .cse15 5000000) (< 4294967294 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< 4294967294 .cse16) (< .cse16 5000000))) (let ((.cse17 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse17 5000000) (< 4294967294 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (< .cse18 5000000) (< 4294967294 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (< .cse19 5000000) (< 4294967294 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< 4294967294 .cse20) (< .cse20 5000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< 4294967294 .cse21) (< .cse21 5000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse22) (< .cse22 5000000))) (let ((.cse23 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse23 5000000) (< 4294967294 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (< 4294967294 .cse24) (< .cse24 5000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse25 5000000) (< 4294967294 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< .cse26 5000000) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse27 5000000) (< 4294967294 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse28 5000000) (< 4294967294 .cse28))) (let ((.cse29 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse29 5000000) (< 4294967294 .cse29))) (let ((.cse30 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse30) (< .cse30 5000000))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse31 5000000) (< 4294967294 .cse31))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse32) (< .cse32 5000000))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse33) (< .cse33 5000000))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse34 5000000) (< 4294967294 .cse34))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< .cse35 5000000) (< 4294967294 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< 4294967294 .cse36) (< .cse36 5000000))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< 4294967294 .cse37) (< .cse37 5000000))) (let ((.cse38 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (or (< .cse38 5000000) (< 4294967294 .cse38))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse39) (< .cse39 5000000))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse40) (< .cse40 5000000))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse41 5000000) (< 4294967294 .cse41))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse42) (< .cse42 5000000))) (let ((.cse43 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse43 5000000) (< 4294967294 .cse43))) (let ((.cse44 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< 4294967294 .cse44) (< .cse44 5000000)))) is different from false [2023-12-19 18:32:12,068 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (< .cse0 5000000) (< 4294967294 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< 4294967294 .cse1) (< .cse1 5000000))) (let ((.cse2 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse2 5000000) (< 4294967294 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 4294967294 .cse3) (< .cse3 5000000))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse4 5000000) (< 4294967294 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< 4294967294 .cse5) (< .cse5 5000000))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< 4294967294 .cse6) (< .cse6 5000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< .cse7 5000000) (< 4294967294 .cse7))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse8 5000000) (< 4294967294 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< .cse9 5000000) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (< .cse10 5000000) (< 4294967294 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< 4294967294 .cse11) (< .cse11 5000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< .cse12 5000000) (< 4294967294 .cse12))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse13) (< .cse13 5000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (< .cse14 5000000) (< 4294967294 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< .cse15 5000000) (< 4294967294 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< 4294967294 .cse16) (< .cse16 5000000))) (let ((.cse17 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse17 5000000) (< 4294967294 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (< .cse18 5000000) (< 4294967294 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (< .cse19 5000000) (< 4294967294 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< 4294967294 .cse20) (< .cse20 5000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< 4294967294 .cse21) (< .cse21 5000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse22) (< .cse22 5000000))) (let ((.cse23 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse23 5000000) (< 4294967294 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (< 4294967294 .cse24) (< .cse24 5000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse25 5000000) (< 4294967294 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< .cse26 5000000) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse27 5000000) (< 4294967294 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse28 5000000) (< 4294967294 .cse28))) (let ((.cse29 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse29 5000000) (< 4294967294 .cse29))) (let ((.cse30 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse30) (< .cse30 5000000))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse31 5000000) (< 4294967294 .cse31))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse32) (< .cse32 5000000))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse33) (< .cse33 5000000))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse34 5000000) (< 4294967294 .cse34))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< .cse35 5000000) (< 4294967294 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< 4294967294 .cse36) (< .cse36 5000000))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< 4294967294 .cse37) (< .cse37 5000000))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse38) (< .cse38 5000000))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse39) (< .cse39 5000000))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse40 5000000) (< 4294967294 .cse40))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse41) (< .cse41 5000000))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse42 5000000) (< 4294967294 .cse42))) (let ((.cse43 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (< 4294967294 .cse43) (< .cse43 5000000))) (let ((.cse44 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< 4294967294 .cse44) (< .cse44 5000000)))) is different from false [2023-12-19 18:32:16,085 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (< .cse0 5000000) (< 4294967294 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< 4294967294 .cse1) (< .cse1 5000000))) (let ((.cse2 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse2 5000000) (< 4294967294 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 4294967294 .cse3) (< .cse3 5000000))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse4 5000000) (< 4294967294 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< 4294967294 .cse5) (< .cse5 5000000))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< 4294967294 .cse6) (< .cse6 5000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< .cse7 5000000) (< 4294967294 .cse7))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse8 5000000) (< 4294967294 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< .cse9 5000000) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (< .cse10 5000000) (< 4294967294 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< 4294967294 .cse11) (< .cse11 5000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< .cse12 5000000) (< 4294967294 .cse12))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse13) (< .cse13 5000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (< .cse14 5000000) (< 4294967294 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< .cse15 5000000) (< 4294967294 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< 4294967294 .cse16) (< .cse16 5000000))) (let ((.cse17 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse17 5000000) (< 4294967294 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (< .cse18 5000000) (< 4294967294 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (< .cse19 5000000) (< 4294967294 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< 4294967294 .cse20) (< .cse20 5000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< 4294967294 .cse21) (< .cse21 5000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse22) (< .cse22 5000000))) (let ((.cse23 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse23 5000000) (< 4294967294 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (< 4294967294 .cse24) (< .cse24 5000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse25 5000000) (< 4294967294 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< .cse26 5000000) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse27 5000000) (< 4294967294 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse28 5000000) (< 4294967294 .cse28))) (let ((.cse29 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse29 5000000) (< 4294967294 .cse29))) (let ((.cse30 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse30) (< .cse30 5000000))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 5000000) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse31 5000000) (< 4294967294 .cse31))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse32) (< .cse32 5000000))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse33) (< .cse33 5000000))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse34 5000000) (< 4294967294 .cse34))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< .cse35 5000000) (< 4294967294 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< 4294967294 .cse36) (< .cse36 5000000))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< 4294967294 .cse37) (< .cse37 5000000))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse38) (< .cse38 5000000))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse39) (< .cse39 5000000))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse40 5000000) (< 4294967294 .cse40))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse41) (< .cse41 5000000))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse42 5000000) (< 4294967294 .cse42))) (let ((.cse43 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< 4294967294 .cse43) (< .cse43 5000000)))) is different from false [2023-12-19 18:34:50,613 WARN L293 SmtUtils]: Spent 19.05s on a formula simplification. DAG size of input: 257 DAG size of output: 16 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-19 18:37:49,221 WARN L293 SmtUtils]: Spent 22.02s on a formula simplification. DAG size of input: 263 DAG size of output: 16 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-19 18:37:49,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-12-19 18:37:49,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 793.7s TimeCoverageRelationStatistics Valid=3026, Invalid=7482, Unknown=18, NotChecked=1030, Total=11556 [2023-12-19 18:37:49,317 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6685 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 463 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-19 18:37:49,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 7153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6685 Invalid, 0 Unknown, 463 Unchecked, 1.8s Time] [2023-12-19 18:37:49,318 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 18:37:49,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-19 18:37:49,337 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-19 18:37:49,337 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-19 18:37:49,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:37:49,523 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (153states) and FLOYD_HOARE automaton (currently 59 states, 98 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 108 known predicates. [2023-12-19 18:37:49,527 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1] [2023-12-19 18:37:49,528 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 18:37:49,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 06:37:49 BoogieIcfgContainer [2023-12-19 18:37:49,529 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 18:37:49,530 INFO L158 Benchmark]: Toolchain (without parser) took 882269.16ms. Allocated memory was 222.3MB in the beginning and 282.1MB in the end (delta: 59.8MB). Free memory was 174.1MB in the beginning and 112.5MB in the end (delta: 61.6MB). Peak memory consumption was 122.4MB. Max. memory is 8.0GB. [2023-12-19 18:37:49,530 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 222.3MB. Free memory is still 174.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 18:37:49,530 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.23ms. Allocated memory is still 222.3MB. Free memory was 173.7MB in the beginning and 163.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-19 18:37:49,530 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.83ms. Allocated memory is still 222.3MB. Free memory was 163.2MB in the beginning and 162.1MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-19 18:37:49,530 INFO L158 Benchmark]: Boogie Preprocessor took 17.53ms. Allocated memory is still 222.3MB. Free memory was 162.1MB in the beginning and 160.4MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-19 18:37:49,530 INFO L158 Benchmark]: RCFGBuilder took 162.30ms. Allocated memory is still 222.3MB. Free memory was 160.4MB in the beginning and 150.3MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-19 18:37:49,531 INFO L158 Benchmark]: TraceAbstraction took 881903.08ms. Allocated memory was 222.3MB in the beginning and 282.1MB in the end (delta: 59.8MB). Free memory was 149.6MB in the beginning and 112.5MB in the end (delta: 37.1MB). Peak memory consumption was 97.2MB. Max. memory is 8.0GB. [2023-12-19 18:37:49,531 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 222.3MB. Free memory is still 174.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 159.23ms. Allocated memory is still 222.3MB. Free memory was 173.7MB in the beginning and 163.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.83ms. Allocated memory is still 222.3MB. Free memory was 163.2MB in the beginning and 162.1MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.53ms. Allocated memory is still 222.3MB. Free memory was 162.1MB in the beginning and 160.4MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 162.30ms. Allocated memory is still 222.3MB. Free memory was 160.4MB in the beginning and 150.3MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 881903.08ms. Allocated memory was 222.3MB in the beginning and 282.1MB in the end (delta: 59.8MB). Free memory was 149.6MB in the beginning and 112.5MB in the end (delta: 37.1MB). Peak memory consumption was 97.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4). Cancelled while NwaCegarLoop was constructing difference of abstraction (153states) and FLOYD_HOARE automaton (currently 59 states, 98 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 108 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 881.9s, OverallIterations: 9, TraceHistogramMax: 49, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 869.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 399 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 399 mSDsluCounter, 218 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 463 IncrementalHoareTripleChecker+Unchecked, 182 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14285 IncrementalHoareTripleChecker+Invalid, 14858 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 36 mSDtfsCounter, 14285 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1129 GetRequests, 760 SyntacticMatches, 0 SemanticMatches, 368 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2650 ImplicationChecksByTransitivity, 871.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=8, InterpolantAutomatonStates: 170, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 27 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 908 NumberOfCodeBlocks, 761 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1300 ConstructedInterpolants, 0 QuantifiedInterpolants, 7023 SizeOfPredicates, 11 NumberOfNonLiveVariables, 633 ConjunctsInSsa, 202 ConjunctsInUnsatCore, 22 InterpolantComputations, 3 PerfectInterpolantSequences, 7094/21734 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown