/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=SMALLESTAMONGWIDE --traceabstraction.additional.smt.options tolerance=0.1 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label55.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-19 03:39:17,351 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-19 03:39:17,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-19 03:39:17,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-19 03:39:17,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-19 03:39:17,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-19 03:39:17,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-19 03:39:17,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-19 03:39:17,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-19 03:39:17,416 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-19 03:39:17,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-19 03:39:17,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-19 03:39:17,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-19 03:39:17,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-19 03:39:17,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-19 03:39:17,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-19 03:39:17,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-19 03:39:17,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-19 03:39:17,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-19 03:39:17,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-19 03:39:17,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-19 03:39:17,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-19 03:39:17,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-19 03:39:17,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-19 03:39:17,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-19 03:39:17,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-19 03:39:17,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-19 03:39:17,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-19 03:39:17,439 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-19 03:39:17,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-19 03:39:17,440 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-19 03:39:17,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-19 03:39:17,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-19 03:39:17,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-19 03:39:17,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-19 03:39:17,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-19 03:39:17,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-19 03:39:17,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-19 03:39:17,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-19 03:39:17,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-19 03:39:17,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-19 03:39:17,448 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-19 03:39:17,470 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-19 03:39:17,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-19 03:39:17,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-19 03:39:17,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-19 03:39:17,473 INFO L138 SettingsManager]: * Use SBE=true [2020-08-19 03:39:17,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-19 03:39:17,473 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-19 03:39:17,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-19 03:39:17,474 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-19 03:39:17,474 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-19 03:39:17,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-19 03:39:17,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-19 03:39:17,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-19 03:39:17,475 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-19 03:39:17,475 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-19 03:39:17,475 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-19 03:39:17,475 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-19 03:39:17,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-19 03:39:17,476 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-19 03:39:17,476 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-19 03:39:17,476 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-19 03:39:17,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 03:39:17,477 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-19 03:39:17,477 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-19 03:39:17,477 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-19 03:39:17,477 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-19 03:39:17,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-19 03:39:17,477 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-19 03:39:17,478 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-19 03:39:17,478 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.1; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.1; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.1; [2020-08-19 03:39:17,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-19 03:39:17,785 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-19 03:39:17,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-19 03:39:17,790 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-19 03:39:17,791 INFO L275 PluginConnector]: CDTParser initialized [2020-08-19 03:39:17,791 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label55.c [2020-08-19 03:39:17,854 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ffb49f800/111bbd7fb2f8459690ea45f19cbdf6c2/FLAG63c1b4d35 [2020-08-19 03:39:18,452 INFO L306 CDTParser]: Found 1 translation units. [2020-08-19 03:39:18,453 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label55.c [2020-08-19 03:39:18,465 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ffb49f800/111bbd7fb2f8459690ea45f19cbdf6c2/FLAG63c1b4d35 [2020-08-19 03:39:18,700 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ffb49f800/111bbd7fb2f8459690ea45f19cbdf6c2 [2020-08-19 03:39:18,708 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-19 03:39:18,710 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-19 03:39:18,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-19 03:39:18,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-19 03:39:18,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-19 03:39:18,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 03:39:18" (1/1) ... [2020-08-19 03:39:18,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ff463a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:39:18, skipping insertion in model container [2020-08-19 03:39:18,720 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 03:39:18" (1/1) ... [2020-08-19 03:39:18,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-19 03:39:18,781 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-19 03:39:19,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 03:39:19,308 INFO L203 MainTranslator]: Completed pre-run [2020-08-19 03:39:19,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 03:39:19,470 INFO L208 MainTranslator]: Completed translation [2020-08-19 03:39:19,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:39:19 WrapperNode [2020-08-19 03:39:19,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-19 03:39:19,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-19 03:39:19,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-19 03:39:19,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-19 03:39:19,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:39:19" (1/1) ... [2020-08-19 03:39:19,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:39:19" (1/1) ... [2020-08-19 03:39:19,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:39:19" (1/1) ... [2020-08-19 03:39:19,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:39:19" (1/1) ... [2020-08-19 03:39:19,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:39:19" (1/1) ... [2020-08-19 03:39:19,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:39:19" (1/1) ... [2020-08-19 03:39:19,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:39:19" (1/1) ... [2020-08-19 03:39:19,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-19 03:39:19,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-19 03:39:19,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-19 03:39:19,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-19 03:39:19,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:39:19" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-08-19 03:39:19,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-19 03:39:19,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-19 03:39:19,675 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-08-19 03:39:19,675 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-19 03:39:19,675 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-08-19 03:39:19,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-19 03:39:19,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-19 03:39:19,676 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-08-19 03:39:19,676 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-19 03:39:19,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-19 03:39:19,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-19 03:39:20,939 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-19 03:39:20,940 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-19 03:39:20,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 03:39:20 BoogieIcfgContainer [2020-08-19 03:39:20,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-19 03:39:20,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-19 03:39:20,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-19 03:39:20,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-19 03:39:20,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.08 03:39:18" (1/3) ... [2020-08-19 03:39:20,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2bc885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 03:39:20, skipping insertion in model container [2020-08-19 03:39:20,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:39:19" (2/3) ... [2020-08-19 03:39:20,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2bc885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 03:39:20, skipping insertion in model container [2020-08-19 03:39:20,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 03:39:20" (3/3) ... [2020-08-19 03:39:20,961 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label55.c [2020-08-19 03:39:20,973 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-19 03:39:20,984 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-19 03:39:20,997 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-19 03:39:21,020 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-19 03:39:21,020 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-19 03:39:21,021 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-19 03:39:21,021 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-19 03:39:21,021 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-19 03:39:21,021 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-19 03:39:21,021 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-19 03:39:21,022 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-19 03:39:21,045 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-08-19 03:39:21,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-08-19 03:39:21,053 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:39:21,054 INFO L422 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, 1, 1] [2020-08-19 03:39:21,054 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:39:21,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:39:21,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1305395761, now seen corresponding path program 1 times [2020-08-19 03:39:21,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:39:21,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1099135747] [2020-08-19 03:39:21,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:39:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:21,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:39:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 03:39:21,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1099135747] [2020-08-19 03:39:21,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 03:39:21,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-08-19 03:39:21,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623174695] [2020-08-19 03:39:21,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 03:39:21,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:39:21,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 03:39:21,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-19 03:39:21,443 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 5 states. [2020-08-19 03:39:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:39:23,526 INFO L93 Difference]: Finished difference Result 730 states and 1301 transitions. [2020-08-19 03:39:23,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 03:39:23,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-08-19 03:39:23,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:39:23,547 INFO L225 Difference]: With dead ends: 730 [2020-08-19 03:39:23,547 INFO L226 Difference]: Without dead ends: 447 [2020-08-19 03:39:23,556 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-08-19 03:39:23,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2020-08-19 03:39:23,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 441. [2020-08-19 03:39:23,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-08-19 03:39:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 672 transitions. [2020-08-19 03:39:23,652 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 672 transitions. Word has length 24 [2020-08-19 03:39:23,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:39:23,653 INFO L479 AbstractCegarLoop]: Abstraction has 441 states and 672 transitions. [2020-08-19 03:39:23,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 03:39:23,653 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 672 transitions. [2020-08-19 03:39:23,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-08-19 03:39:23,658 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:39:23,658 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:39:23,659 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-19 03:39:23,659 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:39:23,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:39:23,659 INFO L82 PathProgramCache]: Analyzing trace with hash 853278169, now seen corresponding path program 1 times [2020-08-19 03:39:23,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:39:23,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [826761841] [2020-08-19 03:39:23,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:39:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:23,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:39:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:23,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-19 03:39:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:23,960 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 03:39:23,961 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [826761841] [2020-08-19 03:39:23,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 03:39:23,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-19 03:39:23,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616217826] [2020-08-19 03:39:23,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 03:39:23,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:39:23,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 03:39:23,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-19 03:39:23,966 INFO L87 Difference]: Start difference. First operand 441 states and 672 transitions. Second operand 8 states. [2020-08-19 03:39:25,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:39:25,635 INFO L93 Difference]: Finished difference Result 1041 states and 1612 transitions. [2020-08-19 03:39:25,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-19 03:39:25,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2020-08-19 03:39:25,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:39:25,641 INFO L225 Difference]: With dead ends: 1041 [2020-08-19 03:39:25,641 INFO L226 Difference]: Without dead ends: 606 [2020-08-19 03:39:25,644 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-08-19 03:39:25,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-08-19 03:39:25,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 592. [2020-08-19 03:39:25,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2020-08-19 03:39:25,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 829 transitions. [2020-08-19 03:39:25,708 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 829 transitions. Word has length 97 [2020-08-19 03:39:25,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:39:25,709 INFO L479 AbstractCegarLoop]: Abstraction has 592 states and 829 transitions. [2020-08-19 03:39:25,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 03:39:25,709 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 829 transitions. [2020-08-19 03:39:25,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-08-19 03:39:25,711 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:39:25,712 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:39:25,712 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-19 03:39:25,712 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:39:25,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:39:25,713 INFO L82 PathProgramCache]: Analyzing trace with hash -689374291, now seen corresponding path program 1 times [2020-08-19 03:39:25,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:39:25,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [223747329] [2020-08-19 03:39:25,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:39:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:25,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:39:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:25,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-19 03:39:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:25,866 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 03:39:25,867 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [223747329] [2020-08-19 03:39:25,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:39:25,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-19 03:39:25,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691421885] [2020-08-19 03:39:25,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 03:39:25,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:39:25,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 03:39:25,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-19 03:39:25,869 INFO L87 Difference]: Start difference. First operand 592 states and 829 transitions. Second operand 5 states. [2020-08-19 03:39:29,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:39:29,256 INFO L93 Difference]: Finished difference Result 1776 states and 2554 transitions. [2020-08-19 03:39:29,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 03:39:29,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2020-08-19 03:39:29,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:39:29,267 INFO L225 Difference]: With dead ends: 1776 [2020-08-19 03:39:29,268 INFO L226 Difference]: Without dead ends: 1190 [2020-08-19 03:39:29,270 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-08-19 03:39:29,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-08-19 03:39:29,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1035. [2020-08-19 03:39:29,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2020-08-19 03:39:29,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1373 transitions. [2020-08-19 03:39:29,329 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1373 transitions. Word has length 103 [2020-08-19 03:39:29,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:39:29,329 INFO L479 AbstractCegarLoop]: Abstraction has 1035 states and 1373 transitions. [2020-08-19 03:39:29,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 03:39:29,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1373 transitions. [2020-08-19 03:39:29,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-08-19 03:39:29,333 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:39:29,333 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:39:29,334 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-19 03:39:29,334 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:39:29,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:39:29,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1755559734, now seen corresponding path program 1 times [2020-08-19 03:39:29,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:39:29,335 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [829612899] [2020-08-19 03:39:29,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:39:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:29,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:39:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:29,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-19 03:39:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:29,542 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 03:39:29,542 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [829612899] [2020-08-19 03:39:29,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 03:39:29,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-19 03:39:29,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759946416] [2020-08-19 03:39:29,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 03:39:29,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:39:29,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 03:39:29,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-19 03:39:29,545 INFO L87 Difference]: Start difference. First operand 1035 states and 1373 transitions. Second operand 7 states. [2020-08-19 03:39:31,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:39:31,213 INFO L93 Difference]: Finished difference Result 2964 states and 4086 transitions. [2020-08-19 03:39:31,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-19 03:39:31,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 114 [2020-08-19 03:39:31,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:39:31,226 INFO L225 Difference]: With dead ends: 2964 [2020-08-19 03:39:31,227 INFO L226 Difference]: Without dead ends: 1935 [2020-08-19 03:39:31,231 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-08-19 03:39:31,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2020-08-19 03:39:31,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1490. [2020-08-19 03:39:31,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2020-08-19 03:39:31,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1986 transitions. [2020-08-19 03:39:31,301 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1986 transitions. Word has length 114 [2020-08-19 03:39:31,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:39:31,301 INFO L479 AbstractCegarLoop]: Abstraction has 1490 states and 1986 transitions. [2020-08-19 03:39:31,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 03:39:31,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1986 transitions. [2020-08-19 03:39:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-08-19 03:39:31,305 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:39:31,305 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:39:31,306 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-19 03:39:31,306 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:39:31,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:39:31,306 INFO L82 PathProgramCache]: Analyzing trace with hash -83786946, now seen corresponding path program 1 times [2020-08-19 03:39:31,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:39:31,307 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1014357040] [2020-08-19 03:39:31,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:39:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:31,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:39:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:31,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-19 03:39:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 03:39:31,590 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1014357040] [2020-08-19 03:39:31,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 03:39:31,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-19 03:39:31,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868840530] [2020-08-19 03:39:31,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 03:39:31,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:39:31,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 03:39:31,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-19 03:39:31,593 INFO L87 Difference]: Start difference. First operand 1490 states and 1986 transitions. Second operand 8 states. [2020-08-19 03:39:33,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:39:33,848 INFO L93 Difference]: Finished difference Result 3874 states and 5372 transitions. [2020-08-19 03:39:33,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-19 03:39:33,849 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 136 [2020-08-19 03:39:33,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:39:33,867 INFO L225 Difference]: With dead ends: 3874 [2020-08-19 03:39:33,868 INFO L226 Difference]: Without dead ends: 2390 [2020-08-19 03:39:33,875 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2020-08-19 03:39:33,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2020-08-19 03:39:33,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 2086. [2020-08-19 03:39:33,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2086 states. [2020-08-19 03:39:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 2696 transitions. [2020-08-19 03:39:33,974 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 2696 transitions. Word has length 136 [2020-08-19 03:39:33,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:39:33,975 INFO L479 AbstractCegarLoop]: Abstraction has 2086 states and 2696 transitions. [2020-08-19 03:39:33,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 03:39:33,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 2696 transitions. [2020-08-19 03:39:33,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-08-19 03:39:33,984 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:39:33,985 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-08-19 03:39:33,985 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-19 03:39:33,986 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:39:33,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:39:33,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1136439961, now seen corresponding path program 1 times [2020-08-19 03:39:33,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:39:33,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [743826957] [2020-08-19 03:39:33,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:39:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:34,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:39:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:34,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-19 03:39:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:34,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-08-19 03:39:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 34 proven. 85 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-19 03:39:34,278 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [743826957] [2020-08-19 03:39:34,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:39:34,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 03:39:34,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291868012] [2020-08-19 03:39:34,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 03:39:34,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:39:34,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 03:39:34,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-19 03:39:34,281 INFO L87 Difference]: Start difference. First operand 2086 states and 2696 transitions. Second operand 7 states. [2020-08-19 03:39:35,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:39:35,660 INFO L93 Difference]: Finished difference Result 4331 states and 5609 transitions. [2020-08-19 03:39:35,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-19 03:39:35,675 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 210 [2020-08-19 03:39:35,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:39:35,688 INFO L225 Difference]: With dead ends: 4331 [2020-08-19 03:39:35,688 INFO L226 Difference]: Without dead ends: 2251 [2020-08-19 03:39:35,695 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-08-19 03:39:35,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2251 states. [2020-08-19 03:39:35,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2251 to 2235. [2020-08-19 03:39:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2020-08-19 03:39:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 2863 transitions. [2020-08-19 03:39:35,779 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 2863 transitions. Word has length 210 [2020-08-19 03:39:35,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:39:35,779 INFO L479 AbstractCegarLoop]: Abstraction has 2235 states and 2863 transitions. [2020-08-19 03:39:35,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 03:39:35,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 2863 transitions. [2020-08-19 03:39:35,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2020-08-19 03:39:35,784 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:39:35,785 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-08-19 03:39:35,785 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-19 03:39:35,785 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:39:35,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:39:35,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1177582321, now seen corresponding path program 1 times [2020-08-19 03:39:35,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:39:35,786 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1201423202] [2020-08-19 03:39:35,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:39:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:35,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:39:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:35,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-19 03:39:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:35,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-08-19 03:39:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:36,175 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 101 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-19 03:39:36,176 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1201423202] [2020-08-19 03:39:36,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:39:36,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 03:39:36,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302577471] [2020-08-19 03:39:36,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 03:39:36,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:39:36,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 03:39:36,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-19 03:39:36,179 INFO L87 Difference]: Start difference. First operand 2235 states and 2863 transitions. Second operand 7 states. [2020-08-19 03:39:38,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:39:38,000 INFO L93 Difference]: Finished difference Result 4339 states and 5605 transitions. [2020-08-19 03:39:38,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-19 03:39:38,006 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 230 [2020-08-19 03:39:38,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:39:38,018 INFO L225 Difference]: With dead ends: 4339 [2020-08-19 03:39:38,019 INFO L226 Difference]: Without dead ends: 2253 [2020-08-19 03:39:38,024 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-08-19 03:39:38,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2020-08-19 03:39:38,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 1802. [2020-08-19 03:39:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-08-19 03:39:38,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2175 transitions. [2020-08-19 03:39:38,088 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2175 transitions. Word has length 230 [2020-08-19 03:39:38,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:39:38,088 INFO L479 AbstractCegarLoop]: Abstraction has 1802 states and 2175 transitions. [2020-08-19 03:39:38,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 03:39:38,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2175 transitions. [2020-08-19 03:39:38,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2020-08-19 03:39:38,093 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:39:38,094 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:39:38,094 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-19 03:39:38,094 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:39:38,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:39:38,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1643123341, now seen corresponding path program 1 times [2020-08-19 03:39:38,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:39:38,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1932812075] [2020-08-19 03:39:38,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:39:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:38,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:39:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:38,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-19 03:39:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:38,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-08-19 03:39:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:39:38,601 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 38 proven. 74 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-19 03:39:38,602 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1932812075] [2020-08-19 03:39:38,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:39:38,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-19 03:39:38,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156032054] [2020-08-19 03:39:38,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 03:39:38,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:39:38,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 03:39:38,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-19 03:39:38,605 INFO L87 Difference]: Start difference. First operand 1802 states and 2175 transitions. Second operand 10 states. [2020-08-19 03:39:42,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:39:42,508 INFO L93 Difference]: Finished difference Result 5506 states and 6834 transitions. [2020-08-19 03:39:42,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-19 03:39:42,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 244 [2020-08-19 03:39:42,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:39:42,531 INFO L225 Difference]: With dead ends: 5506 [2020-08-19 03:39:42,531 INFO L226 Difference]: Without dead ends: 3826 [2020-08-19 03:39:42,537 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2020-08-19 03:39:42,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3826 states. [2020-08-19 03:39:42,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3826 to 2237. [2020-08-19 03:39:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2237 states. [2020-08-19 03:39:42,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 2712 transitions. [2020-08-19 03:39:42,624 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 2712 transitions. Word has length 244 [2020-08-19 03:39:42,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:39:42,624 INFO L479 AbstractCegarLoop]: Abstraction has 2237 states and 2712 transitions. [2020-08-19 03:39:42,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 03:39:42,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 2712 transitions. [2020-08-19 03:39:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2020-08-19 03:39:42,631 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:39:42,631 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-08-19 03:39:42,631 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-19 03:39:42,632 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:39:42,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:39:42,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1637300869, now seen corresponding path program 1 times [2020-08-19 03:39:42,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:39:42,633 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2016651444] [2020-08-19 03:39:42,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:39:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-19 03:39:42,720 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-19 03:39:42,720 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-19 03:39:42,725 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-19 03:39:42,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.08 03:39:42 BoogieIcfgContainer [2020-08-19 03:39:42,769 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-19 03:39:42,772 INFO L168 Benchmark]: Toolchain (without parser) took 24061.57 ms. Allocated memory was 140.5 MB in the beginning and 468.7 MB in the end (delta: 328.2 MB). Free memory was 102.0 MB in the beginning and 288.4 MB in the end (delta: -186.4 MB). Peak memory consumption was 141.9 MB. Max. memory is 7.1 GB. [2020-08-19 03:39:42,773 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-08-19 03:39:42,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.15 ms. Allocated memory was 140.5 MB in the beginning and 205.5 MB in the end (delta: 65.0 MB). Free memory was 101.8 MB in the beginning and 171.2 MB in the end (delta: -69.3 MB). Peak memory consumption was 34.5 MB. Max. memory is 7.1 GB. [2020-08-19 03:39:42,775 INFO L168 Benchmark]: Boogie Preprocessor took 123.50 ms. Allocated memory is still 205.5 MB. Free memory was 171.2 MB in the beginning and 166.4 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2020-08-19 03:39:42,776 INFO L168 Benchmark]: RCFGBuilder took 1349.54 ms. Allocated memory was 205.5 MB in the beginning and 238.6 MB in the end (delta: 33.0 MB). Free memory was 166.4 MB in the beginning and 181.3 MB in the end (delta: -14.9 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. [2020-08-19 03:39:42,777 INFO L168 Benchmark]: TraceAbstraction took 21821.97 ms. Allocated memory was 238.6 MB in the beginning and 468.7 MB in the end (delta: 230.2 MB). Free memory was 179.8 MB in the beginning and 288.4 MB in the end (delta: -108.6 MB). Peak memory consumption was 121.6 MB. Max. memory is 7.1 GB. [2020-08-19 03:39:42,781 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.27 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 761.15 ms. Allocated memory was 140.5 MB in the beginning and 205.5 MB in the end (delta: 65.0 MB). Free memory was 101.8 MB in the beginning and 171.2 MB in the end (delta: -69.3 MB). Peak memory consumption was 34.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.50 ms. Allocated memory is still 205.5 MB. Free memory was 171.2 MB in the beginning and 166.4 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1349.54 ms. Allocated memory was 205.5 MB in the beginning and 238.6 MB in the end (delta: 33.0 MB). Free memory was 166.4 MB in the beginning and 181.3 MB in the end (delta: -14.9 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21821.97 ms. Allocated memory was 238.6 MB in the beginning and 468.7 MB in the end (delta: 230.2 MB). Free memory was 179.8 MB in the beginning and 288.4 MB in the end (delta: -108.6 MB). Peak memory consumption was 121.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 58]: 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; [L579] int 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)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [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)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [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))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [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 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [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))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [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))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [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))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [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))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] return 25; [L590] RET, EXPR calculate_output(input) [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)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [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)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [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))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [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 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [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))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [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))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [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))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [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))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [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))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [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))) [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) [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))))) [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) [L526] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) [L529] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) [L534] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) [L540] COND FALSE !(((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0)))) [L545] COND FALSE !(((a4==14) && (((a12==0) && ((a19==9) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a10==4)))) [L548] COND FALSE !(((((( ((38 < a1) && (218 >= a1)) && (input == 3)) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10))) [L554] COND FALSE !((((a4==14) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 4)) && (a12==0)) && (a19==9))) && (a10==2))) [L557] COND TRUE ((a12==0) && ((( 218 < a1 && ((a19==9) && (input == 5))) && (a10==1)) && (a4==14))) [L558] a1 = ((((a1 * 9)/ 10) + 58620) - 603783) [L559] a10 = 4 [L560] a19 = 8 [L562] return -1; [L590] RET, EXPR calculate_output(input) [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)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND TRUE (((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)) [L58] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.7s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 231 SDtfs, 3903 SDslu, 374 SDs, 0 SdLazy, 9220 SolverSat, 1381 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 13.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2237occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 2980 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1438 NumberOfCodeBlocks, 1438 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1150 ConstructedInterpolants, 0 QuantifiedInterpolants, 581977 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 247/409 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...