/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_label50.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 13:32:18,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 13:32:18,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 13:32:18,596 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 13:32:18,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 13:32:18,599 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 13:32:18,601 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 13:32:18,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 13:32:18,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 13:32:18,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 13:32:18,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 13:32:18,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 13:32:18,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 13:32:18,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 13:32:18,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 13:32:18,630 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 13:32:18,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 13:32:18,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 13:32:18,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 13:32:18,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 13:32:18,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 13:32:18,649 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 13:32:18,650 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 13:32:18,651 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 13:32:18,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 13:32:18,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 13:32:18,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 13:32:18,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 13:32:18,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 13:32:18,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 13:32:18,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 13:32:18,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 13:32:18,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 13:32:18,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 13:32:18,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 13:32:18,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 13:32:18,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 13:32:18,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 13:32:18,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 13:32:18,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 13:32:18,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 13:32:18,667 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:32:18,688 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 13:32:18,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 13:32:18,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 13:32:18,691 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 13:32:18,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 13:32:18,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 13:32:18,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 13:32:18,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 13:32:18,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 13:32:18,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 13:32:18,693 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 13:32:18,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 13:32:18,693 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 13:32:18,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 13:32:18,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 13:32:18,694 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-07 13:32:18,694 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 13:32:18,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 13:32:18,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:32:18,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 13:32:18,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-07 13:32:18,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 13:32:18,695 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-07 13:32:19,002 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 13:32:19,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 13:32:19,016 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 13:32:19,018 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 13:32:19,018 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 13:32:19,019 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label50.c [2020-07-07 13:32:19,092 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ddf81af7/6323b0f5759d41f0b9fdc7763a333ad0/FLAG9b87f518d [2020-07-07 13:32:19,624 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 13:32:19,625 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label50.c [2020-07-07 13:32:19,652 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ddf81af7/6323b0f5759d41f0b9fdc7763a333ad0/FLAG9b87f518d [2020-07-07 13:32:19,902 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ddf81af7/6323b0f5759d41f0b9fdc7763a333ad0 [2020-07-07 13:32:19,915 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 13:32:19,917 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 13:32:19,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 13:32:19,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 13:32:19,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 13:32:19,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:32:19" (1/1) ... [2020-07-07 13:32:19,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b6adb55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:32:19, skipping insertion in model container [2020-07-07 13:32:19,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:32:19" (1/1) ... [2020-07-07 13:32:19,935 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 13:32:19,981 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 13:32:20,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:32:20,577 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 13:32:20,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:32:20,678 INFO L208 MainTranslator]: Completed translation [2020-07-07 13:32:20,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:32:20 WrapperNode [2020-07-07 13:32:20,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 13:32:20,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 13:32:20,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 13:32:20,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 13:32:20,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:32:20" (1/1) ... [2020-07-07 13:32:20,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:32:20" (1/1) ... [2020-07-07 13:32:20,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:32:20" (1/1) ... [2020-07-07 13:32:20,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:32:20" (1/1) ... [2020-07-07 13:32:20,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:32:20" (1/1) ... [2020-07-07 13:32:20,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:32:20" (1/1) ... [2020-07-07 13:32:20,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:32:20" (1/1) ... [2020-07-07 13:32:20,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 13:32:20,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 13:32:20,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 13:32:20,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 13:32:20,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:32:20" (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:32:20,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 13:32:20,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 13:32:20,855 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-07-07 13:32:20,855 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 13:32:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-07-07 13:32:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 13:32:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 13:32:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-07 13:32:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 13:32:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 13:32:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 13:32:22,208 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 13:32:22,208 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-07 13:32:22,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:32:22 BoogieIcfgContainer [2020-07-07 13:32:22,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 13:32:22,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 13:32:22,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 13:32:22,221 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 13:32:22,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 01:32:19" (1/3) ... [2020-07-07 13:32:22,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb1ff88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:32:22, skipping insertion in model container [2020-07-07 13:32:22,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:32:20" (2/3) ... [2020-07-07 13:32:22,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb1ff88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:32:22, skipping insertion in model container [2020-07-07 13:32:22,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:32:22" (3/3) ... [2020-07-07 13:32:22,225 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label50.c [2020-07-07 13:32:22,237 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-07 13:32:22,246 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 13:32:22,260 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 13:32:22,283 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 13:32:22,283 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 13:32:22,283 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-07 13:32:22,283 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 13:32:22,284 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 13:32:22,284 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 13:32:22,284 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 13:32:22,284 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 13:32:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states. [2020-07-07 13:32:22,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-07-07 13:32:22,329 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:32:22,331 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] [2020-07-07 13:32:22,331 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:32:22,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:32:22,338 INFO L82 PathProgramCache]: Analyzing trace with hash 249673445, now seen corresponding path program 1 times [2020-07-07 13:32:22,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:32:22,348 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1202712419] [2020-07-07 13:32:22,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:32:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:22,945 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:22,945 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:32:22,948 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1202712419] [2020-07-07 13:32:22,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:32:22,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:32:22,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052875123] [2020-07-07 13:32:22,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:32:22,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:32:22,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:32:22,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:32:22,978 INFO L87 Difference]: Start difference. First operand 525 states. Second operand 5 states. [2020-07-07 13:32:25,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:32:25,870 INFO L93 Difference]: Finished difference Result 1360 states and 1895 transitions. [2020-07-07 13:32:25,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 13:32:25,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2020-07-07 13:32:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:32:25,897 INFO L225 Difference]: With dead ends: 1360 [2020-07-07 13:32:25,897 INFO L226 Difference]: Without dead ends: 781 [2020-07-07 13:32:25,909 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-07 13:32:25,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2020-07-07 13:32:26,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 746. [2020-07-07 13:32:26,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2020-07-07 13:32:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 932 transitions. [2020-07-07 13:32:26,072 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 932 transitions. Word has length 107 [2020-07-07 13:32:26,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:32:26,073 INFO L479 AbstractCegarLoop]: Abstraction has 746 states and 932 transitions. [2020-07-07 13:32:26,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:32:26,074 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 932 transitions. [2020-07-07 13:32:26,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-07-07 13:32:26,082 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:32:26,082 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] [2020-07-07 13:32:26,083 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 13:32:26,083 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:32:26,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:32:26,084 INFO L82 PathProgramCache]: Analyzing trace with hash -645015236, now seen corresponding path program 1 times [2020-07-07 13:32:26,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:32:26,084 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [435953334] [2020-07-07 13:32:26,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:32:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:26,450 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:26,451 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:32:26,451 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [435953334] [2020-07-07 13:32:26,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:32:26,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 13:32:26,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39661881] [2020-07-07 13:32:26,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 13:32:26,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:32:26,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 13:32:26,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-07 13:32:26,457 INFO L87 Difference]: Start difference. First operand 746 states and 932 transitions. Second operand 10 states. [2020-07-07 13:32:30,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:32:30,221 INFO L93 Difference]: Finished difference Result 2688 states and 3567 transitions. [2020-07-07 13:32:30,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-07 13:32:30,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 137 [2020-07-07 13:32:30,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:32:30,242 INFO L225 Difference]: With dead ends: 2688 [2020-07-07 13:32:30,242 INFO L226 Difference]: Without dead ends: 1966 [2020-07-07 13:32:30,250 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2020-07-07 13:32:30,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2020-07-07 13:32:30,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1565. [2020-07-07 13:32:30,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-07-07 13:32:30,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 1944 transitions. [2020-07-07 13:32:30,513 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 1944 transitions. Word has length 137 [2020-07-07 13:32:30,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:32:30,515 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 1944 transitions. [2020-07-07 13:32:30,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 13:32:30,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1944 transitions. [2020-07-07 13:32:30,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-07-07 13:32:30,529 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:32:30,530 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-07 13:32:30,530 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 13:32:30,530 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:32:30,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:32:30,531 INFO L82 PathProgramCache]: Analyzing trace with hash 752746431, now seen corresponding path program 1 times [2020-07-07 13:32:30,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:32:30,531 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1598078558] [2020-07-07 13:32:30,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:32:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:30,831 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:30,832 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:32:30,832 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1598078558] [2020-07-07 13:32:30,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:32:30,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-07 13:32:30,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913578277] [2020-07-07 13:32:30,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 13:32:30,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:32:30,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 13:32:30,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-07 13:32:30,834 INFO L87 Difference]: Start difference. First operand 1565 states and 1944 transitions. Second operand 8 states. [2020-07-07 13:32:33,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:32:33,685 INFO L93 Difference]: Finished difference Result 3618 states and 4811 transitions. [2020-07-07 13:32:33,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-07 13:32:33,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 154 [2020-07-07 13:32:33,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:32:33,726 INFO L225 Difference]: With dead ends: 3618 [2020-07-07 13:32:33,727 INFO L226 Difference]: Without dead ends: 2077 [2020-07-07 13:32:33,739 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2020-07-07 13:32:33,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2020-07-07 13:32:34,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 1877. [2020-07-07 13:32:34,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2020-07-07 13:32:34,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2349 transitions. [2020-07-07 13:32:34,232 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2349 transitions. Word has length 154 [2020-07-07 13:32:34,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:32:34,234 INFO L479 AbstractCegarLoop]: Abstraction has 1877 states and 2349 transitions. [2020-07-07 13:32:34,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 13:32:34,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2349 transitions. [2020-07-07 13:32:34,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-07-07 13:32:34,242 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:32:34,242 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-07 13:32:34,243 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 13:32:34,243 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:32:34,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:32:34,245 INFO L82 PathProgramCache]: Analyzing trace with hash 281598029, now seen corresponding path program 1 times [2020-07-07 13:32:34,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:32:34,245 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [380596642] [2020-07-07 13:32:34,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:32:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:34,529 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:34,529 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:32:34,530 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [380596642] [2020-07-07 13:32:34,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:32:34,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:32:34,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342536878] [2020-07-07 13:32:34,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:32:34,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:32:34,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:32:34,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:32:34,533 INFO L87 Difference]: Start difference. First operand 1877 states and 2349 transitions. Second operand 9 states. [2020-07-07 13:32:38,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:32:38,069 INFO L93 Difference]: Finished difference Result 4623 states and 5968 transitions. [2020-07-07 13:32:38,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-07 13:32:38,070 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2020-07-07 13:32:38,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:32:38,089 INFO L225 Difference]: With dead ends: 4623 [2020-07-07 13:32:38,089 INFO L226 Difference]: Without dead ends: 2358 [2020-07-07 13:32:38,100 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2020-07-07 13:32:38,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2358 states. [2020-07-07 13:32:38,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2358 to 1758. [2020-07-07 13:32:38,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1758 states. [2020-07-07 13:32:38,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 2016 transitions. [2020-07-07 13:32:38,398 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 2016 transitions. Word has length 158 [2020-07-07 13:32:38,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:32:38,399 INFO L479 AbstractCegarLoop]: Abstraction has 1758 states and 2016 transitions. [2020-07-07 13:32:38,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:32:38,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 2016 transitions. [2020-07-07 13:32:38,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-07 13:32:38,404 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:32:38,404 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-07 13:32:38,405 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 13:32:38,405 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:32:38,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:32:38,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1334073201, now seen corresponding path program 1 times [2020-07-07 13:32:38,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:32:38,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1841231010] [2020-07-07 13:32:38,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:32:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:38,627 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:38,627 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:32:38,628 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1841231010] [2020-07-07 13:32:38,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:32:38,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-07 13:32:38,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912472155] [2020-07-07 13:32:38,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 13:32:38,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:32:38,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 13:32:38,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-07-07 13:32:38,631 INFO L87 Difference]: Start difference. First operand 1758 states and 2016 transitions. Second operand 8 states. [2020-07-07 13:32:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:32:41,240 INFO L93 Difference]: Finished difference Result 5754 states and 7145 transitions. [2020-07-07 13:32:41,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-07 13:32:41,240 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 175 [2020-07-07 13:32:41,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:32:41,281 INFO L225 Difference]: With dead ends: 5754 [2020-07-07 13:32:41,281 INFO L226 Difference]: Without dead ends: 4020 [2020-07-07 13:32:41,289 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-07-07 13:32:41,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4020 states. [2020-07-07 13:32:41,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4020 to 3770. [2020-07-07 13:32:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3770 states. [2020-07-07 13:32:41,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3770 states to 3770 states and 4630 transitions. [2020-07-07 13:32:41,959 INFO L78 Accepts]: Start accepts. Automaton has 3770 states and 4630 transitions. Word has length 175 [2020-07-07 13:32:41,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:32:41,960 INFO L479 AbstractCegarLoop]: Abstraction has 3770 states and 4630 transitions. [2020-07-07 13:32:41,960 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 13:32:41,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3770 states and 4630 transitions. [2020-07-07 13:32:41,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-07-07 13:32:41,972 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:32:41,973 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,973 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 13:32:41,973 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:32:41,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:32:41,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1736106666, now seen corresponding path program 1 times [2020-07-07 13:32:41,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:32:41,974 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1847404272] [2020-07-07 13:32:41,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:32:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:42,220 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:42,220 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:32:42,221 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1847404272] [2020-07-07 13:32:42,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:32:42,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:32:42,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721429208] [2020-07-07 13:32:42,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:32:42,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:32:42,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:32:42,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:32:42,223 INFO L87 Difference]: Start difference. First operand 3770 states and 4630 transitions. Second operand 9 states. [2020-07-07 13:32:45,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:32:45,337 INFO L93 Difference]: Finished difference Result 8807 states and 11096 transitions. [2020-07-07 13:32:45,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-07 13:32:45,338 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 180 [2020-07-07 13:32:45,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:32:45,377 INFO L225 Difference]: With dead ends: 8807 [2020-07-07 13:32:45,377 INFO L226 Difference]: Without dead ends: 5061 [2020-07-07 13:32:45,397 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2020-07-07 13:32:45,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5061 states. [2020-07-07 13:32:46,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5061 to 4691. [2020-07-07 13:32:46,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4691 states. [2020-07-07 13:32:46,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4691 states to 4691 states and 5650 transitions. [2020-07-07 13:32:46,378 INFO L78 Accepts]: Start accepts. Automaton has 4691 states and 5650 transitions. Word has length 180 [2020-07-07 13:32:46,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:32:46,379 INFO L479 AbstractCegarLoop]: Abstraction has 4691 states and 5650 transitions. [2020-07-07 13:32:46,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:32:46,379 INFO L276 IsEmpty]: Start isEmpty. Operand 4691 states and 5650 transitions. [2020-07-07 13:32:46,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-07-07 13:32:46,388 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:32:46,389 INFO L422 BasicCegarLoop]: trace histogram [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, 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:32:46,389 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 13:32:46,389 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:32:46,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:32:46,390 INFO L82 PathProgramCache]: Analyzing trace with hash -77223011, now seen corresponding path program 1 times [2020-07-07 13:32:46,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:32:46,391 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [323110470] [2020-07-07 13:32:46,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:32:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:46,675 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:46,675 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:32:46,676 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [323110470] [2020-07-07 13:32:46,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:32:46,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-07 13:32:46,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600723766] [2020-07-07 13:32:46,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 13:32:46,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:32:46,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 13:32:46,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-07-07 13:32:46,678 INFO L87 Difference]: Start difference. First operand 4691 states and 5650 transitions. Second operand 8 states. [2020-07-07 13:32:49,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:32:49,014 INFO L93 Difference]: Finished difference Result 9959 states and 12231 transitions. [2020-07-07 13:32:49,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-07 13:32:49,015 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2020-07-07 13:32:49,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:32:49,057 INFO L225 Difference]: With dead ends: 9959 [2020-07-07 13:32:49,058 INFO L226 Difference]: Without dead ends: 5292 [2020-07-07 13:32:49,080 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 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:32:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5292 states. [2020-07-07 13:32:49,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5292 to 5064. [2020-07-07 13:32:49,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5064 states. [2020-07-07 13:32:49,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5064 states to 5064 states and 6080 transitions. [2020-07-07 13:32:49,999 INFO L78 Accepts]: Start accepts. Automaton has 5064 states and 6080 transitions. Word has length 227 [2020-07-07 13:32:50,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:32:50,000 INFO L479 AbstractCegarLoop]: Abstraction has 5064 states and 6080 transitions. [2020-07-07 13:32:50,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 13:32:50,000 INFO L276 IsEmpty]: Start isEmpty. Operand 5064 states and 6080 transitions. [2020-07-07 13:32:50,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2020-07-07 13:32:50,010 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:32:50,011 INFO L422 BasicCegarLoop]: trace histogram [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, 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:50,011 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 13:32:50,011 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:32:50,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:32:50,012 INFO L82 PathProgramCache]: Analyzing trace with hash -956100572, now seen corresponding path program 1 times [2020-07-07 13:32:50,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:32:50,012 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1109960122] [2020-07-07 13:32:50,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:32:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:50,344 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:50,344 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:32:50,344 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1109960122] [2020-07-07 13:32:50,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:32:50,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 13:32:50,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423030029] [2020-07-07 13:32:50,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 13:32:50,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:32:50,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 13:32:50,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-07 13:32:50,347 INFO L87 Difference]: Start difference. First operand 5064 states and 6080 transitions. Second operand 10 states. [2020-07-07 13:32:57,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:32:57,093 INFO L93 Difference]: Finished difference Result 16529 states and 20903 transitions. [2020-07-07 13:32:57,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-07 13:32:57,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 241 [2020-07-07 13:32:57,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:32:57,184 INFO L225 Difference]: With dead ends: 16529 [2020-07-07 13:32:57,184 INFO L226 Difference]: Without dead ends: 11489 [2020-07-07 13:32:57,217 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2020-07-07 13:32:57,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11489 states. [2020-07-07 13:32:58,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11489 to 11075. [2020-07-07 13:32:58,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11075 states. [2020-07-07 13:32:58,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11075 states to 11075 states and 13679 transitions. [2020-07-07 13:32:58,886 INFO L78 Accepts]: Start accepts. Automaton has 11075 states and 13679 transitions. Word has length 241 [2020-07-07 13:32:58,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:32:58,886 INFO L479 AbstractCegarLoop]: Abstraction has 11075 states and 13679 transitions. [2020-07-07 13:32:58,886 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 13:32:58,887 INFO L276 IsEmpty]: Start isEmpty. Operand 11075 states and 13679 transitions. [2020-07-07 13:32:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2020-07-07 13:32:58,901 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:32:58,902 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,902 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 13:32:58,902 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:32:58,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:32:58,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1189207655, now seen corresponding path program 1 times [2020-07-07 13:32:58,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:32:58,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1995167832] [2020-07-07 13:32:58,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:32:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:59,300 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:59,301 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:32:59,301 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1995167832] [2020-07-07 13:32:59,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:32:59,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:32:59,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801880340] [2020-07-07 13:32:59,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:32:59,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:32:59,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:32:59,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:32:59,303 INFO L87 Difference]: Start difference. First operand 11075 states and 13679 transitions. Second operand 9 states. [2020-07-07 13:33:03,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:33:03,990 INFO L93 Difference]: Finished difference Result 24464 states and 30379 transitions. [2020-07-07 13:33:03,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-07 13:33:03,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 270 [2020-07-07 13:33:03,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:33:04,094 INFO L225 Difference]: With dead ends: 24464 [2020-07-07 13:33:04,095 INFO L226 Difference]: Without dead ends: 13423 [2020-07-07 13:33:04,145 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2020-07-07 13:33:04,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13423 states. [2020-07-07 13:33:05,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13423 to 12638. [2020-07-07 13:33:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12638 states. [2020-07-07 13:33:05,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12638 states to 12638 states and 15620 transitions. [2020-07-07 13:33:05,786 INFO L78 Accepts]: Start accepts. Automaton has 12638 states and 15620 transitions. Word has length 270 [2020-07-07 13:33:05,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:33:05,786 INFO L479 AbstractCegarLoop]: Abstraction has 12638 states and 15620 transitions. [2020-07-07 13:33:05,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:33:05,787 INFO L276 IsEmpty]: Start isEmpty. Operand 12638 states and 15620 transitions. [2020-07-07 13:33:05,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2020-07-07 13:33:05,799 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:33:05,799 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:05,799 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-07 13:33:05,799 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:33:05,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:33:05,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1238122025, now seen corresponding path program 1 times [2020-07-07 13:33:05,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:33:05,800 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [806962247] [2020-07-07 13:33:05,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:33:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 13:33:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 13:33:06,021 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:33:06,022 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-07 13:33:06,022 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-07 13:33:06,023 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-07 13:33:06,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 01:33:06 BoogieIcfgContainer [2020-07-07 13:33:06,062 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 13:33:06,064 INFO L168 Benchmark]: Toolchain (without parser) took 46146.70 ms. Allocated memory was 145.8 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 102.5 MB in the beginning and 832.7 MB in the end (delta: -730.2 MB). Peak memory consumption was 969.0 MB. Max. memory is 7.1 GB. [2020-07-07 13:33:06,065 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-07 13:33:06,066 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.81 ms. Allocated memory was 145.8 MB in the beginning and 206.0 MB in the end (delta: 60.3 MB). Free memory was 102.3 MB in the beginning and 171.6 MB in the end (delta: -69.4 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. [2020-07-07 13:33:06,067 INFO L168 Benchmark]: Boogie Preprocessor took 101.25 ms. Allocated memory is still 206.0 MB. Free memory was 171.6 MB in the beginning and 166.6 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:33:06,068 INFO L168 Benchmark]: RCFGBuilder took 1435.82 ms. Allocated memory was 206.0 MB in the beginning and 239.6 MB in the end (delta: 33.6 MB). Free memory was 166.6 MB in the beginning and 159.6 MB in the end (delta: 7.0 MB). Peak memory consumption was 81.6 MB. Max. memory is 7.1 GB. [2020-07-07 13:33:06,069 INFO L168 Benchmark]: TraceAbstraction took 43843.92 ms. Allocated memory was 239.6 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 159.6 MB in the beginning and 832.7 MB in the end (delta: -673.1 MB). Peak memory consumption was 932.3 MB. Max. memory is 7.1 GB. [2020-07-07 13:33:06,072 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.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 759.81 ms. Allocated memory was 145.8 MB in the beginning and 206.0 MB in the end (delta: 60.3 MB). Free memory was 102.3 MB in the beginning and 171.6 MB in the end (delta: -69.4 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 101.25 ms. Allocated memory is still 206.0 MB. Free memory was 171.6 MB in the beginning and 166.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1435.82 ms. Allocated memory was 206.0 MB in the beginning and 239.6 MB in the end (delta: 33.6 MB). Free memory was 166.6 MB in the beginning and 159.6 MB in the end (delta: 7.0 MB). Peak memory consumption was 81.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 43843.92 ms. Allocated memory was 239.6 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 159.6 MB in the beginning and 832.7 MB in the end (delta: -673.1 MB). Peak memory consumption was 932.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 413]: 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 TRUE ((((((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)) [L85] a7 = 0 [L86] a20 = 1 [L87] a8 = 14 [L88] a16 = 4 [L89] a21 = 1 [L90] a17 = 0 [L91] 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 TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) [L413] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 525 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 43.7s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 33.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2985 SDtfs, 12757 SDslu, 4875 SDs, 0 SdLazy, 15654 SolverSat, 1897 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12638occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 3283 StatesRemovedByMinimization, 9 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...