java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label29_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 11:43:43,263 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 11:43:43,265 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 11:43:43,277 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 11:43:43,278 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 11:43:43,279 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 11:43:43,280 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 11:43:43,282 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 11:43:43,284 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 11:43:43,285 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 11:43:43,286 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 11:43:43,286 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 11:43:43,287 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 11:43:43,288 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 11:43:43,289 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 11:43:43,290 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 11:43:43,291 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 11:43:43,293 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 11:43:43,297 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 11:43:43,299 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 11:43:43,303 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 11:43:43,307 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 11:43:43,310 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 11:43:43,311 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 11:43:43,311 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 11:43:43,312 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 11:43:43,316 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 11:43:43,317 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 11:43:43,322 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 11:43:43,324 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 11:43:43,324 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 11:43:43,324 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 11:43:43,325 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 11:43:43,325 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 11:43:43,326 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 11:43:43,332 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 11:43:43,332 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-07-24 11:43:43,359 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 11:43:43,359 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 11:43:43,360 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 11:43:43,363 INFO L133 SettingsManager]: * User list type=DISABLED [2018-07-24 11:43:43,363 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-07-24 11:43:43,363 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-07-24 11:43:43,363 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-07-24 11:43:43,363 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-07-24 11:43:43,364 INFO L133 SettingsManager]: * Log string format=TERM [2018-07-24 11:43:43,364 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-07-24 11:43:43,364 INFO L133 SettingsManager]: * Interval Domain=false [2018-07-24 11:43:43,365 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 11:43:43,365 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 11:43:43,365 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 11:43:43,366 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 11:43:43,366 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 11:43:43,366 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 11:43:43,367 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 11:43:43,367 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 11:43:43,367 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 11:43:43,367 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 11:43:43,368 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 11:43:43,368 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 11:43:43,369 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 11:43:43,369 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 11:43:43,369 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 11:43:43,369 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 11:43:43,369 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-07-24 11:43:43,370 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 11:43:43,370 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 11:43:43,370 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 11:43:43,370 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 11:43:43,371 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-07-24 11:43:43,443 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 11:43:43,456 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 11:43:43,460 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 11:43:43,462 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 11:43:43,462 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 11:43:43,463 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label29_false-unreach-call.c [2018-07-24 11:43:43,814 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e740e85cb/9f45544ea5be48499d74f4f022e4d3ed/FLAG6770cd075 [2018-07-24 11:43:44,110 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 11:43:44,114 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label29_false-unreach-call.c [2018-07-24 11:43:44,135 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e740e85cb/9f45544ea5be48499d74f4f022e4d3ed/FLAG6770cd075 [2018-07-24 11:43:44,155 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e740e85cb/9f45544ea5be48499d74f4f022e4d3ed [2018-07-24 11:43:44,167 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 11:43:44,168 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 11:43:44,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 11:43:44,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 11:43:44,176 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 11:43:44,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 11:43:44" (1/1) ... [2018-07-24 11:43:44,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26bc4887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:44, skipping insertion in model container [2018-07-24 11:43:44,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 11:43:44" (1/1) ... [2018-07-24 11:43:44,386 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 11:43:44,635 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 11:43:44,651 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 11:43:44,830 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 11:43:44,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:44 WrapperNode [2018-07-24 11:43:44,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 11:43:44,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 11:43:44,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 11:43:44,885 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 11:43:44,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:44" (1/1) ... [2018-07-24 11:43:44,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:44" (1/1) ... [2018-07-24 11:43:44,988 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 11:43:44,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 11:43:44,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 11:43:44,989 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 11:43:45,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:44" (1/1) ... [2018-07-24 11:43:45,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:44" (1/1) ... [2018-07-24 11:43:45,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:44" (1/1) ... [2018-07-24 11:43:45,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:44" (1/1) ... [2018-07-24 11:43:45,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:44" (1/1) ... [2018-07-24 11:43:45,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:44" (1/1) ... [2018-07-24 11:43:45,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:44" (1/1) ... [2018-07-24 11:43:45,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 11:43:45,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 11:43:45,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 11:43:45,243 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 11:43:45,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 11:43:45,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-07-24 11:43:45,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-07-24 11:43:45,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 11:43:45,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 11:43:45,320 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-24 11:43:45,320 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-24 11:43:45,321 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_output [2018-07-24 11:43:45,321 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_output [2018-07-24 11:43:49,820 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 11:43:49,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 11:43:49 BoogieIcfgContainer [2018-07-24 11:43:49,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 11:43:49,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 11:43:49,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 11:43:49,826 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 11:43:49,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 11:43:44" (1/3) ... [2018-07-24 11:43:49,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f931315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 11:43:49, skipping insertion in model container [2018-07-24 11:43:49,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:44" (2/3) ... [2018-07-24 11:43:49,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f931315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 11:43:49, skipping insertion in model container [2018-07-24 11:43:49,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 11:43:49" (3/3) ... [2018-07-24 11:43:49,831 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label29_false-unreach-call.c [2018-07-24 11:43:49,842 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 11:43:49,852 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 11:43:49,929 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 11:43:49,930 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 11:43:49,931 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 11:43:49,931 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 11:43:49,931 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 11:43:49,931 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 11:43:49,933 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 11:43:49,933 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 11:43:49,933 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 11:43:49,975 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-07-24 11:43:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-24 11:43:49,990 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 11:43:49,992 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 11:43:49,992 INFO L414 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 11:43:49,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1981720604, now seen corresponding path program 1 times [2018-07-24 11:43:50,004 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 11:43:50,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:43:50,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:43:50,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:43:50,073 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 11:43:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:43:50,464 WARN L169 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 11:43:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 11:43:50,581 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 11:43:50,581 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 11:43:50,582 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 11:43:50,588 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 11:43:50,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 11:43:50,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 11:43:50,608 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-07-24 11:43:52,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 11:43:52,154 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-07-24 11:43:52,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 11:43:52,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-07-24 11:43:52,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 11:43:52,178 INFO L225 Difference]: With dead ends: 574 [2018-07-24 11:43:52,179 INFO L226 Difference]: Without dead ends: 356 [2018-07-24 11:43:52,185 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 11:43:52,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-07-24 11:43:52,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-07-24 11:43:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-07-24 11:43:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-07-24 11:43:52,271 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 22 [2018-07-24 11:43:52,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 11:43:52,272 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-07-24 11:43:52,272 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 11:43:52,272 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-07-24 11:43:52,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-07-24 11:43:52,278 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 11:43:52,278 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 11:43:52,278 INFO L414 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 11:43:52,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2134316589, now seen corresponding path program 1 times [2018-07-24 11:43:52,279 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 11:43:52,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:43:52,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:43:52,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:43:52,284 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 11:43:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:43:52,664 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 11:43:52,664 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 11:43:52,664 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 11:43:52,665 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 11:43:52,667 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 11:43:52,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 11:43:52,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 11:43:52,668 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 6 states. [2018-07-24 11:43:55,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 11:43:55,259 INFO L93 Difference]: Finished difference Result 998 states and 1753 transitions. [2018-07-24 11:43:55,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 11:43:55,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-07-24 11:43:55,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 11:43:55,270 INFO L225 Difference]: With dead ends: 998 [2018-07-24 11:43:55,270 INFO L226 Difference]: Without dead ends: 648 [2018-07-24 11:43:55,273 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-24 11:43:55,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-07-24 11:43:55,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 639. [2018-07-24 11:43:55,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2018-07-24 11:43:55,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 994 transitions. [2018-07-24 11:43:55,321 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 994 transitions. Word has length 105 [2018-07-24 11:43:55,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 11:43:55,322 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 994 transitions. [2018-07-24 11:43:55,322 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 11:43:55,322 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 994 transitions. [2018-07-24 11:43:55,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-07-24 11:43:55,326 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 11:43:55,326 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 11:43:55,327 INFO L414 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 11:43:55,327 INFO L82 PathProgramCache]: Analyzing trace with hash -471641421, now seen corresponding path program 1 times [2018-07-24 11:43:55,327 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 11:43:55,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:43:55,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:43:55,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:43:55,329 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 11:43:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:43:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 11:43:55,646 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 11:43:55,646 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 11:43:55,647 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 11:43:55,647 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 11:43:55,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 11:43:55,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 11:43:55,648 INFO L87 Difference]: Start difference. First operand 639 states and 994 transitions. Second operand 6 states. [2018-07-24 11:43:58,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 11:43:58,844 INFO L93 Difference]: Finished difference Result 1567 states and 2516 transitions. [2018-07-24 11:43:58,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 11:43:58,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-07-24 11:43:58,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 11:43:58,861 INFO L225 Difference]: With dead ends: 1567 [2018-07-24 11:43:58,861 INFO L226 Difference]: Without dead ends: 934 [2018-07-24 11:43:58,865 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-24 11:43:58,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2018-07-24 11:43:58,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 918. [2018-07-24 11:43:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2018-07-24 11:43:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1356 transitions. [2018-07-24 11:43:58,928 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1356 transitions. Word has length 121 [2018-07-24 11:43:58,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 11:43:58,933 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1356 transitions. [2018-07-24 11:43:58,933 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 11:43:58,933 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1356 transitions. [2018-07-24 11:43:58,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-07-24 11:43:58,945 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 11:43:58,948 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 11:43:58,948 INFO L414 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 11:43:58,948 INFO L82 PathProgramCache]: Analyzing trace with hash -2098845977, now seen corresponding path program 1 times [2018-07-24 11:43:58,948 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 11:43:58,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:43:58,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:43:58,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:43:58,950 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 11:43:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:43:59,403 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 11:43:59,404 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 11:43:59,404 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 11:43:59,404 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 11:43:59,405 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 11:43:59,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 11:43:59,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-24 11:43:59,407 INFO L87 Difference]: Start difference. First operand 918 states and 1356 transitions. Second operand 5 states. [2018-07-24 11:44:02,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 11:44:02,484 INFO L93 Difference]: Finished difference Result 3235 states and 4895 transitions. [2018-07-24 11:44:02,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-24 11:44:02,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-07-24 11:44:02,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 11:44:02,502 INFO L225 Difference]: With dead ends: 3235 [2018-07-24 11:44:02,502 INFO L226 Difference]: Without dead ends: 2323 [2018-07-24 11:44:02,509 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-07-24 11:44:02,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2018-07-24 11:44:02,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 2280. [2018-07-24 11:44:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2018-07-24 11:44:02,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3223 transitions. [2018-07-24 11:44:02,582 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3223 transitions. Word has length 143 [2018-07-24 11:44:02,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 11:44:02,584 INFO L471 AbstractCegarLoop]: Abstraction has 2280 states and 3223 transitions. [2018-07-24 11:44:02,584 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 11:44:02,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3223 transitions. [2018-07-24 11:44:02,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-07-24 11:44:02,589 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 11:44:02,589 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 11:44:02,590 INFO L414 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 11:44:02,590 INFO L82 PathProgramCache]: Analyzing trace with hash 856338435, now seen corresponding path program 1 times [2018-07-24 11:44:02,590 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 11:44:02,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:44:02,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:44:02,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:44:02,592 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 11:44:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:44:02,925 WARN L169 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 11:44:03,341 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 11:44:03,341 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 11:44:03,341 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 11:44:03,342 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 11:44:03,342 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 11:44:03,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 11:44:03,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 11:44:03,343 INFO L87 Difference]: Start difference. First operand 2280 states and 3223 transitions. Second operand 6 states. [2018-07-24 11:44:05,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 11:44:05,166 INFO L93 Difference]: Finished difference Result 4928 states and 7277 transitions. [2018-07-24 11:44:05,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 11:44:05,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2018-07-24 11:44:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 11:44:05,189 INFO L225 Difference]: With dead ends: 4928 [2018-07-24 11:44:05,190 INFO L226 Difference]: Without dead ends: 2654 [2018-07-24 11:44:05,201 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-24 11:44:05,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2018-07-24 11:44:05,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 2578. [2018-07-24 11:44:05,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2578 states. [2018-07-24 11:44:05,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 3501 transitions. [2018-07-24 11:44:05,306 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 3501 transitions. Word has length 145 [2018-07-24 11:44:05,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 11:44:05,307 INFO L471 AbstractCegarLoop]: Abstraction has 2578 states and 3501 transitions. [2018-07-24 11:44:05,307 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 11:44:05,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3501 transitions. [2018-07-24 11:44:05,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-07-24 11:44:05,317 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 11:44:05,317 INFO L353 BasicCegarLoop]: trace histogram [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, 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] [2018-07-24 11:44:05,318 INFO L414 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 11:44:05,318 INFO L82 PathProgramCache]: Analyzing trace with hash 2111676699, now seen corresponding path program 1 times [2018-07-24 11:44:05,318 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 11:44:05,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:44:05,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:44:05,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:44:05,320 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 11:44:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:44:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 30 proven. 73 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 11:44:05,582 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 11:44:05,582 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 11:44:05,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:44:05,602 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 11:44:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:44:05,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 11:44:06,118 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-24 11:44:06,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 11:44:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 30 proven. 73 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 11:44:06,547 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-07-24 11:44:06,547 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 8 [2018-07-24 11:44:06,547 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 11:44:06,548 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 11:44:06,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 11:44:06,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-07-24 11:44:06,549 INFO L87 Difference]: Start difference. First operand 2578 states and 3501 transitions. Second operand 5 states. [2018-07-24 11:44:12,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 11:44:12,025 INFO L93 Difference]: Finished difference Result 6288 states and 8619 transitions. [2018-07-24 11:44:12,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 11:44:12,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 199 [2018-07-24 11:44:12,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 11:44:12,046 INFO L225 Difference]: With dead ends: 6288 [2018-07-24 11:44:12,046 INFO L226 Difference]: Without dead ends: 3716 [2018-07-24 11:44:12,060 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 395 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-07-24 11:44:12,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3716 states. [2018-07-24 11:44:12,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3716 to 3632. [2018-07-24 11:44:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3632 states. [2018-07-24 11:44:12,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3632 states to 3632 states and 4741 transitions. [2018-07-24 11:44:12,154 INFO L78 Accepts]: Start accepts. Automaton has 3632 states and 4741 transitions. Word has length 199 [2018-07-24 11:44:12,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 11:44:12,155 INFO L471 AbstractCegarLoop]: Abstraction has 3632 states and 4741 transitions. [2018-07-24 11:44:12,155 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 11:44:12,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3632 states and 4741 transitions. [2018-07-24 11:44:12,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-07-24 11:44:12,166 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 11:44:12,166 INFO L353 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 11:44:12,166 INFO L414 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 11:44:12,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1016299341, now seen corresponding path program 1 times [2018-07-24 11:44:12,167 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 11:44:12,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:44:12,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:44:12,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:44:12,168 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 11:44:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:44:12,438 WARN L169 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 11:44:12,874 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 30 proven. 77 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 11:44:12,875 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 11:44:12,875 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 11:44:12,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:44:12,891 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 11:44:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:44:12,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 11:44:13,456 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-24 11:44:13,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 11:44:13,625 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 30 proven. 77 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 11:44:13,648 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-07-24 11:44:13,648 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2018-07-24 11:44:13,648 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 11:44:13,648 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 11:44:13,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 11:44:13,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-07-24 11:44:13,649 INFO L87 Difference]: Start difference. First operand 3632 states and 4741 transitions. Second operand 5 states. [2018-07-24 11:44:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 11:44:16,268 INFO L93 Difference]: Finished difference Result 10495 states and 14359 transitions. [2018-07-24 11:44:16,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-24 11:44:16,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 227 [2018-07-24 11:44:16,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 11:44:16,362 INFO L225 Difference]: With dead ends: 10495 [2018-07-24 11:44:16,362 INFO L226 Difference]: Without dead ends: 6869 [2018-07-24 11:44:16,382 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 448 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-07-24 11:44:16,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6869 states. [2018-07-24 11:44:16,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6869 to 6793. [2018-07-24 11:44:16,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6793 states. [2018-07-24 11:44:16,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6793 states to 6793 states and 8569 transitions. [2018-07-24 11:44:16,537 INFO L78 Accepts]: Start accepts. Automaton has 6793 states and 8569 transitions. Word has length 227 [2018-07-24 11:44:16,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 11:44:16,538 INFO L471 AbstractCegarLoop]: Abstraction has 6793 states and 8569 transitions. [2018-07-24 11:44:16,538 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 11:44:16,538 INFO L276 IsEmpty]: Start isEmpty. Operand 6793 states and 8569 transitions. [2018-07-24 11:44:16,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-07-24 11:44:16,564 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 11:44:16,565 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-07-24 11:44:16,565 INFO L414 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 11:44:16,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1526362292, now seen corresponding path program 1 times [2018-07-24 11:44:16,565 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 11:44:16,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:44:16,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:44:16,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:44:16,567 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 11:44:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:44:16,978 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 111 proven. 145 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-07-24 11:44:16,978 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 11:44:16,978 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 11:44:16,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:44:16,989 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 11:44:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:44:17,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 11:44:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 247 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-24 11:44:17,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 11:44:17,602 WARN L169 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-07-24 11:44:17,922 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 119 proven. 77 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-07-24 11:44:17,943 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 11:44:17,943 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 11:44:17,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:44:17,960 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 11:44:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:44:18,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 11:44:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 247 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-24 11:44:18,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 11:44:18,552 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 119 proven. 77 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-07-24 11:44:18,554 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 11:44:18,555 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5, 5, 5] total 15 [2018-07-24 11:44:18,555 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 11:44:18,555 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-24 11:44:18,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-24 11:44:18,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-07-24 11:44:18,556 INFO L87 Difference]: Start difference. First operand 6793 states and 8569 transitions. Second operand 12 states. [2018-07-24 11:44:22,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 11:44:22,284 INFO L93 Difference]: Finished difference Result 15720 states and 20907 transitions. [2018-07-24 11:44:22,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-24 11:44:22,293 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 270 [2018-07-24 11:44:22,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 11:44:22,346 INFO L225 Difference]: With dead ends: 15720 [2018-07-24 11:44:22,346 INFO L226 Difference]: Without dead ends: 9079 [2018-07-24 11:44:22,397 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1113 GetRequests, 1083 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2018-07-24 11:44:22,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9079 states. [2018-07-24 11:44:22,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9079 to 8426. [2018-07-24 11:44:22,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8426 states. [2018-07-24 11:44:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8426 states to 8426 states and 9943 transitions. [2018-07-24 11:44:22,630 INFO L78 Accepts]: Start accepts. Automaton has 8426 states and 9943 transitions. Word has length 270 [2018-07-24 11:44:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 11:44:22,631 INFO L471 AbstractCegarLoop]: Abstraction has 8426 states and 9943 transitions. [2018-07-24 11:44:22,631 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-24 11:44:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 8426 states and 9943 transitions. [2018-07-24 11:44:22,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-07-24 11:44:22,652 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 11:44:22,652 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-07-24 11:44:22,652 INFO L414 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 11:44:22,653 INFO L82 PathProgramCache]: Analyzing trace with hash -714641497, now seen corresponding path program 1 times [2018-07-24 11:44:22,653 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 11:44:22,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:44:22,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:44:22,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:44:22,654 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 11:44:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:44:22,933 WARN L169 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 11:44:23,830 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 51 proven. 154 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-07-24 11:44:23,831 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 11:44:23,831 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 11:44:23,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:44:23,848 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 11:44:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:44:23,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 11:44:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 263 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-24 11:44:24,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 11:44:24,653 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 126 proven. 77 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-07-24 11:44:24,675 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 11:44:24,675 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 11:44:24,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:44:24,691 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 11:44:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:44:24,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 11:44:25,179 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 263 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-24 11:44:25,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 11:44:25,416 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 126 proven. 77 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (7)] Exception during sending of exit command (exit): Broken pipe [2018-07-24 11:44:25,419 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 11:44:25,419 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5, 5, 5] total 15 [2018-07-24 11:44:25,419 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 11:44:25,420 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-24 11:44:25,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-24 11:44:25,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-07-24 11:44:25,421 INFO L87 Difference]: Start difference. First operand 8426 states and 9943 transitions. Second operand 11 states. [2018-07-24 11:44:29,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 11:44:29,656 INFO L93 Difference]: Finished difference Result 21855 states and 26282 transitions. [2018-07-24 11:44:29,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-24 11:44:29,656 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 279 [2018-07-24 11:44:29,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 11:44:29,678 INFO L225 Difference]: With dead ends: 21855 [2018-07-24 11:44:29,678 INFO L226 Difference]: Without dead ends: 3293 [2018-07-24 11:44:29,719 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1149 GetRequests, 1117 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2018-07-24 11:44:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2018-07-24 11:44:29,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 2025. [2018-07-24 11:44:29,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2025 states. [2018-07-24 11:44:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 2256 transitions. [2018-07-24 11:44:29,794 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 2256 transitions. Word has length 279 [2018-07-24 11:44:29,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 11:44:29,795 INFO L471 AbstractCegarLoop]: Abstraction has 2025 states and 2256 transitions. [2018-07-24 11:44:29,795 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-24 11:44:29,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 2256 transitions. [2018-07-24 11:44:29,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-07-24 11:44:29,804 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 11:44:29,804 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-07-24 11:44:29,804 INFO L414 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 11:44:29,805 INFO L82 PathProgramCache]: Analyzing trace with hash 239064623, now seen corresponding path program 1 times [2018-07-24 11:44:29,805 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 11:44:29,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:44:29,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:44:29,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:44:29,806 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 11:44:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:44:30,330 WARN L169 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2018-07-24 11:44:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 51 proven. 241 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-07-24 11:44:30,872 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 11:44:30,873 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 11:44:30,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:44:30,881 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 11:44:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:44:30,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 11:44:31,379 WARN L169 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 34 [2018-07-24 11:44:31,642 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 282 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-24 11:44:31,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 11:44:32,395 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:32,461 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 50 [2018-07-24 11:44:32,751 WARN L169 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 35 [2018-07-24 11:44:32,756 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:32,814 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:32,892 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:32,994 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:33,078 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:33,245 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:33,304 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:33,413 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:33,482 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:33,620 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:33,695 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:33,768 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:33,928 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:34,116 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:34,172 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:34,232 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:34,381 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:34,442 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:34,505 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:34,841 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:34,896 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:34,960 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:35,022 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:35,079 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:35,137 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:35,235 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:35,306 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:35,365 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:35,801 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:35,866 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:36,029 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:36,086 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:36,222 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:36,280 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:36,337 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:36,409 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:36,472 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:36,528 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:36,584 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:36,642 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:36,701 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:36,834 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:36,897 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:36,953 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:37,107 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:37,162 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:37,219 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:37,280 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:37,337 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:37,393 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:37,448 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:37,526 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:37,581 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:37,636 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:37,691 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:37,748 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:37,803 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:37,862 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:37,951 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:38,008 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:38,121 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:38,173 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:38,266 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:38,319 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:38,375 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:38,430 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:38,501 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:38,568 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:38,632 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:38,695 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:38,755 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:38,823 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:38,890 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:38,946 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:39,028 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:39,082 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:39,136 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:39,190 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:39,243 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:39,326 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:39,379 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:39,432 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:39,485 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:39,542 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:39,598 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:39,654 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:39,735 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:39,791 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:39,864 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:39,925 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:39,982 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:40,036 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:40,091 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:40,147 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:40,205 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:40,261 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:40,318 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:40,373 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:40,429 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:40,872 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:41,183 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:41,236 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:41,290 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:41,345 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:41,400 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:41,455 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:41,509 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:41,563 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:42,167 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 51 proven. 244 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 11:44:42,188 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 11:44:42,189 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 11:44:42,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:44:42,208 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 11:44:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:44:42,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 11:44:42,902 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 282 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-24 11:44:42,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 11:44:43,707 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:43,761 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 50 [2018-07-24 11:44:43,862 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:43,929 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:43,993 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:44,060 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:44,115 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:44,168 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:44,230 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:44,285 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:44,344 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:44,480 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:44,532 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:44,585 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:44,662 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:44,715 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:44,807 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:44,895 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:44,948 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:45,007 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:45,076 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:45,128 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:45,181 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:45,233 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:45,287 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:45,344 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:45,402 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:45,458 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:45,515 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:45,569 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:45,623 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:45,678 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:45,731 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:45,784 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:45,839 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:45,893 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:45,948 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:46,008 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:46,059 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:46,113 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:46,165 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:46,218 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:46,272 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:46,325 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:46,379 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:46,432 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:46,486 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:46,543 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:46,596 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:46,651 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:46,705 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:46,762 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:46,818 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:46,941 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:46,994 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:47,050 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:47,104 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:47,156 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:47,211 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:47,268 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:47,320 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:47,376 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:47,469 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:47,533 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:47,588 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:47,641 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:47,694 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:47,748 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:47,803 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:47,855 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:47,907 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:47,961 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:48,381 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:48,531 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:48,587 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:48,640 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:48,695 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:48,750 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:48,814 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:48,876 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:48,946 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:49,001 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:49,059 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:49,131 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:49,198 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:49,251 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:49,310 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:49,367 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:49,421 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:49,474 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:49,525 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:49,581 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:49,633 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:49,685 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:49,736 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:49,929 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:50,163 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:50,242 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:50,295 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:50,347 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:50,399 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:50,454 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:50,507 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:50,563 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:50,616 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:50,670 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:50,722 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:50,775 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:50,826 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:50,877 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 11:44:51,513 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 51 proven. 244 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 11:44:51,515 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 11:44:51,515 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8, 8, 8] total 28 [2018-07-24 11:44:51,515 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 11:44:51,516 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-24 11:44:51,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-24 11:44:51,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2018-07-24 11:44:51,517 INFO L87 Difference]: Start difference. First operand 2025 states and 2256 transitions. Second operand 16 states. [2018-07-24 11:45:00,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 11:45:00,839 INFO L93 Difference]: Finished difference Result 5172 states and 6032 transitions. [2018-07-24 11:45:00,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-24 11:45:00,839 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 315 [2018-07-24 11:45:00,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 11:45:00,852 INFO L225 Difference]: With dead ends: 5172 [2018-07-24 11:45:00,852 INFO L226 Difference]: Without dead ends: 3297 [2018-07-24 11:45:00,860 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1322 GetRequests, 1043 SyntacticMatches, 224 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3947 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=639, Invalid=2553, Unknown=0, NotChecked=0, Total=3192 [2018-07-24 11:45:00,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3297 states. [2018-07-24 11:45:00,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3297 to 3262. [2018-07-24 11:45:00,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2018-07-24 11:45:00,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 3745 transitions. [2018-07-24 11:45:00,950 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 3745 transitions. Word has length 315 [2018-07-24 11:45:00,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 11:45:00,950 INFO L471 AbstractCegarLoop]: Abstraction has 3262 states and 3745 transitions. [2018-07-24 11:45:00,950 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-24 11:45:00,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 3745 transitions. [2018-07-24 11:45:00,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-07-24 11:45:00,963 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 11:45:00,963 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 11:45:00,963 INFO L414 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 11:45:00,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1323056436, now seen corresponding path program 1 times [2018-07-24 11:45:00,964 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 11:45:00,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:45:00,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:45:00,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:45:00,965 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 11:45:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-24 11:45:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-24 11:45:01,157 INFO L419 BasicCegarLoop]: Counterexample might be feasible [2018-07-24 11:45:01,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 11:45:01 BoogieIcfgContainer [2018-07-24 11:45:01,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 11:45:01,385 INFO L168 Benchmark]: Toolchain (without parser) took 77217.55 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -190.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-07-24 11:45:01,386 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 11:45:01,386 INFO L168 Benchmark]: CACSL2BoogieTranslator took 715.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-07-24 11:45:01,387 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-24 11:45:01,388 INFO L168 Benchmark]: Boogie Preprocessor took 247.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 790.6 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -885.9 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. [2018-07-24 11:45:01,390 INFO L168 Benchmark]: RCFGBuilder took 4578.79 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 119.1 MB). Peak memory consumption was 119.1 MB. Max. memory is 7.1 GB. [2018-07-24 11:45:01,391 INFO L168 Benchmark]: TraceAbstraction took 71561.57 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 723.5 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 523.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-07-24 11:45:01,398 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 715.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 102.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 247.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 790.6 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -885.9 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4578.79 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 119.1 MB). Peak memory consumption was 119.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 71561.57 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 723.5 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 523.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 49]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; VAL [\old(a1)=518109, \old(a10)=518106, \old(a12)=518110, \old(a19)=518114, \old(a4)=518108, \old(inputB)=518113, \old(inputC)=518111, \old(inputD)=518112, \old(inputE)=518107, \old(inputF)=518105, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] int output = -1; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L526] COND TRUE ((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0))))) [L527] a1 = (((a1 * 5) + 278443) - -239546) [L528] RET return 26; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, calculate_output(input)=26, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND TRUE (((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0)) [L245] a1 = (((((a1 % 25)- -13) - 42605) / 5) - -8517) [L246] a10 = 3 [L248] RET return 26; VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, calculate_output(input)=26, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND TRUE (((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14)) [L346] a1 = ((((a1 - 287698) - 189392) % 89)+ 206) [L347] a10 = 2 [L348] a19 = 7 [L350] RET return -1; VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=156, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=156, a10=2, a12=0, a19=7, a4=14, calculate_output(input)=-1, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=156, a10=2, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] CALL calculate_output(input) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, a1=156, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, a1=156, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, a1=156, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, a1=156, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, a1=156, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, a1=156, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, a1=156, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, a1=156, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, a1=156, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, a1=156, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND TRUE (((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, a1=156, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] __VERIFIER_error() VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, a1=156, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNSAFE Result, 71.4s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 38.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 822 SDtfs, 8725 SDslu, 1455 SDs, 0 SdLazy, 18171 SolverSat, 2965 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 30.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4497 GetRequests, 4097 SyntacticMatches, 249 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4295 ImplicationChecksByTransitivity, 24.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8426occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 2260 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 29.0s InterpolantComputationTime, 4314 NumberOfCodeBlocks, 4314 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 6108 ConstructedInterpolants, 252 QuantifiedInterpolants, 12747014 SizeOfPredicates, 9 NumberOfNonLiveVariables, 3776 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 26 InterpolantComputations, 7 PerfectInterpolantSequences, 3302/4950 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label29_false-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_11-45-01-443.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label29_false-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_11-45-01-443.csv Received shutdown request...