/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label29.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 01:48:46,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 01:48:46,370 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-16 01:48:46,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 01:48:46,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 01:48:46,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 01:48:46,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 01:48:46,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 01:48:46,397 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 01:48:46,400 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 01:48:46,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 01:48:46,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 01:48:46,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 01:48:46,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 01:48:46,403 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 01:48:46,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 01:48:46,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 01:48:46,403 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 01:48:46,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 01:48:46,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 01:48:46,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 01:48:46,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 01:48:46,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 01:48:46,405 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 01:48:46,405 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 01:48:46,405 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 01:48:46,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 01:48:46,405 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 01:48:46,406 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 01:48:46,406 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 01:48:46,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 01:48:46,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 01:48:46,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 01:48:46,407 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 01:48:46,407 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 01:48:46,407 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 01:48:46,407 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 01:48:46,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 01:48:46,408 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 01:48:46,408 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 01:48:46,408 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 01:48:46,408 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 01:48:46,408 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 01:48:46,408 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 -> false [2023-12-16 01:48:46,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 01:48:46,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 01:48:46,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 01:48:46,591 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 01:48:46,591 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 01:48:46,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label29.c [2023-12-16 01:48:47,688 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 01:48:47,908 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 01:48:47,909 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label29.c [2023-12-16 01:48:47,919 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40b5516c5/cba1a1920eb84600840ef307741f25bb/FLAGce48b1505 [2023-12-16 01:48:47,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40b5516c5/cba1a1920eb84600840ef307741f25bb [2023-12-16 01:48:47,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 01:48:47,936 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 01:48:47,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 01:48:47,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 01:48:47,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 01:48:47,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:48:47" (1/1) ... [2023-12-16 01:48:47,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c52ae58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:47, skipping insertion in model container [2023-12-16 01:48:47,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:48:47" (1/1) ... [2023-12-16 01:48:47,988 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 01:48:48,116 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label29.c[1979,1992] [2023-12-16 01:48:48,231 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 01:48:48,238 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 01:48:48,249 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label29.c[1979,1992] [2023-12-16 01:48:48,318 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 01:48:48,335 INFO L206 MainTranslator]: Completed translation [2023-12-16 01:48:48,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:48 WrapperNode [2023-12-16 01:48:48,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 01:48:48,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 01:48:48,336 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 01:48:48,336 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 01:48:48,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:48" (1/1) ... [2023-12-16 01:48:48,357 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:48" (1/1) ... [2023-12-16 01:48:48,418 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2023-12-16 01:48:48,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 01:48:48,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 01:48:48,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 01:48:48,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 01:48:48,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:48" (1/1) ... [2023-12-16 01:48:48,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:48" (1/1) ... [2023-12-16 01:48:48,447 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:48" (1/1) ... [2023-12-16 01:48:48,469 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-16 01:48:48,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:48" (1/1) ... [2023-12-16 01:48:48,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:48" (1/1) ... [2023-12-16 01:48:48,482 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:48" (1/1) ... [2023-12-16 01:48:48,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:48" (1/1) ... [2023-12-16 01:48:48,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:48" (1/1) ... [2023-12-16 01:48:48,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:48" (1/1) ... [2023-12-16 01:48:48,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 01:48:48,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 01:48:48,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 01:48:48,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 01:48:48,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:48" (1/1) ... [2023-12-16 01:48:48,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 01:48:48,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 01:48:48,557 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-16 01:48:48,577 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-16 01:48:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 01:48:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 01:48:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 01:48:48,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 01:48:48,648 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 01:48:48,650 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 01:48:49,393 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 01:48:49,426 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 01:48:49,426 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 01:48:49,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:48:49 BoogieIcfgContainer [2023-12-16 01:48:49,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 01:48:49,428 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 01:48:49,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 01:48:49,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 01:48:49,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 01:48:47" (1/3) ... [2023-12-16 01:48:49,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f22cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:48:49, skipping insertion in model container [2023-12-16 01:48:49,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:48:48" (2/3) ... [2023-12-16 01:48:49,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f22cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:48:49, skipping insertion in model container [2023-12-16 01:48:49,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:48:49" (3/3) ... [2023-12-16 01:48:49,432 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label29.c [2023-12-16 01:48:49,443 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 01:48:49,443 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 01:48:49,473 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 01:48:49,478 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;@1568966, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 01:48:49,478 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 01:48:49,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 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-16 01:48:49,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 01:48:49,493 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:49,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:48:49,494 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:49,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:49,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1754446687, now seen corresponding path program 1 times [2023-12-16 01:48:49,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:49,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458801723] [2023-12-16 01:48:49,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:49,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:49,601 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-16 01:48:49,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:49,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458801723] [2023-12-16 01:48:49,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458801723] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:49,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:49,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 01:48:49,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004430134] [2023-12-16 01:48:49,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:49,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 01:48:49,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:49,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 01:48:49,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 01:48:49,634 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 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 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 01:48:49,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:49,677 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2023-12-16 01:48:49,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 01:48:49,682 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-16 01:48:49,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:49,688 INFO L225 Difference]: With dead ends: 287 [2023-12-16 01:48:49,689 INFO L226 Difference]: Without dead ends: 142 [2023-12-16 01:48:49,691 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-16 01:48:49,693 INFO L413 NwaCegarLoop]: 217 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, 217 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-16 01:48:49,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 01:48:49,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-12-16 01:48:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2023-12-16 01:48:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 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-16 01:48:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2023-12-16 01:48:49,720 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 14 [2023-12-16 01:48:49,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:49,721 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2023-12-16 01:48:49,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 01:48:49,721 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2023-12-16 01:48:49,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 01:48:49,721 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:49,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:48:49,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 01:48:49,722 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:49,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:49,722 INFO L85 PathProgramCache]: Analyzing trace with hash 2144037574, now seen corresponding path program 1 times [2023-12-16 01:48:49,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:49,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764445913] [2023-12-16 01:48:49,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:49,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:49,795 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-16 01:48:49,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:49,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764445913] [2023-12-16 01:48:49,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764445913] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:49,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:49,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 01:48:49,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16328212] [2023-12-16 01:48:49,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:49,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:48:49,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:49,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:48:49,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:48:49,798 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 01:48:50,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:50,315 INFO L93 Difference]: Finished difference Result 283 states and 433 transitions. [2023-12-16 01:48:50,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:48:50,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-16 01:48:50,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:50,320 INFO L225 Difference]: With dead ends: 283 [2023-12-16 01:48:50,321 INFO L226 Difference]: Without dead ends: 281 [2023-12-16 01:48:50,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 01:48:50,324 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 169 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 01:48:50,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 9 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 01:48:50,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-12-16 01:48:50,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2023-12-16 01:48:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.5392857142857144) internal successors, (431), 280 states have internal predecessors, (431), 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-16 01:48:50,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 431 transitions. [2023-12-16 01:48:50,345 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 431 transitions. Word has length 14 [2023-12-16 01:48:50,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:50,345 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 431 transitions. [2023-12-16 01:48:50,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 01:48:50,349 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 431 transitions. [2023-12-16 01:48:50,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-16 01:48:50,352 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:50,352 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:48:50,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 01:48:50,353 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:50,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:50,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1721514188, now seen corresponding path program 1 times [2023-12-16 01:48:50,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:50,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896672504] [2023-12-16 01:48:50,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:50,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 01:48:50,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:50,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896672504] [2023-12-16 01:48:50,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896672504] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:50,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:50,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 01:48:50,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934668365] [2023-12-16 01:48:50,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:50,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:48:50,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:50,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:48:50,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:48:50,629 INFO L87 Difference]: Start difference. First operand 281 states and 431 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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-16 01:48:51,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:51,024 INFO L93 Difference]: Finished difference Result 700 states and 1075 transitions. [2023-12-16 01:48:51,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:48:51,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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 83 [2023-12-16 01:48:51,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:51,027 INFO L225 Difference]: With dead ends: 700 [2023-12-16 01:48:51,027 INFO L226 Difference]: Without dead ends: 420 [2023-12-16 01:48:51,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 01:48:51,029 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 73 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 01:48:51,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 50 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 01:48:51,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2023-12-16 01:48:51,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2023-12-16 01:48:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.4439140811455846) internal successors, (605), 419 states have internal predecessors, (605), 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-16 01:48:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 605 transitions. [2023-12-16 01:48:51,054 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 605 transitions. Word has length 83 [2023-12-16 01:48:51,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:51,054 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 605 transitions. [2023-12-16 01:48:51,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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-16 01:48:51,055 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 605 transitions. [2023-12-16 01:48:51,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-16 01:48:51,055 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:51,056 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:48:51,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 01:48:51,056 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:51,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:51,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1021503139, now seen corresponding path program 1 times [2023-12-16 01:48:51,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:51,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611838060] [2023-12-16 01:48:51,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:51,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:51,191 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 01:48:51,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:51,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611838060] [2023-12-16 01:48:51,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611838060] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:51,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:51,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:48:51,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059530773] [2023-12-16 01:48:51,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:51,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:48:51,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:51,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:48:51,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:48:51,193 INFO L87 Difference]: Start difference. First operand 420 states and 605 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-16 01:48:51,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:51,700 INFO L93 Difference]: Finished difference Result 561 states and 821 transitions. [2023-12-16 01:48:51,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:48:51,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 89 [2023-12-16 01:48:51,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:51,702 INFO L225 Difference]: With dead ends: 561 [2023-12-16 01:48:51,702 INFO L226 Difference]: Without dead ends: 559 [2023-12-16 01:48:51,703 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-16 01:48:51,704 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 168 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 01:48:51,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 9 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 01:48:51,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2023-12-16 01:48:51,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 420. [2023-12-16 01:48:51,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.4439140811455846) internal successors, (605), 419 states have internal predecessors, (605), 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-16 01:48:51,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 605 transitions. [2023-12-16 01:48:51,712 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 605 transitions. Word has length 89 [2023-12-16 01:48:51,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:51,712 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 605 transitions. [2023-12-16 01:48:51,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-16 01:48:51,712 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 605 transitions. [2023-12-16 01:48:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-16 01:48:51,713 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:51,714 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:48:51,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 01:48:51,714 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:51,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:51,714 INFO L85 PathProgramCache]: Analyzing trace with hash 113666975, now seen corresponding path program 1 times [2023-12-16 01:48:51,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:51,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124505794] [2023-12-16 01:48:51,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:51,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:51,864 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 01:48:51,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:51,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124505794] [2023-12-16 01:48:51,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124505794] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:51,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:51,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 01:48:51,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376399385] [2023-12-16 01:48:51,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:51,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:48:51,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:51,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:48:51,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:48:51,866 INFO L87 Difference]: Start difference. First operand 420 states and 605 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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-16 01:48:52,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:52,382 INFO L93 Difference]: Finished difference Result 1117 states and 1638 transitions. [2023-12-16 01:48:52,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:48:52,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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 108 [2023-12-16 01:48:52,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:52,388 INFO L225 Difference]: With dead ends: 1117 [2023-12-16 01:48:52,389 INFO L226 Difference]: Without dead ends: 698 [2023-12-16 01:48:52,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 01:48:52,391 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 51 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 01:48:52,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 75 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 01:48:52,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2023-12-16 01:48:52,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 559. [2023-12-16 01:48:52,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3243727598566308) internal successors, (739), 558 states have internal predecessors, (739), 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-16 01:48:52,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 739 transitions. [2023-12-16 01:48:52,404 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 739 transitions. Word has length 108 [2023-12-16 01:48:52,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:52,404 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 739 transitions. [2023-12-16 01:48:52,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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-16 01:48:52,405 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 739 transitions. [2023-12-16 01:48:52,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-16 01:48:52,406 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:52,407 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:48:52,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 01:48:52,407 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:52,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:52,408 INFO L85 PathProgramCache]: Analyzing trace with hash 532204507, now seen corresponding path program 1 times [2023-12-16 01:48:52,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:52,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596349787] [2023-12-16 01:48:52,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:52,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:52,703 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 01:48:52,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:52,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596349787] [2023-12-16 01:48:52,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596349787] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:52,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:52,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:48:52,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130463279] [2023-12-16 01:48:52,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:52,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 01:48:52,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:52,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 01:48:52,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 01:48:52,707 INFO L87 Difference]: Start difference. First operand 559 states and 739 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 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-16 01:48:53,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:53,203 INFO L93 Difference]: Finished difference Result 981 states and 1331 transitions. [2023-12-16 01:48:53,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 01:48:53,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 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 132 [2023-12-16 01:48:53,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:53,206 INFO L225 Difference]: With dead ends: 981 [2023-12-16 01:48:53,206 INFO L226 Difference]: Without dead ends: 562 [2023-12-16 01:48:53,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 01:48:53,208 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 01:48:53,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 83 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 01:48:53,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2023-12-16 01:48:53,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 559. [2023-12-16 01:48:53,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3154121863799284) internal successors, (734), 558 states have internal predecessors, (734), 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-16 01:48:53,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 734 transitions. [2023-12-16 01:48:53,219 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 734 transitions. Word has length 132 [2023-12-16 01:48:53,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:53,220 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 734 transitions. [2023-12-16 01:48:53,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 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-16 01:48:53,220 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 734 transitions. [2023-12-16 01:48:53,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-16 01:48:53,221 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:53,222 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:48:53,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 01:48:53,222 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:53,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:53,223 INFO L85 PathProgramCache]: Analyzing trace with hash 920387274, now seen corresponding path program 1 times [2023-12-16 01:48:53,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:53,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697985613] [2023-12-16 01:48:53,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:53,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 01:48:53,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:53,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697985613] [2023-12-16 01:48:53,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697985613] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:53,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:53,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:48:53,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705977271] [2023-12-16 01:48:53,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:53,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:48:53,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:53,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:48:53,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:48:53,455 INFO L87 Difference]: Start difference. First operand 559 states and 734 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 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-16 01:48:53,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:53,904 INFO L93 Difference]: Finished difference Result 1256 states and 1752 transitions. [2023-12-16 01:48:53,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:48:53,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 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) Word has length 158 [2023-12-16 01:48:53,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:53,907 INFO L225 Difference]: With dead ends: 1256 [2023-12-16 01:48:53,908 INFO L226 Difference]: Without dead ends: 837 [2023-12-16 01:48:53,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-16 01:48:53,909 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 86 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 01:48:53,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 17 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 01:48:53,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2023-12-16 01:48:53,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2023-12-16 01:48:53,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.3672248803827751) internal successors, (1143), 836 states have internal predecessors, (1143), 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-16 01:48:53,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1143 transitions. [2023-12-16 01:48:53,929 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1143 transitions. Word has length 158 [2023-12-16 01:48:53,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:53,929 INFO L495 AbstractCegarLoop]: Abstraction has 837 states and 1143 transitions. [2023-12-16 01:48:53,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 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-16 01:48:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1143 transitions. [2023-12-16 01:48:53,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-12-16 01:48:53,931 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:53,932 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:48:53,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 01:48:53,932 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:53,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:53,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1153042190, now seen corresponding path program 1 times [2023-12-16 01:48:53,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:53,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473943032] [2023-12-16 01:48:53,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:53,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:54,100 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 01:48:54,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:54,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473943032] [2023-12-16 01:48:54,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473943032] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:54,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:54,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:48:54,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940186198] [2023-12-16 01:48:54,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:54,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:48:54,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:54,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:48:54,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:48:54,104 INFO L87 Difference]: Start difference. First operand 837 states and 1143 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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-16 01:48:54,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:54,493 INFO L93 Difference]: Finished difference Result 1812 states and 2550 transitions. [2023-12-16 01:48:54,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:48:54,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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 174 [2023-12-16 01:48:54,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:54,497 INFO L225 Difference]: With dead ends: 1812 [2023-12-16 01:48:54,497 INFO L226 Difference]: Without dead ends: 1115 [2023-12-16 01:48:54,498 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-16 01:48:54,499 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 52 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 01:48:54,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 210 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 01:48:54,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2023-12-16 01:48:54,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2023-12-16 01:48:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.2944344703770196) internal successors, (1442), 1114 states have internal predecessors, (1442), 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-16 01:48:54,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1442 transitions. [2023-12-16 01:48:54,518 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1442 transitions. Word has length 174 [2023-12-16 01:48:54,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:54,519 INFO L495 AbstractCegarLoop]: Abstraction has 1115 states and 1442 transitions. [2023-12-16 01:48:54,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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-16 01:48:54,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1442 transitions. [2023-12-16 01:48:54,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-16 01:48:54,521 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:54,521 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:48:54,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 01:48:54,521 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:54,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:54,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1327636156, now seen corresponding path program 1 times [2023-12-16 01:48:54,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:54,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551668167] [2023-12-16 01:48:54,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:54,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 01:48:54,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:54,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551668167] [2023-12-16 01:48:54,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551668167] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:54,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:54,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 01:48:54,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321525225] [2023-12-16 01:48:54,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:54,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 01:48:54,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:54,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 01:48:54,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-16 01:48:54,844 INFO L87 Difference]: Start difference. First operand 1115 states and 1442 transitions. Second operand has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 6 states have internal predecessors, (183), 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-16 01:48:55,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:55,288 INFO L93 Difference]: Finished difference Result 2145 states and 2794 transitions. [2023-12-16 01:48:55,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 01:48:55,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 6 states have internal predecessors, (183), 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 183 [2023-12-16 01:48:55,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:55,292 INFO L225 Difference]: With dead ends: 2145 [2023-12-16 01:48:55,292 INFO L226 Difference]: Without dead ends: 1115 [2023-12-16 01:48:55,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-16 01:48:55,293 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 01:48:55,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 25 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 01:48:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2023-12-16 01:48:55,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2023-12-16 01:48:55,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.289048473967684) internal successors, (1436), 1114 states have internal predecessors, (1436), 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-16 01:48:55,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1436 transitions. [2023-12-16 01:48:55,307 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1436 transitions. Word has length 183 [2023-12-16 01:48:55,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:55,307 INFO L495 AbstractCegarLoop]: Abstraction has 1115 states and 1436 transitions. [2023-12-16 01:48:55,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 6 states have internal predecessors, (183), 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-16 01:48:55,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1436 transitions. [2023-12-16 01:48:55,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-12-16 01:48:55,309 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:55,309 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:48:55,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 01:48:55,309 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:55,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:55,310 INFO L85 PathProgramCache]: Analyzing trace with hash 577252822, now seen corresponding path program 1 times [2023-12-16 01:48:55,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:55,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252244539] [2023-12-16 01:48:55,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:55,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 01:48:55,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:55,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252244539] [2023-12-16 01:48:55,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252244539] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:55,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:55,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:48:55,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695320423] [2023-12-16 01:48:55,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:55,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:48:55,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:55,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:48:55,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:48:55,582 INFO L87 Difference]: Start difference. First operand 1115 states and 1436 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-16 01:48:55,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:55,913 INFO L93 Difference]: Finished difference Result 2368 states and 3135 transitions. [2023-12-16 01:48:55,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:48:55,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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 219 [2023-12-16 01:48:55,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:55,917 INFO L225 Difference]: With dead ends: 2368 [2023-12-16 01:48:55,918 INFO L226 Difference]: Without dead ends: 1393 [2023-12-16 01:48:55,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-16 01:48:55,919 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 72 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 01:48:55,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 13 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 01:48:55,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2023-12-16 01:48:55,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1393. [2023-12-16 01:48:55,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1392 states have (on average 1.3096264367816093) internal successors, (1823), 1392 states have internal predecessors, (1823), 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-16 01:48:55,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1823 transitions. [2023-12-16 01:48:55,936 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1823 transitions. Word has length 219 [2023-12-16 01:48:55,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:55,937 INFO L495 AbstractCegarLoop]: Abstraction has 1393 states and 1823 transitions. [2023-12-16 01:48:55,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-16 01:48:55,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1823 transitions. [2023-12-16 01:48:55,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2023-12-16 01:48:55,939 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:55,939 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:48:55,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 01:48:55,939 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:55,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:55,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1186149456, now seen corresponding path program 1 times [2023-12-16 01:48:55,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:55,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921605492] [2023-12-16 01:48:55,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:55,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2023-12-16 01:48:56,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:56,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921605492] [2023-12-16 01:48:56,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921605492] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:56,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:56,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:48:56,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152186824] [2023-12-16 01:48:56,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:56,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:48:56,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:56,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:48:56,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:48:56,067 INFO L87 Difference]: Start difference. First operand 1393 states and 1823 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-16 01:48:56,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:56,435 INFO L93 Difference]: Finished difference Result 2785 states and 3660 transitions. [2023-12-16 01:48:56,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:48:56,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 240 [2023-12-16 01:48:56,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:56,439 INFO L225 Difference]: With dead ends: 2785 [2023-12-16 01:48:56,439 INFO L226 Difference]: Without dead ends: 1115 [2023-12-16 01:48:56,440 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-16 01:48:56,441 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 127 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 01:48:56,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 222 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 01:48:56,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2023-12-16 01:48:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2023-12-16 01:48:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.2549371633752244) internal successors, (1398), 1114 states have internal predecessors, (1398), 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-16 01:48:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1398 transitions. [2023-12-16 01:48:56,454 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1398 transitions. Word has length 240 [2023-12-16 01:48:56,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:56,454 INFO L495 AbstractCegarLoop]: Abstraction has 1115 states and 1398 transitions. [2023-12-16 01:48:56,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-16 01:48:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1398 transitions. [2023-12-16 01:48:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2023-12-16 01:48:56,457 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:56,457 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:48:56,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 01:48:56,457 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:56,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:56,457 INFO L85 PathProgramCache]: Analyzing trace with hash 699747533, now seen corresponding path program 1 times [2023-12-16 01:48:56,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:56,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588486766] [2023-12-16 01:48:56,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:56,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 40 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 01:48:56,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:56,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588486766] [2023-12-16 01:48:56,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588486766] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 01:48:56,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192185299] [2023-12-16 01:48:56,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:56,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 01:48:56,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 01:48:56,754 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-16 01:48:56,787 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-16 01:48:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:56,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 01:48:56,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 01:48:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2023-12-16 01:48:57,139 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 01:48:57,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192185299] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:57,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 01:48:57,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2023-12-16 01:48:57,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973000891] [2023-12-16 01:48:57,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:57,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:48:57,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:57,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:48:57,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 01:48:57,141 INFO L87 Difference]: Start difference. First operand 1115 states and 1398 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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-16 01:48:57,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:57,471 INFO L93 Difference]: Finished difference Result 2368 states and 3005 transitions. [2023-12-16 01:48:57,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:48:57,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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 241 [2023-12-16 01:48:57,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:57,475 INFO L225 Difference]: With dead ends: 2368 [2023-12-16 01:48:57,475 INFO L226 Difference]: Without dead ends: 1393 [2023-12-16 01:48:57,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 01:48:57,477 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 60 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 01:48:57,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 30 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 01:48:57,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2023-12-16 01:48:57,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1393. [2023-12-16 01:48:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1392 states have (on average 1.1846264367816093) internal successors, (1649), 1392 states have internal predecessors, (1649), 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-16 01:48:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1649 transitions. [2023-12-16 01:48:57,492 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1649 transitions. Word has length 241 [2023-12-16 01:48:57,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:57,493 INFO L495 AbstractCegarLoop]: Abstraction has 1393 states and 1649 transitions. [2023-12-16 01:48:57,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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-16 01:48:57,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1649 transitions. [2023-12-16 01:48:57,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2023-12-16 01:48:57,495 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:57,495 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:48:57,504 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-16 01:48:57,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-16 01:48:57,701 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:57,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:57,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1512265873, now seen corresponding path program 1 times [2023-12-16 01:48:57,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:57,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658466066] [2023-12-16 01:48:57,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:57,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:57,837 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2023-12-16 01:48:57,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:57,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658466066] [2023-12-16 01:48:57,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658466066] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:57,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:57,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:48:57,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033182909] [2023-12-16 01:48:57,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:57,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:48:57,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:57,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:48:57,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:48:57,839 INFO L87 Difference]: Start difference. First operand 1393 states and 1649 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-16 01:48:58,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:58,138 INFO L93 Difference]: Finished difference Result 2646 states and 3154 transitions. [2023-12-16 01:48:58,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:48:58,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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 286 [2023-12-16 01:48:58,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:58,142 INFO L225 Difference]: With dead ends: 2646 [2023-12-16 01:48:58,142 INFO L226 Difference]: Without dead ends: 1393 [2023-12-16 01:48:58,144 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-16 01:48:58,144 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 140 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 01:48:58,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 186 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 01:48:58,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2023-12-16 01:48:58,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1254. [2023-12-16 01:48:58,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.1452513966480447) internal successors, (1435), 1253 states have internal predecessors, (1435), 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-16 01:48:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1435 transitions. [2023-12-16 01:48:58,159 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1435 transitions. Word has length 286 [2023-12-16 01:48:58,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:58,159 INFO L495 AbstractCegarLoop]: Abstraction has 1254 states and 1435 transitions. [2023-12-16 01:48:58,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-16 01:48:58,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1435 transitions. [2023-12-16 01:48:58,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2023-12-16 01:48:58,162 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:58,162 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:48:58,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 01:48:58,162 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:58,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:58,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1131689984, now seen corresponding path program 1 times [2023-12-16 01:48:58,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:58,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983402964] [2023-12-16 01:48:58,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:58,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:48:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-16 01:48:58,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:48:58,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983402964] [2023-12-16 01:48:58,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983402964] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:48:58,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:48:58,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:48:58,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072867685] [2023-12-16 01:48:58,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:48:58,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 01:48:58,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:48:58,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 01:48:58,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 01:48:58,477 INFO L87 Difference]: Start difference. First operand 1254 states and 1435 transitions. Second operand has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 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-16 01:48:59,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:48:59,012 INFO L93 Difference]: Finished difference Result 3619 states and 4184 transitions. [2023-12-16 01:48:59,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 01:48:59,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 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 292 [2023-12-16 01:48:59,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:48:59,019 INFO L225 Difference]: With dead ends: 3619 [2023-12-16 01:48:59,019 INFO L226 Difference]: Without dead ends: 2505 [2023-12-16 01:48:59,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 01:48:59,021 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 01:48:59,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 48 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 01:48:59,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2023-12-16 01:48:59,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 2227. [2023-12-16 01:48:59,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2227 states, 2226 states have (on average 1.1383647798742138) internal successors, (2534), 2226 states have internal predecessors, (2534), 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-16 01:48:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2227 states to 2227 states and 2534 transitions. [2023-12-16 01:48:59,058 INFO L78 Accepts]: Start accepts. Automaton has 2227 states and 2534 transitions. Word has length 292 [2023-12-16 01:48:59,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:48:59,058 INFO L495 AbstractCegarLoop]: Abstraction has 2227 states and 2534 transitions. [2023-12-16 01:48:59,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 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-16 01:48:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2227 states and 2534 transitions. [2023-12-16 01:48:59,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2023-12-16 01:48:59,062 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:48:59,062 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:48:59,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 01:48:59,063 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:48:59,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:48:59,063 INFO L85 PathProgramCache]: Analyzing trace with hash 884418500, now seen corresponding path program 1 times [2023-12-16 01:48:59,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:48:59,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647531015] [2023-12-16 01:48:59,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:48:59,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:48:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 01:48:59,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 01:48:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 01:48:59,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 01:48:59,243 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 01:48:59,244 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 01:48:59,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 01:48:59,248 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:48:59,251 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 01:48:59,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 01:48:59 BoogieIcfgContainer [2023-12-16 01:48:59,347 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 01:48:59,348 INFO L158 Benchmark]: Toolchain (without parser) took 11412.05ms. Allocated memory was 291.5MB in the beginning and 423.6MB in the end (delta: 132.1MB). Free memory was 236.5MB in the beginning and 316.5MB in the end (delta: -80.0MB). Peak memory consumption was 52.9MB. Max. memory is 8.0GB. [2023-12-16 01:48:59,348 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 221.2MB. Free memory is still 169.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 01:48:59,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.39ms. Allocated memory is still 291.5MB. Free memory was 236.5MB in the beginning and 207.9MB in the end (delta: 28.6MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2023-12-16 01:48:59,348 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.58ms. Allocated memory is still 291.5MB. Free memory was 207.9MB in the beginning and 199.9MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-16 01:48:59,348 INFO L158 Benchmark]: Boogie Preprocessor took 87.98ms. Allocated memory is still 291.5MB. Free memory was 199.9MB in the beginning and 189.7MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-16 01:48:59,349 INFO L158 Benchmark]: RCFGBuilder took 919.03ms. Allocated memory is still 291.5MB. Free memory was 189.7MB in the beginning and 165.7MB in the end (delta: 24.0MB). Peak memory consumption was 24.4MB. Max. memory is 8.0GB. [2023-12-16 01:48:59,349 INFO L158 Benchmark]: TraceAbstraction took 9919.57ms. Allocated memory was 291.5MB in the beginning and 423.6MB in the end (delta: 132.1MB). Free memory was 165.2MB in the beginning and 316.5MB in the end (delta: -151.3MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 01:48:59,350 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.10ms. Allocated memory is still 221.2MB. Free memory is still 169.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 397.39ms. Allocated memory is still 291.5MB. Free memory was 236.5MB in the beginning and 207.9MB in the end (delta: 28.6MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 82.58ms. Allocated memory is still 291.5MB. Free memory was 207.9MB in the beginning and 199.9MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 87.98ms. Allocated memory is still 291.5MB. Free memory was 199.9MB in the beginning and 189.7MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 919.03ms. Allocated memory is still 291.5MB. Free memory was 189.7MB in the beginning and 165.7MB in the end (delta: 24.0MB). Peak memory consumption was 24.4MB. Max. memory is 8.0GB. * TraceAbstraction took 9919.57ms. Allocated memory was 291.5MB in the beginning and 423.6MB in the end (delta: 132.1MB). Free memory was 165.2MB in the beginning and 316.5MB in the end (delta: -151.3MB). There was no memory consumed. 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 - CounterExampleResult [Line: 59]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputC = 3; [L18] int inputD = 4; [L19] int inputE = 5; [L20] int inputF = 6; [L21] int inputB = 2; [L24] int a1 = 23; [L25] int a19 = 9; [L26] int a10 = 0; [L27] int a12 = 0; [L28] int a4 = 14; [L589] int output = -1; VAL [a10=0, a12=0, a19=9, a1=23, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L592] COND TRUE 1 [L595] int input; [L596] EXPR input = __VERIFIER_nondet_int() [L597] COND FALSE, EXPR !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L435] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L440] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L452] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L458] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L475] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L481] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L486] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L491] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L503] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L509] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L514] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L519] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L527] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L533] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) VAL [\old(input)=2, a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L536] COND TRUE ((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0))))) [L537] a1 = (((a1 * 5) + 278443) - -239546) [L538] return 26; VAL [\old(input)=2, \result=26, a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) [L600] EXPR output = calculate_output(input) [L593-L601] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } [L592] COND TRUE 1 [L595] int input; [L596] EXPR input = __VERIFIER_nondet_int() [L597] COND FALSE, EXPR !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=518104, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND TRUE (((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0)) [L255] a1 = (((((a1 % 25)- -13) - 42605) / 5) - -8517) [L256] a10 = 3 [L258] return 26; VAL [\old(input)=6, \result=26, a10=3, a12=0, a19=9, a1=0, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) [L600] EXPR output = calculate_output(input) [L593-L601] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } [L592] COND TRUE 1 [L595] int input; [L596] EXPR input = __VERIFIER_nondet_int() [L597] COND FALSE, EXPR !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(input)=5, a10=3, a12=0, a19=9, a1=0, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND TRUE (((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14)) [L356] a1 = ((((a1 - 287698) - 189392) % 89)+ 206) [L357] a10 = 2 [L358] a19 = 7 [L360] return -1; VAL [\old(input)=5, \result=-1, a10=2, a12=0, a19=7, a1=156, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) [L600] EXPR output = calculate_output(input) [L593-L601] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=2, a12=0, a19=7, a1=156, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=2, a12=0, a19=7, a1=156, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=2, a12=0, a19=7, a1=156, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=2, a12=0, a19=7, a1=156, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=2, a12=0, a19=7, a1=156, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=2, a12=0, a19=7, a1=156, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=2, a12=0, a19=7, a1=156, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=2, a12=0, a19=7, a1=156, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=2, a12=0, a19=7, a1=156, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND TRUE (((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)) VAL [\old(input)=3, a10=2, a12=0, a19=7, a1=156, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] reach_error() VAL [\old(input)=3, a10=2, a12=0, a19=7, a1=156, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1343 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1343 mSDsluCounter, 1194 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 888 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5723 IncrementalHoareTripleChecker+Invalid, 6611 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 888 mSolverCounterUnsat, 1126 mSDtfsCounter, 5723 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2227occurred in iteration=14, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 698 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2785 NumberOfCodeBlocks, 2785 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2459 ConstructedInterpolants, 0 QuantifiedInterpolants, 8866 SizeOfPredicates, 0 NumberOfNonLiveVariables, 348 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 1306/1401 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 proved your program to be incorrect! [2023-12-16 01:48:59,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...