./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label28.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label28.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 bfdec3efb2e3689086e52b498036bfe20677fd5e46edd94f0588e543016085db --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 21:00:33,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 21:00:33,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 21:00:33,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 21:00:33,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 21:00:33,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 21:00:33,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 21:00:33,468 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 21:00:33,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 21:00:33,469 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 21:00:33,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 21:00:33,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 21:00:33,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 21:00:33,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 21:00:33,472 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 21:00:33,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 21:00:33,473 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 21:00:33,473 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 21:00:33,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 21:00:33,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 21:00:33,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 21:00:33,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 21:00:33,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 21:00:33,479 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 21:00:33,479 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 21:00:33,479 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 21:00:33,479 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 21:00:33,479 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 21:00:33,480 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 21:00:33,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 21:00:33,480 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 21:00:33,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 21:00:33,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:00:33,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 21:00:33,481 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 21:00:33,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 21:00:33,483 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 21:00:33,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 21:00:33,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 21:00:33,484 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 21:00:33,484 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 21:00:33,485 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 21:00:33,485 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 -> bfdec3efb2e3689086e52b498036bfe20677fd5e46edd94f0588e543016085db [2024-10-23 21:00:33,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 21:00:33,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 21:00:33,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 21:00:33,765 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 21:00:33,766 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 21:00:33,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label28.c [2024-10-23 21:00:35,170 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 21:00:35,435 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 21:00:35,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label28.c [2024-10-23 21:00:35,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f591625a/12bd242e14ab4976b4ad16f4c048fbab/FLAGd2f52cf89 [2024-10-23 21:00:35,469 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f591625a/12bd242e14ab4976b4ad16f4c048fbab [2024-10-23 21:00:35,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 21:00:35,473 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 21:00:35,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 21:00:35,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 21:00:35,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 21:00:35,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:00:35" (1/1) ... [2024-10-23 21:00:35,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@582893ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:00:35, skipping insertion in model container [2024-10-23 21:00:35,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:00:35" (1/1) ... [2024-10-23 21:00:35,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 21:00:35,717 WARN L248 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_label28.c[1526,1539] [2024-10-23 21:00:35,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:00:35,919 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 21:00:35,938 WARN L248 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_label28.c[1526,1539] [2024-10-23 21:00:36,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:00:36,042 INFO L204 MainTranslator]: Completed translation [2024-10-23 21:00:36,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:00:36 WrapperNode [2024-10-23 21:00:36,047 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 21:00:36,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 21:00:36,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 21:00:36,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 21:00:36,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:00:36" (1/1) ... [2024-10-23 21:00:36,074 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:00:36" (1/1) ... [2024-10-23 21:00:36,170 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-10-23 21:00:36,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 21:00:36,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 21:00:36,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 21:00:36,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 21:00:36,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:00:36" (1/1) ... [2024-10-23 21:00:36,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:00:36" (1/1) ... [2024-10-23 21:00:36,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:00:36" (1/1) ... [2024-10-23 21:00:36,244 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-10-23 21:00:36,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:00:36" (1/1) ... [2024-10-23 21:00:36,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:00:36" (1/1) ... [2024-10-23 21:00:36,265 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:00:36" (1/1) ... [2024-10-23 21:00:36,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:00:36" (1/1) ... [2024-10-23 21:00:36,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:00:36" (1/1) ... [2024-10-23 21:00:36,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:00:36" (1/1) ... [2024-10-23 21:00:36,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 21:00:36,292 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 21:00:36,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 21:00:36,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 21:00:36,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:00:36" (1/1) ... [2024-10-23 21:00:36,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:00:36,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:00:36,333 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-10-23 21:00:36,337 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-10-23 21:00:36,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 21:00:36,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 21:00:36,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 21:00:36,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 21:00:36,458 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 21:00:36,460 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 21:00:37,533 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-23 21:00:37,533 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 21:00:37,590 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 21:00:37,590 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 21:00:37,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:00:37 BoogieIcfgContainer [2024-10-23 21:00:37,592 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 21:00:37,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 21:00:37,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 21:00:37,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 21:00:37,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 09:00:35" (1/3) ... [2024-10-23 21:00:37,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415d0bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:00:37, skipping insertion in model container [2024-10-23 21:00:37,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:00:36" (2/3) ... [2024-10-23 21:00:37,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415d0bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:00:37, skipping insertion in model container [2024-10-23 21:00:37,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:00:37" (3/3) ... [2024-10-23 21:00:37,603 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label28.c [2024-10-23 21:00:37,620 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 21:00:37,620 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 21:00:37,693 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 21:00:37,702 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;@774acaef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 21:00:37,703 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 21:00:37,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:00:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-23 21:00:37,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:00:37,715 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:00:37,715 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:00:37,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:00:37,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1682269004, now seen corresponding path program 1 times [2024-10-23 21:00:37,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:00:37,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545475547] [2024-10-23 21:00:37,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:00:37,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:00:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:00:37,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:00:37,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:00:37,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545475547] [2024-10-23 21:00:37,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545475547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:00:37,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:00:37,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:00:37,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59780890] [2024-10-23 21:00:37,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:00:37,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 21:00:37,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:00:37,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 21:00:37,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 21:00:37,941 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:00:37,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:00:37,987 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2024-10-23 21:00:37,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 21:00:37,989 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-23 21:00:37,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:00:38,001 INFO L225 Difference]: With dead ends: 287 [2024-10-23 21:00:38,001 INFO L226 Difference]: Without dead ends: 142 [2024-10-23 21:00:38,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 21:00:38,049 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 21:00:38,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 21:00:38,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-23 21:00:38,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-23 21:00:38,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:00:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-23 21:00:38,100 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 10 [2024-10-23 21:00:38,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:00:38,100 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-23 21:00:38,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:00:38,101 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-23 21:00:38,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-23 21:00:38,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:00:38,101 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:00:38,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 21:00:38,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:00:38,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:00:38,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1145130230, now seen corresponding path program 1 times [2024-10-23 21:00:38,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:00:38,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346438551] [2024-10-23 21:00:38,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:00:38,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:00:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:00:38,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:00:38,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:00:38,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346438551] [2024-10-23 21:00:38,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346438551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:00:38,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:00:38,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:00:38,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083056523] [2024-10-23 21:00:38,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:00:38,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:00:38,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:00:38,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:00:38,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:00:38,204 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:00:38,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:00:38,850 INFO L93 Difference]: Finished difference Result 283 states and 433 transitions. [2024-10-23 21:00:38,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:00:38,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-23 21:00:38,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:00:38,853 INFO L225 Difference]: With dead ends: 283 [2024-10-23 21:00:38,853 INFO L226 Difference]: Without dead ends: 281 [2024-10-23 21:00:38,854 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-10-23 21:00:38,858 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 173 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:00:38,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 9 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:00:38,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-23 21:00:38,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-23 21:00:38,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.5392857142857144) internal successors, (431), 280 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:00:38,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 431 transitions. [2024-10-23 21:00:38,880 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 431 transitions. Word has length 10 [2024-10-23 21:00:38,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:00:38,881 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 431 transitions. [2024-10-23 21:00:38,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:00:38,881 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 431 transitions. [2024-10-23 21:00:38,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-23 21:00:38,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:00:38,883 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:00:38,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 21:00:38,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:00:38,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:00:38,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1892634588, now seen corresponding path program 1 times [2024-10-23 21:00:38,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:00:38,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129497709] [2024-10-23 21:00:38,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:00:38,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:00:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:00:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:00:39,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:00:39,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129497709] [2024-10-23 21:00:39,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129497709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:00:39,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:00:39,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:00:39,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999994453] [2024-10-23 21:00:39,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:00:39,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:00:39,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:00:39,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:00:39,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:00:39,329 INFO L87 Difference]: Start difference. First operand 281 states and 431 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-10-23 21:00:39,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:00:39,897 INFO L93 Difference]: Finished difference Result 700 states and 1075 transitions. [2024-10-23 21:00:39,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:00:39,898 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-10-23 21:00:39,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:00:39,901 INFO L225 Difference]: With dead ends: 700 [2024-10-23 21:00:39,901 INFO L226 Difference]: Without dead ends: 420 [2024-10-23 21:00:39,902 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-10-23 21:00:39,903 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 73 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:00:39,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 50 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:00:39,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-23 21:00:39,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-10-23 21:00:39,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.4439140811455846) internal successors, (605), 419 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:00:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 605 transitions. [2024-10-23 21:00:39,923 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 605 transitions. Word has length 79 [2024-10-23 21:00:39,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:00:39,923 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 605 transitions. [2024-10-23 21:00:39,924 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-10-23 21:00:39,924 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 605 transitions. [2024-10-23 21:00:39,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-23 21:00:39,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:00:39,926 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:00:39,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 21:00:39,927 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:00:39,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:00:39,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1132990227, now seen corresponding path program 1 times [2024-10-23 21:00:39,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:00:39,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107843565] [2024-10-23 21:00:39,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:00:39,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:00:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:00:40,069 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:00:40,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:00:40,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107843565] [2024-10-23 21:00:40,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107843565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:00:40,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:00:40,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:00:40,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896039373] [2024-10-23 21:00:40,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:00:40,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:00:40,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:00:40,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:00:40,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:00:40,072 INFO L87 Difference]: Start difference. First operand 420 states and 605 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-10-23 21:00:40,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:00:40,543 INFO L93 Difference]: Finished difference Result 561 states and 821 transitions. [2024-10-23 21:00:40,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:00:40,544 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-10-23 21:00:40,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:00:40,546 INFO L225 Difference]: With dead ends: 561 [2024-10-23 21:00:40,547 INFO L226 Difference]: Without dead ends: 559 [2024-10-23 21:00:40,547 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-10-23 21:00:40,549 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 172 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:00:40,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 9 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 21:00:40,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-23 21:00:40,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 420. [2024-10-23 21:00:40,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.4439140811455846) internal successors, (605), 419 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:00:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 605 transitions. [2024-10-23 21:00:40,571 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 605 transitions. Word has length 85 [2024-10-23 21:00:40,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:00:40,572 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 605 transitions. [2024-10-23 21:00:40,572 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-10-23 21:00:40,573 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 605 transitions. [2024-10-23 21:00:40,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-23 21:00:40,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:00:40,579 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:00:40,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 21:00:40,579 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:00:40,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:00:40,580 INFO L85 PathProgramCache]: Analyzing trace with hash 305937039, now seen corresponding path program 1 times [2024-10-23 21:00:40,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:00:40,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4241421] [2024-10-23 21:00:40,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:00:40,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:00:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:00:40,718 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:00:40,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:00:40,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4241421] [2024-10-23 21:00:40,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4241421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:00:40,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:00:40,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:00:40,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477897226] [2024-10-23 21:00:40,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:00:40,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:00:40,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:00:40,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:00:40,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:00:40,722 INFO L87 Difference]: Start difference. First operand 420 states and 605 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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-10-23 21:00:41,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:00:41,135 INFO L93 Difference]: Finished difference Result 1117 states and 1638 transitions. [2024-10-23 21:00:41,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:00:41,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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 104 [2024-10-23 21:00:41,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:00:41,138 INFO L225 Difference]: With dead ends: 1117 [2024-10-23 21:00:41,139 INFO L226 Difference]: Without dead ends: 698 [2024-10-23 21:00:41,140 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-10-23 21:00:41,141 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 51 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:00:41,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 75 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 21:00:41,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-23 21:00:41,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 559. [2024-10-23 21:00:41,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3243727598566308) internal successors, (739), 558 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:00:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 739 transitions. [2024-10-23 21:00:41,158 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 739 transitions. Word has length 104 [2024-10-23 21:00:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:00:41,159 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 739 transitions. [2024-10-23 21:00:41,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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-10-23 21:00:41,160 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 739 transitions. [2024-10-23 21:00:41,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-23 21:00:41,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:00:41,167 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:00:41,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 21:00:41,168 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:00:41,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:00:41,168 INFO L85 PathProgramCache]: Analyzing trace with hash 432756939, now seen corresponding path program 1 times [2024-10-23 21:00:41,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:00:41,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156733346] [2024-10-23 21:00:41,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:00:41,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:00:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:00:41,541 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:00:41,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:00:41,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156733346] [2024-10-23 21:00:41,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156733346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:00:41,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:00:41,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:00:41,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674879308] [2024-10-23 21:00:41,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:00:41,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:00:41,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:00:41,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:00:41,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:00:41,544 INFO L87 Difference]: Start difference. First operand 559 states and 739 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:00:42,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:00:42,078 INFO L93 Difference]: Finished difference Result 978 states and 1328 transitions. [2024-10-23 21:00:42,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:00:42,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2024-10-23 21:00:42,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:00:42,081 INFO L225 Difference]: With dead ends: 978 [2024-10-23 21:00:42,081 INFO L226 Difference]: Without dead ends: 559 [2024-10-23 21:00:42,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-23 21:00:42,083 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 87 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:00:42,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 83 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:00:42,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-23 21:00:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2024-10-23 21:00:42,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3154121863799284) internal successors, (734), 558 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:00:42,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 734 transitions. [2024-10-23 21:00:42,095 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 734 transitions. Word has length 128 [2024-10-23 21:00:42,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:00:42,096 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 734 transitions. [2024-10-23 21:00:42,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:00:42,096 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 734 transitions. [2024-10-23 21:00:42,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-23 21:00:42,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:00:42,098 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:00:42,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 21:00:42,098 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:00:42,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:00:42,099 INFO L85 PathProgramCache]: Analyzing trace with hash 309699450, now seen corresponding path program 1 times [2024-10-23 21:00:42,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:00:42,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984058923] [2024-10-23 21:00:42,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:00:42,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:00:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:00:42,247 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:00:42,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:00:42,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984058923] [2024-10-23 21:00:42,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984058923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:00:42,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:00:42,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:00:42,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187704984] [2024-10-23 21:00:42,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:00:42,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:00:42,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:00:42,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:00:42,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:00:42,252 INFO L87 Difference]: Start difference. First operand 559 states and 734 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-10-23 21:00:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:00:42,736 INFO L93 Difference]: Finished difference Result 1256 states and 1752 transitions. [2024-10-23 21:00:42,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:00:42,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 154 [2024-10-23 21:00:42,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:00:42,740 INFO L225 Difference]: With dead ends: 1256 [2024-10-23 21:00:42,740 INFO L226 Difference]: Without dead ends: 837 [2024-10-23 21:00:42,741 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-10-23 21:00:42,742 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 67 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:00:42,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 211 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:00:42,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-23 21:00:42,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2024-10-23 21:00:42,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.235645933014354) internal successors, (1033), 836 states have internal predecessors, (1033), 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-10-23 21:00:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1033 transitions. [2024-10-23 21:00:42,779 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1033 transitions. Word has length 154 [2024-10-23 21:00:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:00:42,780 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1033 transitions. [2024-10-23 21:00:42,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-10-23 21:00:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1033 transitions. [2024-10-23 21:00:42,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-23 21:00:42,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:00:42,783 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:00:42,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 21:00:42,784 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:00:42,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:00:42,784 INFO L85 PathProgramCache]: Analyzing trace with hash -195147324, now seen corresponding path program 1 times [2024-10-23 21:00:42,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:00:42,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650759134] [2024-10-23 21:00:42,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:00:42,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:00:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:00:43,132 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:00:43,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:00:43,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650759134] [2024-10-23 21:00:43,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650759134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:00:43,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:00:43,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-23 21:00:43,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782200060] [2024-10-23 21:00:43,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:00:43,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-23 21:00:43,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:00:43,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-23 21:00:43,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:00:43,136 INFO L87 Difference]: Start difference. First operand 837 states and 1033 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 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-10-23 21:00:43,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:00:43,613 INFO L93 Difference]: Finished difference Result 1589 states and 1976 transitions. [2024-10-23 21:00:43,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-23 21:00:43,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 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-10-23 21:00:43,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:00:43,617 INFO L225 Difference]: With dead ends: 1589 [2024-10-23 21:00:43,617 INFO L226 Difference]: Without dead ends: 837 [2024-10-23 21:00:43,618 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-10-23 21:00:43,619 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:00:43,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 14 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 21:00:43,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-23 21:00:43,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2024-10-23 21:00:43,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.2308612440191387) internal successors, (1029), 836 states have internal predecessors, (1029), 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-10-23 21:00:43,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1029 transitions. [2024-10-23 21:00:43,644 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1029 transitions. Word has length 163 [2024-10-23 21:00:43,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:00:43,644 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1029 transitions. [2024-10-23 21:00:43,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 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-10-23 21:00:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1029 transitions. [2024-10-23 21:00:43,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-23 21:00:43,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:00:43,647 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-23 21:00:43,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-23 21:00:43,648 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:00:43,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:00:43,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1691781598, now seen corresponding path program 1 times [2024-10-23 21:00:43,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:00:43,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511879717] [2024-10-23 21:00:43,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:00:43,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:00:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:00:43,823 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:00:43,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:00:43,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511879717] [2024-10-23 21:00:43,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511879717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:00:43,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:00:43,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:00:43,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653259548] [2024-10-23 21:00:43,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:00:43,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:00:43,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:00:43,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:00:43,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:00:43,827 INFO L87 Difference]: Start difference. First operand 837 states and 1029 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-10-23 21:00:44,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:00:44,311 INFO L93 Difference]: Finished difference Result 1812 states and 2341 transitions. [2024-10-23 21:00:44,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:00:44,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 199 [2024-10-23 21:00:44,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:00:44,320 INFO L225 Difference]: With dead ends: 1812 [2024-10-23 21:00:44,320 INFO L226 Difference]: Without dead ends: 1115 [2024-10-23 21:00:44,321 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-10-23 21:00:44,322 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 75 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:00:44,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 187 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:00:44,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2024-10-23 21:00:44,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 976. [2024-10-23 21:00:44,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.2338461538461538) internal successors, (1203), 975 states have internal predecessors, (1203), 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-10-23 21:00:44,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1203 transitions. [2024-10-23 21:00:44,342 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1203 transitions. Word has length 199 [2024-10-23 21:00:44,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:00:44,343 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1203 transitions. [2024-10-23 21:00:44,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-10-23 21:00:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1203 transitions. [2024-10-23 21:00:44,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-10-23 21:00:44,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:00:44,346 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:00:44,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-23 21:00:44,347 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:00:44,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:00:44,347 INFO L85 PathProgramCache]: Analyzing trace with hash -434060675, now seen corresponding path program 1 times [2024-10-23 21:00:44,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:00:44,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098672045] [2024-10-23 21:00:44,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:00:44,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:00:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:00:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 32 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:00:44,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:00:44,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098672045] [2024-10-23 21:00:44,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098672045] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:00:44,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160117112] [2024-10-23 21:00:44,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:00:44,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:00:44,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:00:44,765 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-10-23 21:00:44,766 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-10-23 21:00:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:00:44,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 21:00:44,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:00:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-23 21:00:45,222 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:00:45,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160117112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:00:45,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:00:45,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-23 21:00:45,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81062618] [2024-10-23 21:00:45,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:00:45,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:00:45,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:00:45,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:00:45,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:00:45,227 INFO L87 Difference]: Start difference. First operand 976 states and 1203 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:00:45,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:00:45,674 INFO L93 Difference]: Finished difference Result 2090 states and 2594 transitions. [2024-10-23 21:00:45,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:00:45,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 237 [2024-10-23 21:00:45,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:00:45,678 INFO L225 Difference]: With dead ends: 2090 [2024-10-23 21:00:45,678 INFO L226 Difference]: Without dead ends: 1254 [2024-10-23 21:00:45,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:00:45,680 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 60 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:00:45,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 32 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 21:00:45,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-10-23 21:00:45,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1254. [2024-10-23 21:00:45,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.1612130885873904) internal successors, (1455), 1253 states have internal predecessors, (1455), 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-10-23 21:00:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1455 transitions. [2024-10-23 21:00:45,724 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1455 transitions. Word has length 237 [2024-10-23 21:00:45,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:00:45,724 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1455 transitions. [2024-10-23 21:00:45,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:00:45,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1455 transitions. [2024-10-23 21:00:45,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2024-10-23 21:00:45,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:00:45,728 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-23 21:00:45,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-23 21:00:45,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-23 21:00:45,933 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:00:45,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:00:45,933 INFO L85 PathProgramCache]: Analyzing trace with hash 37255024, now seen corresponding path program 1 times [2024-10-23 21:00:45,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:00:45,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351330262] [2024-10-23 21:00:45,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:00:45,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:00:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:00:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-10-23 21:00:46,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:00:46,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351330262] [2024-10-23 21:00:46,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351330262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:00:46,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:00:46,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:00:46,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904376447] [2024-10-23 21:00:46,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:00:46,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:00:46,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:00:46,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:00:46,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:00:46,182 INFO L87 Difference]: Start difference. First operand 1254 states and 1455 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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-10-23 21:00:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:00:46,745 INFO L93 Difference]: Finished difference Result 3202 states and 3729 transitions. [2024-10-23 21:00:46,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:00:46,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 288 [2024-10-23 21:00:46,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:00:46,753 INFO L225 Difference]: With dead ends: 3202 [2024-10-23 21:00:46,754 INFO L226 Difference]: Without dead ends: 2088 [2024-10-23 21:00:46,755 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-10-23 21:00:46,756 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:00:46,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 192 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:00:46,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2024-10-23 21:00:46,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1671. [2024-10-23 21:00:46,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1670 states have (on average 1.168263473053892) internal successors, (1951), 1670 states have internal predecessors, (1951), 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-10-23 21:00:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 1951 transitions. [2024-10-23 21:00:46,795 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 1951 transitions. Word has length 288 [2024-10-23 21:00:46,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:00:46,796 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 1951 transitions. [2024-10-23 21:00:46,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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-10-23 21:00:46,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 1951 transitions. [2024-10-23 21:00:46,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2024-10-23 21:00:46,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:00:46,801 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:00:46,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-23 21:00:46,801 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:00:46,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:00:46,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1801101781, now seen corresponding path program 1 times [2024-10-23 21:00:46,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:00:46,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640419155] [2024-10-23 21:00:46,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:00:46,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:00:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:00:46,990 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-23 21:00:46,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:00:46,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640419155] [2024-10-23 21:00:46,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640419155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:00:46,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:00:46,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:00:46,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581150272] [2024-10-23 21:00:46,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:00:46,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:00:46,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:00:46,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:00:46,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:00:46,993 INFO L87 Difference]: Start difference. First operand 1671 states and 1951 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-10-23 21:00:47,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:00:47,549 INFO L93 Difference]: Finished difference Result 3897 states and 4556 transitions. [2024-10-23 21:00:47,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:00:47,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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 305 [2024-10-23 21:00:47,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:00:47,558 INFO L225 Difference]: With dead ends: 3897 [2024-10-23 21:00:47,558 INFO L226 Difference]: Without dead ends: 2366 [2024-10-23 21:00:47,561 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-10-23 21:00:47,562 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:00:47,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 202 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:00:47,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2024-10-23 21:00:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 2366. [2024-10-23 21:00:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 2365 states have (on average 1.1463002114164904) internal successors, (2711), 2365 states have internal predecessors, (2711), 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-10-23 21:00:47,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 2711 transitions. [2024-10-23 21:00:47,620 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 2711 transitions. Word has length 305 [2024-10-23 21:00:47,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:00:47,621 INFO L471 AbstractCegarLoop]: Abstraction has 2366 states and 2711 transitions. [2024-10-23 21:00:47,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-10-23 21:00:47,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 2711 transitions. [2024-10-23 21:00:47,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-10-23 21:00:47,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:00:47,629 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:00:47,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-23 21:00:47,630 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:00:47,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:00:47,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1277032886, now seen corresponding path program 1 times [2024-10-23 21:00:47,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:00:47,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210814067] [2024-10-23 21:00:47,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:00:47,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:00:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:00:47,873 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-10-23 21:00:47,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:00:47,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210814067] [2024-10-23 21:00:47,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210814067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:00:47,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:00:47,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:00:47,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350226869] [2024-10-23 21:00:47,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:00:47,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:00:47,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:00:47,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:00:47,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:00:47,876 INFO L87 Difference]: Start difference. First operand 2366 states and 2711 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:00:48,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:00:48,366 INFO L93 Difference]: Finished difference Result 4731 states and 5426 transitions. [2024-10-23 21:00:48,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:00:48,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 309 [2024-10-23 21:00:48,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:00:48,375 INFO L225 Difference]: With dead ends: 4731 [2024-10-23 21:00:48,375 INFO L226 Difference]: Without dead ends: 2227 [2024-10-23 21:00:48,377 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-10-23 21:00:48,378 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 131 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:00:48,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 222 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:00:48,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2024-10-23 21:00:48,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2227. [2024-10-23 21:00:48,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2227 states, 2226 states have (on average 1.1302785265049415) internal successors, (2516), 2226 states have internal predecessors, (2516), 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-10-23 21:00:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2227 states to 2227 states and 2516 transitions. [2024-10-23 21:00:48,420 INFO L78 Accepts]: Start accepts. Automaton has 2227 states and 2516 transitions. Word has length 309 [2024-10-23 21:00:48,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:00:48,421 INFO L471 AbstractCegarLoop]: Abstraction has 2227 states and 2516 transitions. [2024-10-23 21:00:48,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:00:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2227 states and 2516 transitions. [2024-10-23 21:00:48,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2024-10-23 21:00:48,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:00:48,427 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:00:48,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-23 21:00:48,428 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:00:48,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:00:48,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1660205563, now seen corresponding path program 1 times [2024-10-23 21:00:48,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:00:48,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239671818] [2024-10-23 21:00:48,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:00:48,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:00:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-23 21:00:48,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-23 21:00:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-23 21:00:48,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-23 21:00:48,667 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-23 21:00:48,668 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 21:00:48,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-23 21:00:48,673 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:00:48,805 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 21:00:48,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 09:00:48 BoogieIcfgContainer [2024-10-23 21:00:48,810 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 21:00:48,810 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 21:00:48,810 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 21:00:48,811 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 21:00:48,811 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:00:37" (3/4) ... [2024-10-23 21:00:48,812 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-23 21:00:48,928 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 21:00:48,928 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 21:00:48,929 INFO L158 Benchmark]: Toolchain (without parser) took 13456.34ms. Allocated memory was 125.8MB in the beginning and 325.1MB in the end (delta: 199.2MB). Free memory was 70.6MB in the beginning and 151.7MB in the end (delta: -81.1MB). Peak memory consumption was 121.2MB. Max. memory is 16.1GB. [2024-10-23 21:00:48,929 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 125.8MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 21:00:48,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 571.19ms. Allocated memory was 125.8MB in the beginning and 161.5MB in the end (delta: 35.7MB). Free memory was 70.3MB in the beginning and 129.4MB in the end (delta: -59.1MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2024-10-23 21:00:48,930 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.51ms. Allocated memory is still 161.5MB. Free memory was 129.4MB in the beginning and 124.8MB in the end (delta: 4.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-23 21:00:48,930 INFO L158 Benchmark]: Boogie Preprocessor took 119.03ms. Allocated memory is still 161.5MB. Free memory was 124.8MB in the beginning and 114.4MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-23 21:00:48,930 INFO L158 Benchmark]: RCFGBuilder took 1299.38ms. Allocated memory is still 161.5MB. Free memory was 114.4MB in the beginning and 77.2MB in the end (delta: 37.2MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-10-23 21:00:48,930 INFO L158 Benchmark]: TraceAbstraction took 11214.22ms. Allocated memory was 161.5MB in the beginning and 325.1MB in the end (delta: 163.6MB). Free memory was 76.2MB in the beginning and 175.8MB in the end (delta: -99.6MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. [2024-10-23 21:00:48,931 INFO L158 Benchmark]: Witness Printer took 118.04ms. Allocated memory is still 325.1MB. Free memory was 175.8MB in the beginning and 151.7MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-23 21:00:48,932 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.18ms. Allocated memory is still 125.8MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 571.19ms. Allocated memory was 125.8MB in the beginning and 161.5MB in the end (delta: 35.7MB). Free memory was 70.3MB in the beginning and 129.4MB in the end (delta: -59.1MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 123.51ms. Allocated memory is still 161.5MB. Free memory was 129.4MB in the beginning and 124.8MB in the end (delta: 4.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 119.03ms. Allocated memory is still 161.5MB. Free memory was 124.8MB in the beginning and 114.4MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1299.38ms. Allocated memory is still 161.5MB. Free memory was 114.4MB in the beginning and 77.2MB in the end (delta: 37.2MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11214.22ms. Allocated memory was 161.5MB in the beginning and 325.1MB in the end (delta: 163.6MB). Free memory was 76.2MB in the beginning and 175.8MB in the end (delta: -99.6MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. * Witness Printer took 118.04ms. Allocated memory is still 325.1MB. Free memory was 175.8MB in the beginning and 151.7MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. 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: 47]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputC = 3; [L18] int inputD = 4; [L19] int inputE = 5; [L20] int inputF = 6; [L21] int inputB = 2; [L24] int a1 = 23; [L25] int a19 = 9; [L26] int a10 = 0; [L27] int a12 = 0; [L28] int a4 = 14; [L589] int output = -1; VAL [a10=0, a12=0, a19=9, a1=23, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [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=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L435] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L436] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L437] a10 = 1 [L439] return 25; VAL [\result=25, a10=1, a12=0, a19=9, a1=505232, 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=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND TRUE ((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 ))) [L297] a1 = ((((((a1 % 89)+ 74) - -21) * 5) % 89)- -118) [L298] a19 = 10 [L300] return 25; VAL [\result=25, a10=1, a12=0, a19=10, a1=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, 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=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, 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=10, a1=132, a4=14, input=5, 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=10, a1=132, a4=14, input=5, 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=10, a1=132, a4=14, input=5, 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=10, a1=132, a4=14, input=5, 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=1, a12=0, a19=10, a1=132, a4=14, input=5, 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=1, a12=0, a19=10, a1=132, a4=14, input=5, 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=1, a12=0, a19=10, a1=132, a4=14, input=5, 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=1, a12=0, a19=10, a1=132, a4=14, input=5, 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=1, a12=0, a19=10, a1=132, a4=14, input=5, 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=1, a12=0, a19=10, a1=132, a4=14, input=5, 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=1, a12=0, a19=10, a1=132, a4=14, input=5, 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=1, a12=0, a19=10, a1=132, a4=14, input=5, 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=1, a12=0, a19=10, a1=132, a4=14, input=5, 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=1, a12=0, a19=10, a1=132, a4=14, input=5, 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=1, a12=0, a19=10, a1=132, a4=14, input=5, 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=1, a12=0, a19=10, a1=132, a4=14, input=5, 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=1, a12=0, a19=10, a1=132, a4=14, input=5, 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=1, a12=0, a19=10, a1=132, a4=14, input=5, 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=1, a12=0, a19=10, a1=132, a4=14, input=5, 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=1, a12=0, a19=10, a1=132, a4=14, input=5, 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=1, a12=0, a19=10, a1=132, a4=14, input=5, 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=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND TRUE (((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1)) [L465] a1 = ((((a1 + 381077) % 25)- -1) / 5) [L466] a10 = 2 [L467] a19 = 7 [L469] return -1; VAL [\result=-1, a10=2, a12=0, a19=7, a1=2, 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=7, a1=2, 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=2, a12=0, a19=7, a1=2, 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=2, a12=0, a19=7, a1=2, 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=2, a12=0, a19=7, a1=2, 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=2, a12=0, a19=7, a1=2, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND TRUE (((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)) VAL [a10=2, a12=0, a19=7, a1=2, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] reach_error() VAL [a10=2, a12=0, a19=7, a1=2, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1193 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1193 mSDsluCounter, 1503 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 642 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4695 IncrementalHoareTripleChecker+Invalid, 5337 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 642 mSolverCounterUnsat, 1451 mSDtfsCounter, 4695 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2366occurred in iteration=12, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 834 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2626 NumberOfCodeBlocks, 2626 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2294 ConstructedInterpolants, 0 QuantifiedInterpolants, 7851 SizeOfPredicates, 0 NumberOfNonLiveVariables, 342 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 1274/1369 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-10-23 21:00:48,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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