/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label38.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 13:30:44,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 13:30:44,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 13:30:44,222 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 13:30:44,222 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 13:30:44,224 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 13:30:44,226 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 13:30:44,239 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 13:30:44,241 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 13:30:44,242 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 13:30:44,245 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 13:30:44,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 13:30:44,247 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 13:30:44,249 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 13:30:44,250 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 13:30:44,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 13:30:44,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 13:30:44,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 13:30:44,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 13:30:44,264 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 13:30:44,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 13:30:44,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 13:30:44,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 13:30:44,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 13:30:44,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 13:30:44,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 13:30:44,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 13:30:44,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 13:30:44,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 13:30:44,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 13:30:44,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 13:30:44,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 13:30:44,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 13:30:44,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 13:30:44,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 13:30:44,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 13:30:44,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 13:30:44,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 13:30:44,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 13:30:44,289 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 13:30:44,290 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 13:30:44,291 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-07 13:30:44,300 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 13:30:44,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 13:30:44,301 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 13:30:44,301 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 13:30:44,302 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 13:30:44,302 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 13:30:44,302 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 13:30:44,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 13:30:44,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 13:30:44,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 13:30:44,303 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 13:30:44,303 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 13:30:44,303 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 13:30:44,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 13:30:44,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 13:30:44,304 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-07 13:30:44,304 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 13:30:44,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 13:30:44,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:30:44,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 13:30:44,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-07 13:30:44,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 13:30:44,305 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-07 13:30:44,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 13:30:44,646 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 13:30:44,650 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 13:30:44,652 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 13:30:44,652 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 13:30:44,653 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label38.c [2020-07-07 13:30:44,731 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea0de5852/645dbe7136f44cd7a991181ecf44c7c8/FLAG20e4ddccf [2020-07-07 13:30:45,339 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 13:30:45,340 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label38.c [2020-07-07 13:30:45,365 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea0de5852/645dbe7136f44cd7a991181ecf44c7c8/FLAG20e4ddccf [2020-07-07 13:30:45,639 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea0de5852/645dbe7136f44cd7a991181ecf44c7c8 [2020-07-07 13:30:45,650 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 13:30:45,652 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 13:30:45,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 13:30:45,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 13:30:45,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 13:30:45,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:30:45" (1/1) ... [2020-07-07 13:30:45,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39032579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:30:45, skipping insertion in model container [2020-07-07 13:30:45,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:30:45" (1/1) ... [2020-07-07 13:30:45,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 13:30:45,710 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 13:30:46,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:30:46,242 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 13:30:46,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:30:46,411 INFO L208 MainTranslator]: Completed translation [2020-07-07 13:30:46,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:30:46 WrapperNode [2020-07-07 13:30:46,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 13:30:46,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 13:30:46,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 13:30:46,412 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 13:30:46,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:30:46" (1/1) ... [2020-07-07 13:30:46,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:30:46" (1/1) ... [2020-07-07 13:30:46,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:30:46" (1/1) ... [2020-07-07 13:30:46,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:30:46" (1/1) ... [2020-07-07 13:30:46,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:30:46" (1/1) ... [2020-07-07 13:30:46,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:30:46" (1/1) ... [2020-07-07 13:30:46,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:30:46" (1/1) ... [2020-07-07 13:30:46,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 13:30:46,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 13:30:46,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 13:30:46,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 13:30:46,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:30:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:30:46,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 13:30:46,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 13:30:46,587 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-07-07 13:30:46,587 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 13:30:46,587 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-07-07 13:30:46,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 13:30:46,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 13:30:46,587 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-07 13:30:46,587 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 13:30:46,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 13:30:46,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 13:30:47,897 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 13:30:47,898 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-07 13:30:47,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:30:47 BoogieIcfgContainer [2020-07-07 13:30:47,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 13:30:47,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 13:30:47,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 13:30:47,919 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 13:30:47,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 01:30:45" (1/3) ... [2020-07-07 13:30:47,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@523837f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:30:47, skipping insertion in model container [2020-07-07 13:30:47,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:30:46" (2/3) ... [2020-07-07 13:30:47,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@523837f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:30:47, skipping insertion in model container [2020-07-07 13:30:47,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:30:47" (3/3) ... [2020-07-07 13:30:47,929 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label38.c [2020-07-07 13:30:47,939 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-07 13:30:47,951 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 13:30:47,965 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 13:30:47,988 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 13:30:47,988 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 13:30:47,989 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-07 13:30:47,989 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 13:30:47,989 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 13:30:47,989 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 13:30:47,989 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 13:30:47,990 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 13:30:48,011 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states. [2020-07-07 13:30:48,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-07-07 13:30:48,034 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:30:48,035 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-07 13:30:48,036 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:30:48,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:30:48,042 INFO L82 PathProgramCache]: Analyzing trace with hash -857113145, now seen corresponding path program 1 times [2020-07-07 13:30:48,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:30:48,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [411915868] [2020-07-07 13:30:48,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:30:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:30:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:30:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:30:48,559 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:30:48,562 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [411915868] [2020-07-07 13:30:48,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:30:48,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:30:48,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41045965] [2020-07-07 13:30:48,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:30:48,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:30:48,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:30:48,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:30:48,588 INFO L87 Difference]: Start difference. First operand 525 states. Second operand 5 states. [2020-07-07 13:30:50,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:30:50,728 INFO L93 Difference]: Finished difference Result 1259 states and 1658 transitions. [2020-07-07 13:30:50,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 13:30:50,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2020-07-07 13:30:50,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:30:50,752 INFO L225 Difference]: With dead ends: 1259 [2020-07-07 13:30:50,753 INFO L226 Difference]: Without dead ends: 685 [2020-07-07 13:30:50,763 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-07 13:30:50,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2020-07-07 13:30:50,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 603. [2020-07-07 13:30:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2020-07-07 13:30:50,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 725 transitions. [2020-07-07 13:30:50,945 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 725 transitions. Word has length 110 [2020-07-07 13:30:50,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:30:50,946 INFO L479 AbstractCegarLoop]: Abstraction has 603 states and 725 transitions. [2020-07-07 13:30:50,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:30:50,947 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 725 transitions. [2020-07-07 13:30:50,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-07-07 13:30:50,956 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:30:50,957 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:30:50,957 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 13:30:50,957 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:30:50,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:30:50,958 INFO L82 PathProgramCache]: Analyzing trace with hash 550881368, now seen corresponding path program 1 times [2020-07-07 13:30:50,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:30:50,958 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1535863077] [2020-07-07 13:30:50,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:30:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:30:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:30:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:30:51,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:30:51,216 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:30:51,217 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1535863077] [2020-07-07 13:30:51,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:30:51,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:30:51,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860441287] [2020-07-07 13:30:51,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:30:51,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:30:51,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:30:51,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:30:51,221 INFO L87 Difference]: Start difference. First operand 603 states and 725 transitions. Second operand 9 states. [2020-07-07 13:30:51,404 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-07-07 13:30:53,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:30:53,568 INFO L93 Difference]: Finished difference Result 1436 states and 1760 transitions. [2020-07-07 13:30:53,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 13:30:53,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2020-07-07 13:30:53,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:30:53,579 INFO L225 Difference]: With dead ends: 1436 [2020-07-07 13:30:53,579 INFO L226 Difference]: Without dead ends: 857 [2020-07-07 13:30:53,586 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-07 13:30:53,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2020-07-07 13:30:53,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 748. [2020-07-07 13:30:53,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2020-07-07 13:30:53,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 916 transitions. [2020-07-07 13:30:53,729 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 916 transitions. Word has length 131 [2020-07-07 13:30:53,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:30:53,732 INFO L479 AbstractCegarLoop]: Abstraction has 748 states and 916 transitions. [2020-07-07 13:30:53,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:30:53,732 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 916 transitions. [2020-07-07 13:30:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-07-07 13:30:53,738 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:30:53,738 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:30:53,738 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 13:30:53,739 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:30:53,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:30:53,739 INFO L82 PathProgramCache]: Analyzing trace with hash 703741270, now seen corresponding path program 1 times [2020-07-07 13:30:53,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:30:53,740 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1982601658] [2020-07-07 13:30:53,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:30:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:30:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:30:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:30:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:30:53,966 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:30:53,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1982601658] [2020-07-07 13:30:53,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:30:53,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:30:53,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503522421] [2020-07-07 13:30:53,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:30:53,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:30:53,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:30:53,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:30:53,969 INFO L87 Difference]: Start difference. First operand 748 states and 916 transitions. Second operand 5 states. [2020-07-07 13:30:55,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:30:55,907 INFO L93 Difference]: Finished difference Result 1936 states and 2480 transitions. [2020-07-07 13:30:55,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 13:30:55,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2020-07-07 13:30:55,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:30:55,927 INFO L225 Difference]: With dead ends: 1936 [2020-07-07 13:30:55,928 INFO L226 Difference]: Without dead ends: 1212 [2020-07-07 13:30:55,933 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-07-07 13:30:55,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2020-07-07 13:30:56,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 895. [2020-07-07 13:30:56,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2020-07-07 13:30:56,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1095 transitions. [2020-07-07 13:30:56,099 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1095 transitions. Word has length 131 [2020-07-07 13:30:56,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:30:56,100 INFO L479 AbstractCegarLoop]: Abstraction has 895 states and 1095 transitions. [2020-07-07 13:30:56,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:30:56,100 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1095 transitions. [2020-07-07 13:30:56,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-07-07 13:30:56,104 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:30:56,105 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:30:56,105 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 13:30:56,105 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:30:56,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:30:56,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1687843793, now seen corresponding path program 1 times [2020-07-07 13:30:56,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:30:56,106 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [294026353] [2020-07-07 13:30:56,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:30:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:30:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:30:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:30:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:30:56,345 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:30:56,345 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [294026353] [2020-07-07 13:30:56,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:30:56,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:30:56,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309825613] [2020-07-07 13:30:56,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:30:56,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:30:56,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:30:56,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:30:56,348 INFO L87 Difference]: Start difference. First operand 895 states and 1095 transitions. Second operand 5 states. [2020-07-07 13:30:58,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:30:58,145 INFO L93 Difference]: Finished difference Result 2429 states and 3092 transitions. [2020-07-07 13:30:58,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 13:30:58,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2020-07-07 13:30:58,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:30:58,162 INFO L225 Difference]: With dead ends: 2429 [2020-07-07 13:30:58,162 INFO L226 Difference]: Without dead ends: 1558 [2020-07-07 13:30:58,168 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-07 13:30:58,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2020-07-07 13:30:58,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1324. [2020-07-07 13:30:58,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2020-07-07 13:30:58,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1687 transitions. [2020-07-07 13:30:58,368 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1687 transitions. Word has length 135 [2020-07-07 13:30:58,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:30:58,369 INFO L479 AbstractCegarLoop]: Abstraction has 1324 states and 1687 transitions. [2020-07-07 13:30:58,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:30:58,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1687 transitions. [2020-07-07 13:30:58,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-07-07 13:30:58,375 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:30:58,376 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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-07-07 13:30:58,376 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 13:30:58,376 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:30:58,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:30:58,377 INFO L82 PathProgramCache]: Analyzing trace with hash 39430160, now seen corresponding path program 1 times [2020-07-07 13:30:58,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:30:58,377 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2145846554] [2020-07-07 13:30:58,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:30:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:30:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:30:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:30:58,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:30:58,566 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:30:58,566 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2145846554] [2020-07-07 13:30:58,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:30:58,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-07 13:30:58,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172601277] [2020-07-07 13:30:58,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-07 13:30:58,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:30:58,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-07 13:30:58,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-07 13:30:58,569 INFO L87 Difference]: Start difference. First operand 1324 states and 1687 transitions. Second operand 6 states. [2020-07-07 13:31:00,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:31:00,393 INFO L93 Difference]: Finished difference Result 3231 states and 4253 transitions. [2020-07-07 13:31:00,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 13:31:00,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2020-07-07 13:31:00,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:31:00,415 INFO L225 Difference]: With dead ends: 3231 [2020-07-07 13:31:00,415 INFO L226 Difference]: Without dead ends: 1931 [2020-07-07 13:31:00,422 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-07 13:31:00,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2020-07-07 13:31:00,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1896. [2020-07-07 13:31:00,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2020-07-07 13:31:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2362 transitions. [2020-07-07 13:31:00,740 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2362 transitions. Word has length 140 [2020-07-07 13:31:00,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:31:00,740 INFO L479 AbstractCegarLoop]: Abstraction has 1896 states and 2362 transitions. [2020-07-07 13:31:00,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-07 13:31:00,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2362 transitions. [2020-07-07 13:31:00,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-07-07 13:31:00,748 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:31:00,749 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-07-07 13:31:00,749 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 13:31:00,749 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:31:00,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:31:00,750 INFO L82 PathProgramCache]: Analyzing trace with hash 926609686, now seen corresponding path program 1 times [2020-07-07 13:31:00,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:31:00,750 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2103419902] [2020-07-07 13:31:00,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:31:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:01,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:31:01,140 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:31:01,141 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2103419902] [2020-07-07 13:31:01,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:31:01,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 13:31:01,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921131982] [2020-07-07 13:31:01,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 13:31:01,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:31:01,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 13:31:01,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-07 13:31:01,146 INFO L87 Difference]: Start difference. First operand 1896 states and 2362 transitions. Second operand 10 states. [2020-07-07 13:31:04,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:31:04,417 INFO L93 Difference]: Finished difference Result 5080 states and 6423 transitions. [2020-07-07 13:31:04,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-07 13:31:04,422 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 176 [2020-07-07 13:31:04,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:31:04,444 INFO L225 Difference]: With dead ends: 5080 [2020-07-07 13:31:04,444 INFO L226 Difference]: Without dead ends: 2817 [2020-07-07 13:31:04,455 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-07-07 13:31:04,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2020-07-07 13:31:04,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2463. [2020-07-07 13:31:04,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2020-07-07 13:31:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 2932 transitions. [2020-07-07 13:31:04,780 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 2932 transitions. Word has length 176 [2020-07-07 13:31:04,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:31:04,781 INFO L479 AbstractCegarLoop]: Abstraction has 2463 states and 2932 transitions. [2020-07-07 13:31:04,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 13:31:04,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 2932 transitions. [2020-07-07 13:31:04,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2020-07-07 13:31:04,789 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:31:04,789 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-07 13:31:04,790 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 13:31:04,790 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:31:04,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:31:04,790 INFO L82 PathProgramCache]: Analyzing trace with hash -350239711, now seen corresponding path program 1 times [2020-07-07 13:31:04,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:31:04,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1544275323] [2020-07-07 13:31:04,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:31:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:06,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:31:06,035 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:31:06,036 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1544275323] [2020-07-07 13:31:06,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:31:06,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-07 13:31:06,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780766380] [2020-07-07 13:31:06,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-07 13:31:06,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:31:06,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-07 13:31:06,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-07-07 13:31:06,040 INFO L87 Difference]: Start difference. First operand 2463 states and 2932 transitions. Second operand 13 states. [2020-07-07 13:31:06,472 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2020-07-07 13:31:06,734 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2020-07-07 13:31:07,224 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2020-07-07 13:31:07,573 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2020-07-07 13:31:07,879 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2020-07-07 13:31:08,110 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2020-07-07 13:31:08,485 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2020-07-07 13:31:09,119 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2020-07-07 13:31:09,375 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2020-07-07 13:31:09,726 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2020-07-07 13:31:09,920 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2020-07-07 13:31:10,115 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2020-07-07 13:31:11,904 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2020-07-07 13:31:12,895 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2020-07-07 13:31:14,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:31:14,985 INFO L93 Difference]: Finished difference Result 6669 states and 8357 transitions. [2020-07-07 13:31:14,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-07-07 13:31:14,985 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 205 [2020-07-07 13:31:14,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:31:15,025 INFO L225 Difference]: With dead ends: 6669 [2020-07-07 13:31:15,025 INFO L226 Difference]: Without dead ends: 4230 [2020-07-07 13:31:15,036 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=541, Invalid=1715, Unknown=0, NotChecked=0, Total=2256 [2020-07-07 13:31:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4230 states. [2020-07-07 13:31:15,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4230 to 3077. [2020-07-07 13:31:15,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3077 states. [2020-07-07 13:31:15,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 3655 transitions. [2020-07-07 13:31:15,649 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 3655 transitions. Word has length 205 [2020-07-07 13:31:15,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:31:15,649 INFO L479 AbstractCegarLoop]: Abstraction has 3077 states and 3655 transitions. [2020-07-07 13:31:15,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-07 13:31:15,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 3655 transitions. [2020-07-07 13:31:15,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-07-07 13:31:15,659 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:31:15,660 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-07 13:31:15,660 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 13:31:15,660 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:31:15,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:31:15,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1568499164, now seen corresponding path program 1 times [2020-07-07 13:31:15,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:31:15,661 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [654021073] [2020-07-07 13:31:15,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:31:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:31:15,966 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:31:15,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [654021073] [2020-07-07 13:31:15,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:31:15,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-07 13:31:15,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279594880] [2020-07-07 13:31:15,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 13:31:15,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:31:15,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 13:31:15,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-07-07 13:31:15,974 INFO L87 Difference]: Start difference. First operand 3077 states and 3655 transitions. Second operand 8 states. [2020-07-07 13:31:18,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:31:18,574 INFO L93 Difference]: Finished difference Result 6924 states and 8542 transitions. [2020-07-07 13:31:18,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-07 13:31:18,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 220 [2020-07-07 13:31:18,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:31:18,689 INFO L225 Difference]: With dead ends: 6924 [2020-07-07 13:31:18,689 INFO L226 Difference]: Without dead ends: 4321 [2020-07-07 13:31:18,698 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-07-07 13:31:18,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4321 states. [2020-07-07 13:31:19,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4321 to 4263. [2020-07-07 13:31:19,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4263 states. [2020-07-07 13:31:19,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 5163 transitions. [2020-07-07 13:31:19,285 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 5163 transitions. Word has length 220 [2020-07-07 13:31:19,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:31:19,286 INFO L479 AbstractCegarLoop]: Abstraction has 4263 states and 5163 transitions. [2020-07-07 13:31:19,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 13:31:19,286 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 5163 transitions. [2020-07-07 13:31:19,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2020-07-07 13:31:19,303 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:31:19,304 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-07 13:31:19,304 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 13:31:19,304 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:31:19,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:31:19,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1874947704, now seen corresponding path program 1 times [2020-07-07 13:31:19,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:31:19,305 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [332784362] [2020-07-07 13:31:19,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:31:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:19,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:31:19,547 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:31:19,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [332784362] [2020-07-07 13:31:19,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:31:19,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:31:19,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098034638] [2020-07-07 13:31:19,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:31:19,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:31:19,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:31:19,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:31:19,550 INFO L87 Difference]: Start difference. First operand 4263 states and 5163 transitions. Second operand 9 states. [2020-07-07 13:31:24,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:31:24,701 INFO L93 Difference]: Finished difference Result 12128 states and 15290 transitions. [2020-07-07 13:31:24,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-07 13:31:24,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 222 [2020-07-07 13:31:24,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:31:24,768 INFO L225 Difference]: With dead ends: 12128 [2020-07-07 13:31:24,768 INFO L226 Difference]: Without dead ends: 8030 [2020-07-07 13:31:24,792 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2020-07-07 13:31:24,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8030 states. [2020-07-07 13:31:26,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8030 to 7394. [2020-07-07 13:31:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7394 states. [2020-07-07 13:31:26,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7394 states to 7394 states and 9278 transitions. [2020-07-07 13:31:26,400 INFO L78 Accepts]: Start accepts. Automaton has 7394 states and 9278 transitions. Word has length 222 [2020-07-07 13:31:26,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:31:26,401 INFO L479 AbstractCegarLoop]: Abstraction has 7394 states and 9278 transitions. [2020-07-07 13:31:26,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:31:26,401 INFO L276 IsEmpty]: Start isEmpty. Operand 7394 states and 9278 transitions. [2020-07-07 13:31:26,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2020-07-07 13:31:26,422 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:31:26,422 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-07 13:31:26,423 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-07 13:31:26,423 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:31:26,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:31:26,423 INFO L82 PathProgramCache]: Analyzing trace with hash -703727274, now seen corresponding path program 1 times [2020-07-07 13:31:26,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:31:26,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1575193434] [2020-07-07 13:31:26,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:31:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:26,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:31:26,736 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:31:26,736 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1575193434] [2020-07-07 13:31:26,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:31:26,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-07 13:31:26,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363377657] [2020-07-07 13:31:26,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 13:31:26,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:31:26,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 13:31:26,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-07 13:31:26,738 INFO L87 Difference]: Start difference. First operand 7394 states and 9278 transitions. Second operand 8 states. [2020-07-07 13:31:30,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:31:30,235 INFO L93 Difference]: Finished difference Result 17183 states and 21965 transitions. [2020-07-07 13:31:30,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 13:31:30,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 223 [2020-07-07 13:31:30,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:31:30,325 INFO L225 Difference]: With dead ends: 17183 [2020-07-07 13:31:30,325 INFO L226 Difference]: Without dead ends: 9954 [2020-07-07 13:31:30,372 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-07-07 13:31:30,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9954 states. [2020-07-07 13:31:31,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9954 to 9484. [2020-07-07 13:31:31,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9484 states. [2020-07-07 13:31:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9484 states to 9484 states and 11745 transitions. [2020-07-07 13:31:31,963 INFO L78 Accepts]: Start accepts. Automaton has 9484 states and 11745 transitions. Word has length 223 [2020-07-07 13:31:31,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:31:31,964 INFO L479 AbstractCegarLoop]: Abstraction has 9484 states and 11745 transitions. [2020-07-07 13:31:31,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 13:31:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 9484 states and 11745 transitions. [2020-07-07 13:31:31,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2020-07-07 13:31:31,986 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:31:31,986 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-07 13:31:31,986 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-07 13:31:31,986 INFO L427 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:31:31,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:31:31,987 INFO L82 PathProgramCache]: Analyzing trace with hash -224647721, now seen corresponding path program 1 times [2020-07-07 13:31:31,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:31:31,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1465336538] [2020-07-07 13:31:31,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:31:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:32,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:31:32,728 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:31:32,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1465336538] [2020-07-07 13:31:32,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:31:32,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-07 13:31:32,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794592276] [2020-07-07 13:31:32,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-07 13:31:32,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:31:32,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-07 13:31:32,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-07-07 13:31:32,730 INFO L87 Difference]: Start difference. First operand 9484 states and 11745 transitions. Second operand 12 states. [2020-07-07 13:31:33,044 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2020-07-07 13:31:33,232 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2020-07-07 13:31:33,434 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2020-07-07 13:31:34,312 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2020-07-07 13:31:34,598 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2020-07-07 13:31:34,867 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2020-07-07 13:31:35,058 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2020-07-07 13:31:35,550 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2020-07-07 13:31:35,869 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2020-07-07 13:31:36,205 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2020-07-07 13:31:37,897 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2020-07-07 13:31:39,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:31:39,622 INFO L93 Difference]: Finished difference Result 19703 states and 24389 transitions. [2020-07-07 13:31:39,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-07-07 13:31:39,622 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 226 [2020-07-07 13:31:39,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:31:39,686 INFO L225 Difference]: With dead ends: 19703 [2020-07-07 13:31:39,686 INFO L226 Difference]: Without dead ends: 10384 [2020-07-07 13:31:39,729 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=307, Invalid=815, Unknown=0, NotChecked=0, Total=1122 [2020-07-07 13:31:39,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10384 states. [2020-07-07 13:31:41,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10384 to 9848. [2020-07-07 13:31:41,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9848 states. [2020-07-07 13:31:41,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9848 states to 9848 states and 12134 transitions. [2020-07-07 13:31:41,469 INFO L78 Accepts]: Start accepts. Automaton has 9848 states and 12134 transitions. Word has length 226 [2020-07-07 13:31:41,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:31:41,469 INFO L479 AbstractCegarLoop]: Abstraction has 9848 states and 12134 transitions. [2020-07-07 13:31:41,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-07 13:31:41,469 INFO L276 IsEmpty]: Start isEmpty. Operand 9848 states and 12134 transitions. [2020-07-07 13:31:41,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2020-07-07 13:31:41,493 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:31:41,493 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-07 13:31:41,493 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-07 13:31:41,494 INFO L427 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:31:41,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:31:41,494 INFO L82 PathProgramCache]: Analyzing trace with hash 94444541, now seen corresponding path program 1 times [2020-07-07 13:31:41,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:31:41,495 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [207748713] [2020-07-07 13:31:41,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:31:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:41,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:31:41,867 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:31:41,867 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [207748713] [2020-07-07 13:31:41,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:31:41,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:31:41,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867966932] [2020-07-07 13:31:41,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:31:41,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:31:41,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:31:41,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:31:41,873 INFO L87 Difference]: Start difference. First operand 9848 states and 12134 transitions. Second operand 9 states. [2020-07-07 13:31:43,546 WARN L193 SmtUtils]: Spent 690.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-07-07 13:31:46,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:31:46,102 INFO L93 Difference]: Finished difference Result 19403 states and 23993 transitions. [2020-07-07 13:31:46,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-07 13:31:46,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 248 [2020-07-07 13:31:46,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:31:46,146 INFO L225 Difference]: With dead ends: 19403 [2020-07-07 13:31:46,147 INFO L226 Difference]: Without dead ends: 9118 [2020-07-07 13:31:46,187 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2020-07-07 13:31:46,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9118 states. [2020-07-07 13:31:47,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9118 to 7854. [2020-07-07 13:31:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7854 states. [2020-07-07 13:31:47,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7854 states to 7854 states and 9383 transitions. [2020-07-07 13:31:47,426 INFO L78 Accepts]: Start accepts. Automaton has 7854 states and 9383 transitions. Word has length 248 [2020-07-07 13:31:47,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:31:47,427 INFO L479 AbstractCegarLoop]: Abstraction has 7854 states and 9383 transitions. [2020-07-07 13:31:47,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:31:47,427 INFO L276 IsEmpty]: Start isEmpty. Operand 7854 states and 9383 transitions. [2020-07-07 13:31:47,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2020-07-07 13:31:47,436 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:31:47,437 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-07 13:31:47,437 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-07 13:31:47,437 INFO L427 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:31:47,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:31:47,437 INFO L82 PathProgramCache]: Analyzing trace with hash 23106809, now seen corresponding path program 1 times [2020-07-07 13:31:47,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:31:47,438 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1913826609] [2020-07-07 13:31:47,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:31:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:48,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:31:48,332 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:31:48,332 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1913826609] [2020-07-07 13:31:48,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:31:48,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-07 13:31:48,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541541787] [2020-07-07 13:31:48,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-07 13:31:48,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:31:48,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-07 13:31:48,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2020-07-07 13:31:48,334 INFO L87 Difference]: Start difference. First operand 7854 states and 9383 transitions. Second operand 14 states. [2020-07-07 13:31:48,766 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2020-07-07 13:31:49,023 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2020-07-07 13:31:49,423 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2020-07-07 13:31:49,643 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2020-07-07 13:31:50,131 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2020-07-07 13:31:50,281 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2020-07-07 13:31:50,923 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 76 [2020-07-07 13:31:51,079 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2020-07-07 13:31:51,310 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2020-07-07 13:31:51,815 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2020-07-07 13:31:52,660 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2020-07-07 13:31:52,913 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2020-07-07 13:31:53,641 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2020-07-07 13:31:53,865 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2020-07-07 13:31:54,158 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2020-07-07 13:31:55,591 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2020-07-07 13:31:56,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:31:56,693 INFO L93 Difference]: Finished difference Result 16091 states and 19235 transitions. [2020-07-07 13:31:56,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-07-07 13:31:56,694 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 251 [2020-07-07 13:31:56,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:31:56,737 INFO L225 Difference]: With dead ends: 16091 [2020-07-07 13:31:56,738 INFO L226 Difference]: Without dead ends: 8402 [2020-07-07 13:31:56,767 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=501, Invalid=1569, Unknown=0, NotChecked=0, Total=2070 [2020-07-07 13:31:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8402 states. [2020-07-07 13:31:58,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8402 to 7849. [2020-07-07 13:31:58,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7849 states. [2020-07-07 13:31:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7849 states to 7849 states and 9320 transitions. [2020-07-07 13:31:58,130 INFO L78 Accepts]: Start accepts. Automaton has 7849 states and 9320 transitions. Word has length 251 [2020-07-07 13:31:58,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:31:58,130 INFO L479 AbstractCegarLoop]: Abstraction has 7849 states and 9320 transitions. [2020-07-07 13:31:58,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-07 13:31:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 7849 states and 9320 transitions. [2020-07-07 13:31:58,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2020-07-07 13:31:58,140 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:31:58,141 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-07 13:31:58,141 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-07 13:31:58,141 INFO L427 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:31:58,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:31:58,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1910271732, now seen corresponding path program 1 times [2020-07-07 13:31:58,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:31:58,142 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [568377681] [2020-07-07 13:31:58,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:31:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:59,049 WARN L193 SmtUtils]: Spent 787.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-07-07 13:31:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:31:59,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:31:59,171 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:31:59,172 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [568377681] [2020-07-07 13:31:59,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:31:59,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:31:59,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780069580] [2020-07-07 13:31:59,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:31:59,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:31:59,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:31:59,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:31:59,175 INFO L87 Difference]: Start difference. First operand 7849 states and 9320 transitions. Second operand 5 states. [2020-07-07 13:32:01,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:32:01,566 INFO L93 Difference]: Finished difference Result 15559 states and 18511 transitions. [2020-07-07 13:32:01,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 13:32:01,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 252 [2020-07-07 13:32:01,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:32:01,609 INFO L225 Difference]: With dead ends: 15559 [2020-07-07 13:32:01,610 INFO L226 Difference]: Without dead ends: 7875 [2020-07-07 13:32:01,641 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-07 13:32:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7875 states. [2020-07-07 13:32:03,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7875 to 7654. [2020-07-07 13:32:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7654 states. [2020-07-07 13:32:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7654 states to 7654 states and 8957 transitions. [2020-07-07 13:32:03,138 INFO L78 Accepts]: Start accepts. Automaton has 7654 states and 8957 transitions. Word has length 252 [2020-07-07 13:32:03,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:32:03,139 INFO L479 AbstractCegarLoop]: Abstraction has 7654 states and 8957 transitions. [2020-07-07 13:32:03,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:32:03,139 INFO L276 IsEmpty]: Start isEmpty. Operand 7654 states and 8957 transitions. [2020-07-07 13:32:03,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2020-07-07 13:32:03,146 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:32:03,147 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-07 13:32:03,147 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-07 13:32:03,147 INFO L427 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:32:03,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:32:03,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1539255752, now seen corresponding path program 1 times [2020-07-07 13:32:03,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:32:03,148 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1191172032] [2020-07-07 13:32:03,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:32:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:32:03,921 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:32:03,922 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1191172032] [2020-07-07 13:32:03,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:32:03,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-07 13:32:03,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602379251] [2020-07-07 13:32:03,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-07 13:32:03,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:32:03,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-07 13:32:03,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-07-07 13:32:03,924 INFO L87 Difference]: Start difference. First operand 7654 states and 8957 transitions. Second operand 13 states. [2020-07-07 13:32:04,233 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 73 [2020-07-07 13:32:04,501 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2020-07-07 13:32:05,231 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2020-07-07 13:32:05,709 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2020-07-07 13:32:06,214 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 74 [2020-07-07 13:32:06,838 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2020-07-07 13:32:07,415 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2020-07-07 13:32:09,064 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 72 [2020-07-07 13:32:09,459 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2020-07-07 13:32:09,916 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-07-07 13:32:10,530 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 74 [2020-07-07 13:32:10,739 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2020-07-07 13:32:12,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:32:12,440 INFO L93 Difference]: Finished difference Result 14690 states and 16676 transitions. [2020-07-07 13:32:12,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-07-07 13:32:12,441 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 256 [2020-07-07 13:32:12,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:32:12,457 INFO L225 Difference]: With dead ends: 14690 [2020-07-07 13:32:12,458 INFO L226 Difference]: Without dead ends: 3325 [2020-07-07 13:32:12,489 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=445, Invalid=1277, Unknown=0, NotChecked=0, Total=1722 [2020-07-07 13:32:12,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3325 states. [2020-07-07 13:32:13,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3325 to 2565. [2020-07-07 13:32:13,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2565 states. [2020-07-07 13:32:13,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 2710 transitions. [2020-07-07 13:32:13,062 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 2710 transitions. Word has length 256 [2020-07-07 13:32:13,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:32:13,062 INFO L479 AbstractCegarLoop]: Abstraction has 2565 states and 2710 transitions. [2020-07-07 13:32:13,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-07 13:32:13,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 2710 transitions. [2020-07-07 13:32:13,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2020-07-07 13:32:13,065 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:32:13,065 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-07 13:32:13,066 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-07 13:32:13,066 INFO L427 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:32:13,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:32:13,066 INFO L82 PathProgramCache]: Analyzing trace with hash 122300953, now seen corresponding path program 1 times [2020-07-07 13:32:13,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:32:13,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [353476715] [2020-07-07 13:32:13,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:32:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:32:13,435 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:32:13,435 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [353476715] [2020-07-07 13:32:13,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:32:13,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:32:13,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957212139] [2020-07-07 13:32:13,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:32:13,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:32:13,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:32:13,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:32:13,437 INFO L87 Difference]: Start difference. First operand 2565 states and 2710 transitions. Second operand 9 states. [2020-07-07 13:32:15,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:32:15,629 INFO L93 Difference]: Finished difference Result 4958 states and 5249 transitions. [2020-07-07 13:32:15,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-07 13:32:15,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 309 [2020-07-07 13:32:15,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:32:15,635 INFO L225 Difference]: With dead ends: 4958 [2020-07-07 13:32:15,635 INFO L226 Difference]: Without dead ends: 2563 [2020-07-07 13:32:15,638 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2020-07-07 13:32:15,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2020-07-07 13:32:16,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2406. [2020-07-07 13:32:16,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2406 states. [2020-07-07 13:32:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 2535 transitions. [2020-07-07 13:32:16,023 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 2535 transitions. Word has length 309 [2020-07-07 13:32:16,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:32:16,023 INFO L479 AbstractCegarLoop]: Abstraction has 2406 states and 2535 transitions. [2020-07-07 13:32:16,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:32:16,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 2535 transitions. [2020-07-07 13:32:16,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2020-07-07 13:32:16,026 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:32:16,027 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2020-07-07 13:32:16,027 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-07 13:32:16,027 INFO L427 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:32:16,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:32:16,028 INFO L82 PathProgramCache]: Analyzing trace with hash -60760037, now seen corresponding path program 1 times [2020-07-07 13:32:16,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:32:16,028 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1904035241] [2020-07-07 13:32:16,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:32:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 13:32:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 13:32:16,336 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:32:16,337 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-07 13:32:16,337 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-07 13:32:16,338 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-07 13:32:16,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 01:32:16 BoogieIcfgContainer [2020-07-07 13:32:16,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 13:32:16,387 INFO L168 Benchmark]: Toolchain (without parser) took 90736.34 ms. Allocated memory was 145.2 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 101.5 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2020-07-07 13:32:16,388 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.2 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-07 13:32:16,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.91 ms. Allocated memory was 145.2 MB in the beginning and 205.5 MB in the end (delta: 60.3 MB). Free memory was 101.3 MB in the beginning and 169.1 MB in the end (delta: -67.8 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. [2020-07-07 13:32:16,389 INFO L168 Benchmark]: Boogie Preprocessor took 104.61 ms. Allocated memory is still 205.5 MB. Free memory was 169.1 MB in the beginning and 164.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2020-07-07 13:32:16,390 INFO L168 Benchmark]: RCFGBuilder took 1396.77 ms. Allocated memory was 205.5 MB in the beginning and 238.6 MB in the end (delta: 33.0 MB). Free memory was 164.1 MB in the beginning and 157.7 MB in the end (delta: 6.3 MB). Peak memory consumption was 80.1 MB. Max. memory is 7.1 GB. [2020-07-07 13:32:16,390 INFO L168 Benchmark]: TraceAbstraction took 88470.29 ms. Allocated memory was 238.6 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 157.7 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2020-07-07 13:32:16,393 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.18 ms. Allocated memory is still 145.2 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 758.91 ms. Allocated memory was 145.2 MB in the beginning and 205.5 MB in the end (delta: 60.3 MB). Free memory was 101.3 MB in the beginning and 169.1 MB in the end (delta: -67.8 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 104.61 ms. Allocated memory is still 205.5 MB. Free memory was 169.1 MB in the beginning and 164.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1396.77 ms. Allocated memory was 205.5 MB in the beginning and 238.6 MB in the end (delta: 33.0 MB). Free memory was 164.1 MB in the beginning and 157.7 MB in the end (delta: 6.3 MB). Peak memory consumption was 80.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88470.29 ms. Allocated memory was 238.6 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 157.7 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 422]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] return 21; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] return 21; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] return 26; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L278] COND TRUE (((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8)) [L279] a20 = 1 [L280] a8 = 13 [L281] a16 = 4 [L282] a7 = 0 [L283] a21 = 1 [L284] a17 = 0 [L285] return -1; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L418] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L421] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) [L422] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 525 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 88.3s, OverallIterations: 17, TraceHistogramMax: 5, AutomataDifference: 67.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5464 SDtfs, 23787 SDslu, 7570 SDs, 0 SdLazy, 26384 SolverSat, 2966 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 467 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2113 ImplicationChecksByTransitivity, 18.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9848occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 6939 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...