./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label48.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label48.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94a9f0c4990b8c3764e35adff1f19b96f11bbca3a3dcb53928c534e80a1f7878 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 03:48:15,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 03:48:15,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 03:48:15,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 03:48:15,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 03:48:15,617 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 03:48:15,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 03:48:15,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 03:48:15,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 03:48:15,619 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 03:48:15,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 03:48:15,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 03:48:15,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 03:48:15,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 03:48:15,623 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 03:48:15,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 03:48:15,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 03:48:15,624 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 03:48:15,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 03:48:15,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 03:48:15,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 03:48:15,626 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 03:48:15,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 03:48:15,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 03:48:15,627 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 03:48:15,627 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 03:48:15,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 03:48:15,628 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 03:48:15,628 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 03:48:15,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 03:48:15,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 03:48:15,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 03:48:15,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:48:15,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 03:48:15,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 03:48:15,631 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 03:48:15,631 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 03:48:15,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 03:48:15,632 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 03:48:15,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 03:48:15,632 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 03:48:15,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 03:48:15,633 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 94a9f0c4990b8c3764e35adff1f19b96f11bbca3a3dcb53928c534e80a1f7878 [2024-11-16 03:48:15,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 03:48:15,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 03:48:15,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 03:48:15,896 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 03:48:15,897 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 03:48:15,898 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label48.c [2024-11-16 03:48:17,289 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 03:48:17,556 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 03:48:17,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label48.c [2024-11-16 03:48:17,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64edb2150/f18467b0bc234f878865ac234a5ef32b/FLAGbc683a57f [2024-11-16 03:48:17,873 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64edb2150/f18467b0bc234f878865ac234a5ef32b [2024-11-16 03:48:17,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 03:48:17,877 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 03:48:17,879 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 03:48:17,879 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 03:48:17,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 03:48:17,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:48:17" (1/1) ... [2024-11-16 03:48:17,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61fc6e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:17, skipping insertion in model container [2024-11-16 03:48:17,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:48:17" (1/1) ... [2024-11-16 03:48:17,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 03:48:18,100 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label48.c[1104,1117] [2024-11-16 03:48:18,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:48:18,307 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 03:48:18,320 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label48.c[1104,1117] [2024-11-16 03:48:18,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:48:18,432 INFO L204 MainTranslator]: Completed translation [2024-11-16 03:48:18,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:18 WrapperNode [2024-11-16 03:48:18,433 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 03:48:18,434 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 03:48:18,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 03:48:18,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 03:48:18,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:18" (1/1) ... [2024-11-16 03:48:18,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:18" (1/1) ... [2024-11-16 03:48:18,538 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 597 [2024-11-16 03:48:18,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 03:48:18,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 03:48:18,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 03:48:18,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 03:48:18,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:18" (1/1) ... [2024-11-16 03:48:18,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:18" (1/1) ... [2024-11-16 03:48:18,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:18" (1/1) ... [2024-11-16 03:48:18,647 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 03:48:18,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:18" (1/1) ... [2024-11-16 03:48:18,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:18" (1/1) ... [2024-11-16 03:48:18,679 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:18" (1/1) ... [2024-11-16 03:48:18,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:18" (1/1) ... [2024-11-16 03:48:18,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:18" (1/1) ... [2024-11-16 03:48:18,695 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:18" (1/1) ... [2024-11-16 03:48:18,710 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 03:48:18,711 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 03:48:18,712 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 03:48:18,712 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 03:48:18,713 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:18" (1/1) ... [2024-11-16 03:48:18,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:48:18,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:48:18,750 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 03:48:18,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 03:48:18,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 03:48:18,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 03:48:18,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 03:48:18,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 03:48:18,874 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 03:48:18,876 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 03:48:19,955 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-16 03:48:19,956 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 03:48:19,976 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 03:48:19,979 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 03:48:19,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:48:19 BoogieIcfgContainer [2024-11-16 03:48:19,980 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 03:48:19,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 03:48:19,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 03:48:19,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 03:48:19,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:48:17" (1/3) ... [2024-11-16 03:48:19,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b0cbf23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:48:19, skipping insertion in model container [2024-11-16 03:48:19,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:18" (2/3) ... [2024-11-16 03:48:19,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b0cbf23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:48:19, skipping insertion in model container [2024-11-16 03:48:19,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:48:19" (3/3) ... [2024-11-16 03:48:19,989 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label48.c [2024-11-16 03:48:20,006 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 03:48:20,007 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 03:48:20,079 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 03:48:20,089 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3e1492ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 03:48:20,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 03:48:20,095 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 207 states have (on average 1.6763285024154588) internal successors, (347), 208 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:20,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 03:48:20,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:20,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:48:20,104 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:20,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:20,109 INFO L85 PathProgramCache]: Analyzing trace with hash -655788864, now seen corresponding path program 1 times [2024-11-16 03:48:20,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:20,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374611460] [2024-11-16 03:48:20,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:20,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:20,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:20,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:20,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374611460] [2024-11-16 03:48:20,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374611460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:20,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:20,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:48:20,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958498134] [2024-11-16 03:48:20,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:20,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:20,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:20,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:20,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:20,319 INFO L87 Difference]: Start difference. First operand has 209 states, 207 states have (on average 1.6763285024154588) internal successors, (347), 208 states have internal predecessors, (347), 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 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:21,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:21,151 INFO L93 Difference]: Finished difference Result 558 states and 972 transitions. [2024-11-16 03:48:21,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:21,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-16 03:48:21,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:21,167 INFO L225 Difference]: With dead ends: 558 [2024-11-16 03:48:21,167 INFO L226 Difference]: Without dead ends: 285 [2024-11-16 03:48:21,171 INFO L431 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 [2024-11-16 03:48:21,175 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 181 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:21,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 80 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 03:48:21,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-16 03:48:21,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-11-16 03:48:21,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 1.5316901408450705) internal successors, (435), 284 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 435 transitions. [2024-11-16 03:48:21,232 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 435 transitions. Word has length 9 [2024-11-16 03:48:21,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:21,233 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 435 transitions. [2024-11-16 03:48:21,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 435 transitions. [2024-11-16 03:48:21,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-16 03:48:21,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:21,236 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 03:48:21,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 03:48:21,237 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:21,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:21,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2062848463, now seen corresponding path program 1 times [2024-11-16 03:48:21,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:21,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981025326] [2024-11-16 03:48:21,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:21,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:21,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:21,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981025326] [2024-11-16 03:48:21,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981025326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:21,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:21,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:48:21,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667751450] [2024-11-16 03:48:21,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:21,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:21,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:21,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:21,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:21,517 INFO L87 Difference]: Start difference. First operand 285 states and 435 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:22,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:22,007 INFO L93 Difference]: Finished difference Result 708 states and 1083 transitions. [2024-11-16 03:48:22,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:22,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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 79 [2024-11-16 03:48:22,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:22,010 INFO L225 Difference]: With dead ends: 708 [2024-11-16 03:48:22,011 INFO L226 Difference]: Without dead ends: 425 [2024-11-16 03:48:22,012 INFO L431 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 [2024-11-16 03:48:22,013 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:22,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 37 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:48:22,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-16 03:48:22,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2024-11-16 03:48:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.4150943396226414) internal successors, (600), 424 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:22,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 600 transitions. [2024-11-16 03:48:22,050 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 600 transitions. Word has length 79 [2024-11-16 03:48:22,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:22,051 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 600 transitions. [2024-11-16 03:48:22,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:22,051 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 600 transitions. [2024-11-16 03:48:22,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-16 03:48:22,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:22,053 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 03:48:22,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 03:48:22,053 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:22,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:22,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1773207328, now seen corresponding path program 1 times [2024-11-16 03:48:22,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:22,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370737427] [2024-11-16 03:48:22,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:22,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:22,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:22,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:22,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370737427] [2024-11-16 03:48:22,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370737427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:22,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:22,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:48:22,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972931830] [2024-11-16 03:48:22,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:22,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:22,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:22,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:22,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:22,251 INFO L87 Difference]: Start difference. First operand 425 states and 600 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:22,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:22,717 INFO L93 Difference]: Finished difference Result 1268 states and 1794 transitions. [2024-11-16 03:48:22,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:22,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 85 [2024-11-16 03:48:22,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:22,721 INFO L225 Difference]: With dead ends: 1268 [2024-11-16 03:48:22,721 INFO L226 Difference]: Without dead ends: 845 [2024-11-16 03:48:22,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:22,723 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:22,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 210 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:48:22,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-11-16 03:48:22,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 705. [2024-11-16 03:48:22,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 704 states have (on average 1.3210227272727273) internal successors, (930), 704 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:22,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 930 transitions. [2024-11-16 03:48:22,746 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 930 transitions. Word has length 85 [2024-11-16 03:48:22,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:22,747 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 930 transitions. [2024-11-16 03:48:22,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:22,747 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 930 transitions. [2024-11-16 03:48:22,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 03:48:22,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:22,750 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 03:48:22,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 03:48:22,750 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:22,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:22,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1825821073, now seen corresponding path program 1 times [2024-11-16 03:48:22,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:22,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824419310] [2024-11-16 03:48:22,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:22,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:22,925 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:22,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:22,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824419310] [2024-11-16 03:48:22,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824419310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:22,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:22,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:48:22,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573029677] [2024-11-16 03:48:22,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:22,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:22,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:22,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:22,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:22,928 INFO L87 Difference]: Start difference. First operand 705 states and 930 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:23,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:23,365 INFO L93 Difference]: Finished difference Result 1688 states and 2239 transitions. [2024-11-16 03:48:23,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:23,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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 96 [2024-11-16 03:48:23,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:23,370 INFO L225 Difference]: With dead ends: 1688 [2024-11-16 03:48:23,370 INFO L226 Difference]: Without dead ends: 985 [2024-11-16 03:48:23,371 INFO L431 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 [2024-11-16 03:48:23,372 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 59 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:23,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 76 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:48:23,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2024-11-16 03:48:23,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 845. [2024-11-16 03:48:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.2144549763033174) internal successors, (1025), 844 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1025 transitions. [2024-11-16 03:48:23,389 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1025 transitions. Word has length 96 [2024-11-16 03:48:23,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:23,390 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1025 transitions. [2024-11-16 03:48:23,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:23,391 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1025 transitions. [2024-11-16 03:48:23,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-16 03:48:23,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:23,403 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:48:23,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 03:48:23,403 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:23,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:23,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1878472850, now seen corresponding path program 1 times [2024-11-16 03:48:23,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:23,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462588924] [2024-11-16 03:48:23,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:23,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:23,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:23,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462588924] [2024-11-16 03:48:23,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462588924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:23,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:23,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:48:23,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240409331] [2024-11-16 03:48:23,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:23,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:23,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:23,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:23,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:23,740 INFO L87 Difference]: Start difference. First operand 845 states and 1025 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:24,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:24,200 INFO L93 Difference]: Finished difference Result 1968 states and 2429 transitions. [2024-11-16 03:48:24,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:24,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 163 [2024-11-16 03:48:24,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:24,207 INFO L225 Difference]: With dead ends: 1968 [2024-11-16 03:48:24,207 INFO L226 Difference]: Without dead ends: 1125 [2024-11-16 03:48:24,208 INFO L431 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 [2024-11-16 03:48:24,210 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 80 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:24,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 22 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:48:24,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2024-11-16 03:48:24,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1125. [2024-11-16 03:48:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.2330960854092528) internal successors, (1386), 1124 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1386 transitions. [2024-11-16 03:48:24,236 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1386 transitions. Word has length 163 [2024-11-16 03:48:24,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:24,237 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1386 transitions. [2024-11-16 03:48:24,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:24,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1386 transitions. [2024-11-16 03:48:24,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-16 03:48:24,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:24,241 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:48:24,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 03:48:24,242 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:24,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:24,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1851953318, now seen corresponding path program 1 times [2024-11-16 03:48:24,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:24,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139655617] [2024-11-16 03:48:24,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:24,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:24,476 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:24,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:24,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139655617] [2024-11-16 03:48:24,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139655617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:24,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:24,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:48:24,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824441576] [2024-11-16 03:48:24,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:24,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:24,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:24,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:24,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:24,480 INFO L87 Difference]: Start difference. First operand 1125 states and 1386 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:24,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:24,929 INFO L93 Difference]: Finished difference Result 2528 states and 3131 transitions. [2024-11-16 03:48:24,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:24,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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 171 [2024-11-16 03:48:24,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:24,938 INFO L225 Difference]: With dead ends: 2528 [2024-11-16 03:48:24,939 INFO L226 Difference]: Without dead ends: 1405 [2024-11-16 03:48:24,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:24,943 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 53 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:24,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 217 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:48:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2024-11-16 03:48:24,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1405. [2024-11-16 03:48:24,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1404 states have (on average 1.2015669515669516) internal successors, (1687), 1404 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:24,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1687 transitions. [2024-11-16 03:48:24,971 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1687 transitions. Word has length 171 [2024-11-16 03:48:24,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:24,972 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 1687 transitions. [2024-11-16 03:48:24,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:24,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1687 transitions. [2024-11-16 03:48:24,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-16 03:48:24,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:24,975 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:48:24,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 03:48:24,975 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:24,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:24,976 INFO L85 PathProgramCache]: Analyzing trace with hash -718501238, now seen corresponding path program 1 times [2024-11-16 03:48:24,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:24,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82778149] [2024-11-16 03:48:24,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:24,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 03:48:25,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:25,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82778149] [2024-11-16 03:48:25,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82778149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:25,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:25,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:48:25,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951652431] [2024-11-16 03:48:25,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:25,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:25,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:25,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:25,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:25,205 INFO L87 Difference]: Start difference. First operand 1405 states and 1687 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:25,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:25,628 INFO L93 Difference]: Finished difference Result 2948 states and 3522 transitions. [2024-11-16 03:48:25,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:25,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 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 178 [2024-11-16 03:48:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:25,635 INFO L225 Difference]: With dead ends: 2948 [2024-11-16 03:48:25,635 INFO L226 Difference]: Without dead ends: 1545 [2024-11-16 03:48:25,637 INFO L431 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 [2024-11-16 03:48:25,639 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 68 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:25,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 86 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:48:25,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-16 03:48:25,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1545. [2024-11-16 03:48:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.1865284974093264) internal successors, (1832), 1544 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:25,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1832 transitions. [2024-11-16 03:48:25,686 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1832 transitions. Word has length 178 [2024-11-16 03:48:25,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:25,686 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 1832 transitions. [2024-11-16 03:48:25,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:25,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1832 transitions. [2024-11-16 03:48:25,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-16 03:48:25,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:25,691 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:48:25,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 03:48:25,691 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:25,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:25,692 INFO L85 PathProgramCache]: Analyzing trace with hash -2083975836, now seen corresponding path program 1 times [2024-11-16 03:48:25,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:25,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861884031] [2024-11-16 03:48:25,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:25,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:26,140 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:26,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:26,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861884031] [2024-11-16 03:48:26,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861884031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:26,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:26,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:48:26,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802940562] [2024-11-16 03:48:26,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:26,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 03:48:26,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:26,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 03:48:26,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:48:26,145 INFO L87 Difference]: Start difference. First operand 1545 states and 1832 transitions. Second operand has 7 states, 7 states have (on average 31.142857142857142) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:26,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:26,587 INFO L93 Difference]: Finished difference Result 3004 states and 3573 transitions. [2024-11-16 03:48:26,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 03:48:26,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 31.142857142857142) internal successors, (218), 6 states have internal predecessors, (218), 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 218 [2024-11-16 03:48:26,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:26,592 INFO L225 Difference]: With dead ends: 3004 [2024-11-16 03:48:26,592 INFO L226 Difference]: Without dead ends: 1545 [2024-11-16 03:48:26,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:48:26,594 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 143 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:26,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 23 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:48:26,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-16 03:48:26,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1545. [2024-11-16 03:48:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.1819948186528497) internal successors, (1825), 1544 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1825 transitions. [2024-11-16 03:48:26,621 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1825 transitions. Word has length 218 [2024-11-16 03:48:26,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:26,621 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 1825 transitions. [2024-11-16 03:48:26,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 31.142857142857142) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:26,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1825 transitions. [2024-11-16 03:48:26,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-16 03:48:26,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:26,626 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-16 03:48:26,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 03:48:26,626 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:26,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:26,627 INFO L85 PathProgramCache]: Analyzing trace with hash 349811722, now seen corresponding path program 1 times [2024-11-16 03:48:26,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:26,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175466047] [2024-11-16 03:48:26,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:26,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:26,972 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 116 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:26,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:26,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175466047] [2024-11-16 03:48:26,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175466047] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:48:26,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154545983] [2024-11-16 03:48:26,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:26,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:48:26,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:48:26,976 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:48:26,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 03:48:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:27,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 03:48:27,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:48:27,243 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-16 03:48:27,247 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:48:27,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154545983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:27,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:48:27,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-16 03:48:27,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040620205] [2024-11-16 03:48:27,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:27,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:27,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:27,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:27,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:48:27,253 INFO L87 Difference]: Start difference. First operand 1545 states and 1825 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:27,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:27,742 INFO L93 Difference]: Finished difference Result 3648 states and 4293 transitions. [2024-11-16 03:48:27,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:27,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 254 [2024-11-16 03:48:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:27,749 INFO L225 Difference]: With dead ends: 3648 [2024-11-16 03:48:27,750 INFO L226 Difference]: Without dead ends: 2245 [2024-11-16 03:48:27,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:48:27,753 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 135 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:27,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 225 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:48:27,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2024-11-16 03:48:27,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 1965. [2024-11-16 03:48:27,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1964 states have (on average 1.1583503054989817) internal successors, (2275), 1964 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:27,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2275 transitions. [2024-11-16 03:48:27,786 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2275 transitions. Word has length 254 [2024-11-16 03:48:27,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:27,787 INFO L471 AbstractCegarLoop]: Abstraction has 1965 states and 2275 transitions. [2024-11-16 03:48:27,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:27,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2275 transitions. [2024-11-16 03:48:27,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-16 03:48:27,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:27,791 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-16 03:48:27,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 03:48:27,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:48:27,992 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:27,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:27,992 INFO L85 PathProgramCache]: Analyzing trace with hash 36126101, now seen corresponding path program 1 times [2024-11-16 03:48:27,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:27,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448782079] [2024-11-16 03:48:27,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:27,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:28,235 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-16 03:48:28,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:28,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448782079] [2024-11-16 03:48:28,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448782079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:28,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:28,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:48:28,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093547738] [2024-11-16 03:48:28,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:28,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:28,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:28,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:28,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:28,238 INFO L87 Difference]: Start difference. First operand 1965 states and 2275 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:28,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:28,736 INFO L93 Difference]: Finished difference Result 3788 states and 4404 transitions. [2024-11-16 03:48:28,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:28,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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 259 [2024-11-16 03:48:28,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:28,743 INFO L225 Difference]: With dead ends: 3788 [2024-11-16 03:48:28,744 INFO L226 Difference]: Without dead ends: 1965 [2024-11-16 03:48:28,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:28,747 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:28,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 220 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:48:28,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2024-11-16 03:48:28,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1825. [2024-11-16 03:48:28,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1825 states, 1824 states have (on average 1.124451754385965) internal successors, (2051), 1824 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:28,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2051 transitions. [2024-11-16 03:48:28,788 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2051 transitions. Word has length 259 [2024-11-16 03:48:28,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:28,789 INFO L471 AbstractCegarLoop]: Abstraction has 1825 states and 2051 transitions. [2024-11-16 03:48:28,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:28,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2051 transitions. [2024-11-16 03:48:28,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-16 03:48:28,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:28,794 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-16 03:48:28,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 03:48:28,794 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:28,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:28,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2046205275, now seen corresponding path program 1 times [2024-11-16 03:48:28,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:28,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480473460] [2024-11-16 03:48:28,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:28,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:29,154 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:29,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:29,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480473460] [2024-11-16 03:48:29,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480473460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:29,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:29,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:48:29,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015552693] [2024-11-16 03:48:29,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:29,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:48:29,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:29,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:48:29,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:48:29,157 INFO L87 Difference]: Start difference. First operand 1825 states and 2051 transitions. Second operand has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:29,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:29,757 INFO L93 Difference]: Finished difference Result 3928 states and 4431 transitions. [2024-11-16 03:48:29,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:48:29,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 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 260 [2024-11-16 03:48:29,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:29,765 INFO L225 Difference]: With dead ends: 3928 [2024-11-16 03:48:29,765 INFO L226 Difference]: Without dead ends: 2245 [2024-11-16 03:48:29,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:48:29,769 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 234 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:29,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 204 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 03:48:29,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2024-11-16 03:48:29,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2105. [2024-11-16 03:48:29,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2105 states, 2104 states have (on average 1.1150190114068441) internal successors, (2346), 2104 states have internal predecessors, (2346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 2346 transitions. [2024-11-16 03:48:29,808 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 2346 transitions. Word has length 260 [2024-11-16 03:48:29,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:29,808 INFO L471 AbstractCegarLoop]: Abstraction has 2105 states and 2346 transitions. [2024-11-16 03:48:29,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:29,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 2346 transitions. [2024-11-16 03:48:29,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-16 03:48:29,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:29,813 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-16 03:48:29,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 03:48:29,813 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:29,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:29,814 INFO L85 PathProgramCache]: Analyzing trace with hash 866260026, now seen corresponding path program 1 times [2024-11-16 03:48:29,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:29,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273834255] [2024-11-16 03:48:29,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:29,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:30,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:30,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273834255] [2024-11-16 03:48:30,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273834255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:30,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:30,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:48:30,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186696426] [2024-11-16 03:48:30,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:30,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:48:30,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:30,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:48:30,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:48:30,357 INFO L87 Difference]: Start difference. First operand 2105 states and 2346 transitions. Second operand has 4 states, 4 states have (on average 68.25) internal successors, (273), 4 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:30,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:30,946 INFO L93 Difference]: Finished difference Result 4488 states and 5021 transitions. [2024-11-16 03:48:30,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:48:30,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.25) internal successors, (273), 4 states have internal predecessors, (273), 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 273 [2024-11-16 03:48:30,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:30,954 INFO L225 Difference]: With dead ends: 4488 [2024-11-16 03:48:30,955 INFO L226 Difference]: Without dead ends: 2525 [2024-11-16 03:48:30,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:48:30,958 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 148 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:30,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 213 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 03:48:30,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2525 states. [2024-11-16 03:48:30,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2525 to 2385. [2024-11-16 03:48:30,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2385 states, 2384 states have (on average 1.1098993288590604) internal successors, (2646), 2384 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:30,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 2646 transitions. [2024-11-16 03:48:30,994 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 2646 transitions. Word has length 273 [2024-11-16 03:48:30,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:30,995 INFO L471 AbstractCegarLoop]: Abstraction has 2385 states and 2646 transitions. [2024-11-16 03:48:30,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.25) internal successors, (273), 4 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:30,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 2646 transitions. [2024-11-16 03:48:31,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-11-16 03:48:31,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:31,000 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-16 03:48:31,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 03:48:31,001 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:31,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:31,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1814024711, now seen corresponding path program 1 times [2024-11-16 03:48:31,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:31,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812350097] [2024-11-16 03:48:31,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:31,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:31,692 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:31,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:31,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812350097] [2024-11-16 03:48:31,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812350097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:31,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:31,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:48:31,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783396363] [2024-11-16 03:48:31,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:31,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:48:31,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:31,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:48:31,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:48:31,696 INFO L87 Difference]: Start difference. First operand 2385 states and 2646 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:32,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:32,456 INFO L93 Difference]: Finished difference Result 5888 states and 6564 transitions. [2024-11-16 03:48:32,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:48:32,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 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 291 [2024-11-16 03:48:32,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:32,467 INFO L225 Difference]: With dead ends: 5888 [2024-11-16 03:48:32,467 INFO L226 Difference]: Without dead ends: 3505 [2024-11-16 03:48:32,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:48:32,471 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 137 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:32,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 54 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 03:48:32,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3505 states. [2024-11-16 03:48:32,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3505 to 2805. [2024-11-16 03:48:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2805 states, 2804 states have (on average 1.109843081312411) internal successors, (3112), 2804 states have internal predecessors, (3112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:32,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 3112 transitions. [2024-11-16 03:48:32,514 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 3112 transitions. Word has length 291 [2024-11-16 03:48:32,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:32,514 INFO L471 AbstractCegarLoop]: Abstraction has 2805 states and 3112 transitions. [2024-11-16 03:48:32,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:32,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 3112 transitions. [2024-11-16 03:48:32,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-11-16 03:48:32,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:32,520 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1] [2024-11-16 03:48:32,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 03:48:32,521 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:32,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:32,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1361119573, now seen corresponding path program 1 times [2024-11-16 03:48:32,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:32,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624340998] [2024-11-16 03:48:32,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:32,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:32,695 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-16 03:48:32,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:32,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624340998] [2024-11-16 03:48:32,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624340998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:32,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:32,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:48:32,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838684548] [2024-11-16 03:48:32,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:32,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:32,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:32,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:32,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:32,699 INFO L87 Difference]: Start difference. First operand 2805 states and 3112 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:33,116 INFO L93 Difference]: Finished difference Result 6028 states and 6674 transitions. [2024-11-16 03:48:33,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:33,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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 309 [2024-11-16 03:48:33,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:33,124 INFO L225 Difference]: With dead ends: 6028 [2024-11-16 03:48:33,124 INFO L226 Difference]: Without dead ends: 2665 [2024-11-16 03:48:33,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:33,127 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 135 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:33,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 229 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:48:33,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2024-11-16 03:48:33,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 2665. [2024-11-16 03:48:33,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2665 states, 2664 states have (on average 1.0968468468468469) internal successors, (2922), 2664 states have internal predecessors, (2922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:33,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 2922 transitions. [2024-11-16 03:48:33,164 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 2922 transitions. Word has length 309 [2024-11-16 03:48:33,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:33,164 INFO L471 AbstractCegarLoop]: Abstraction has 2665 states and 2922 transitions. [2024-11-16 03:48:33,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:33,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 2922 transitions. [2024-11-16 03:48:33,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-16 03:48:33,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:33,170 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:48:33,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 03:48:33,170 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:33,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:33,171 INFO L85 PathProgramCache]: Analyzing trace with hash -307408273, now seen corresponding path program 1 times [2024-11-16 03:48:33,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:33,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628609876] [2024-11-16 03:48:33,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:33,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 03:48:33,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 03:48:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 03:48:33,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 03:48:33,362 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 03:48:33,363 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 03:48:33,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 03:48:33,367 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:48:33,511 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 03:48:33,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:48:33 BoogieIcfgContainer [2024-11-16 03:48:33,516 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 03:48:33,517 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 03:48:33,517 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 03:48:33,517 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 03:48:33,518 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:48:19" (3/4) ... [2024-11-16 03:48:33,519 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 03:48:33,683 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 03:48:33,684 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 03:48:33,684 INFO L158 Benchmark]: Toolchain (without parser) took 15807.34ms. Allocated memory was 176.2MB in the beginning and 488.6MB in the end (delta: 312.5MB). Free memory was 117.6MB in the beginning and 321.5MB in the end (delta: -203.9MB). Peak memory consumption was 110.7MB. Max. memory is 16.1GB. [2024-11-16 03:48:33,684 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 176.2MB. Free memory is still 137.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 03:48:33,685 INFO L158 Benchmark]: CACSL2BoogieTranslator took 554.73ms. Allocated memory is still 176.2MB. Free memory was 117.1MB in the beginning and 87.6MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-16 03:48:33,685 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.57ms. Allocated memory is still 176.2MB. Free memory was 87.6MB in the beginning and 79.1MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 03:48:33,686 INFO L158 Benchmark]: Boogie Preprocessor took 170.78ms. Allocated memory was 176.2MB in the beginning and 281.0MB in the end (delta: 104.9MB). Free memory was 79.1MB in the beginning and 241.2MB in the end (delta: -162.0MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2024-11-16 03:48:33,686 INFO L158 Benchmark]: IcfgBuilder took 1268.50ms. Allocated memory is still 281.0MB. Free memory was 241.2MB in the beginning and 146.8MB in the end (delta: 94.4MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. [2024-11-16 03:48:33,686 INFO L158 Benchmark]: TraceAbstraction took 13534.15ms. Allocated memory was 281.0MB in the beginning and 488.6MB in the end (delta: 207.6MB). Free memory was 145.8MB in the beginning and 344.5MB in the end (delta: -198.8MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2024-11-16 03:48:33,687 INFO L158 Benchmark]: Witness Printer took 167.08ms. Allocated memory is still 488.6MB. Free memory was 344.5MB in the beginning and 321.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-16 03:48:33,688 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.21ms. Allocated memory is still 176.2MB. Free memory is still 137.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 554.73ms. Allocated memory is still 176.2MB. Free memory was 117.1MB in the beginning and 87.6MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.57ms. Allocated memory is still 176.2MB. Free memory was 87.6MB in the beginning and 79.1MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 170.78ms. Allocated memory was 176.2MB in the beginning and 281.0MB in the end (delta: 104.9MB). Free memory was 79.1MB in the beginning and 241.2MB in the end (delta: -162.0MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1268.50ms. Allocated memory is still 281.0MB. Free memory was 241.2MB in the beginning and 146.8MB in the end (delta: 94.4MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13534.15ms. Allocated memory was 281.0MB in the beginning and 488.6MB in the end (delta: 207.6MB). Free memory was 145.8MB in the beginning and 344.5MB in the end (delta: -198.8MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Witness Printer took 167.08ms. Allocated memory is still 488.6MB. Free memory was 344.5MB in the beginning and 321.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * 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: 35]: 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; VAL [a10=0, a12=0, a19=9, a1=23, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [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] [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, EXPR calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, 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 [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L536] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L539] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L544] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L550] COND TRUE ((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0))) [L551] a1 = (((((a1 + -272193) - -47605) - -570122) % 89)+ 110) [L552] a10 = 1 [L554] return 25; VAL [\result=25, a10=1, a12=0, a19=9, a1=169, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) [L600] 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, EXPR calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, 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 [a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND TRUE ((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)))))) [L371] a1 = ((((a1 - 46038) + -455425) * 10)/ 9) [L372] a19 = 10 [L374] return 24; VAL [\result=24, a10=1, a12=0, a19=10, a1=-556993, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) [L600] 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, EXPR calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, 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 [a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND TRUE ((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0))) [L236] a1 = (((((a1 - 0) * 9)/ 10) % 25)- -12) [L237] a10 = 2 [L238] a19 = 8 [L240] return -1; VAL [\result=-1, a10=2, a12=0, a19=8, a1=-6, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) [L600] 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 [a10=2, a12=0, a19=8, a1=-6, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND TRUE (((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)) VAL [a10=2, a12=0, a19=8, a1=-6, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L35] reach_error() VAL [a10=2, a12=0, a19=8, a1=-6, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 209 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1764 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1764 mSDsluCounter, 1896 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 805 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5992 IncrementalHoareTripleChecker+Invalid, 6797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 805 mSolverCounterUnsat, 1790 mSDtfsCounter, 5992 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2805occurred in iteration=13, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 1680 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 3211 NumberOfCodeBlocks, 3211 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2884 ConstructedInterpolants, 0 QuantifiedInterpolants, 7785 SizeOfPredicates, 0 NumberOfNonLiveVariables, 359 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 1650/1656 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! [2024-11-16 03:48:33,732 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE