/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/Problem02_label13.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 13:36:26,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 13:36:26,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 13:36:26,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 13:36:26,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 13:36:26,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 13:36:26,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 13:36:26,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 13:36:26,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 13:36:26,467 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 13:36:26,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 13:36:26,472 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 13:36:26,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 13:36:26,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 13:36:26,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 13:36:26,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 13:36:26,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 13:36:26,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 13:36:26,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 13:36:26,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 13:36:26,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 13:36:26,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 13:36:26,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 13:36:26,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 13:36:26,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 13:36:26,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 13:36:26,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 13:36:26,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 13:36:26,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 13:36:26,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 13:36:26,506 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 13:36:26,507 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 13:36:26,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 13:36:26,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 13:36:26,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 13:36:26,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 13:36:26,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 13:36:26,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 13:36:26,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 13:36:26,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 13:36:26,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 13:36:26,513 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:36:26,522 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 13:36:26,522 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 13:36:26,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 13:36:26,523 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 13:36:26,524 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 13:36:26,524 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 13:36:26,524 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 13:36:26,524 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 13:36:26,524 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 13:36:26,525 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 13:36:26,525 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 13:36:26,525 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 13:36:26,525 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 13:36:26,525 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 13:36:26,526 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 13:36:26,526 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-07 13:36:26,526 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 13:36:26,526 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 13:36:26,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:36:26,527 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 13:36:26,527 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-07 13:36:26,527 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 13:36:26,527 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-07 13:36:26,810 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 13:36:26,824 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 13:36:26,827 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 13:36:26,833 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 13:36:26,833 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 13:36:26,834 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label13.c [2020-07-07 13:36:26,914 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56d9c2a0b/78d0ee83985c4fd8b9c95e7b7636facd/FLAG94a1e148f [2020-07-07 13:36:27,534 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 13:36:27,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label13.c [2020-07-07 13:36:27,546 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56d9c2a0b/78d0ee83985c4fd8b9c95e7b7636facd/FLAG94a1e148f [2020-07-07 13:36:27,864 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56d9c2a0b/78d0ee83985c4fd8b9c95e7b7636facd [2020-07-07 13:36:27,875 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 13:36:27,877 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 13:36:27,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 13:36:27,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 13:36:27,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 13:36:27,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:36:27" (1/1) ... [2020-07-07 13:36:27,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10cb5463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:36:27, skipping insertion in model container [2020-07-07 13:36:27,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:36:27" (1/1) ... [2020-07-07 13:36:27,894 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 13:36:27,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 13:36:28,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:36:28,452 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 13:36:28,546 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:36:28,575 INFO L208 MainTranslator]: Completed translation [2020-07-07 13:36:28,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:36:28 WrapperNode [2020-07-07 13:36:28,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 13:36:28,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 13:36:28,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 13:36:28,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 13:36:28,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:36:28" (1/1) ... [2020-07-07 13:36:28,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:36:28" (1/1) ... [2020-07-07 13:36:28,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:36:28" (1/1) ... [2020-07-07 13:36:28,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:36:28" (1/1) ... [2020-07-07 13:36:28,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:36:28" (1/1) ... [2020-07-07 13:36:28,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:36:28" (1/1) ... [2020-07-07 13:36:28,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:36:28" (1/1) ... [2020-07-07 13:36:28,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 13:36:28,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 13:36:28,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 13:36:28,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 13:36:28,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:36:28" (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:36:28,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 13:36:28,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 13:36:28,748 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-07-07 13:36:28,748 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 13:36:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-07-07 13:36:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 13:36:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 13:36:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-07 13:36:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 13:36:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 13:36:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 13:36:29,991 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 13:36:29,991 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-07 13:36:30,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:36:30 BoogieIcfgContainer [2020-07-07 13:36:30,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 13:36:30,001 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 13:36:30,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 13:36:30,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 13:36:30,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 01:36:27" (1/3) ... [2020-07-07 13:36:30,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4914fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:36:30, skipping insertion in model container [2020-07-07 13:36:30,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:36:28" (2/3) ... [2020-07-07 13:36:30,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4914fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:36:30, skipping insertion in model container [2020-07-07 13:36:30,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:36:30" (3/3) ... [2020-07-07 13:36:30,009 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label13.c [2020-07-07 13:36:30,020 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-07 13:36:30,029 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 13:36:30,043 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 13:36:30,066 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 13:36:30,066 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 13:36:30,066 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-07 13:36:30,067 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 13:36:30,067 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 13:36:30,067 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 13:36:30,067 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 13:36:30,067 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 13:36:30,092 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states. [2020-07-07 13:36:30,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-07-07 13:36:30,114 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:36:30,115 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:36:30,116 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:36:30,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:36:30,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1743137911, now seen corresponding path program 1 times [2020-07-07 13:36:30,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:36:30,132 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2074453799] [2020-07-07 13:36:30,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:36:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:36:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:36:30,664 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:36:30,665 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:36:30,667 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2074453799] [2020-07-07 13:36:30,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:36:30,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:36:30,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509053269] [2020-07-07 13:36:30,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:36:30,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:36:30,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:36:30,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:36:30,695 INFO L87 Difference]: Start difference. First operand 527 states. Second operand 5 states. [2020-07-07 13:36:33,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:36:33,896 INFO L93 Difference]: Finished difference Result 1630 states and 2234 transitions. [2020-07-07 13:36:33,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 13:36:33,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2020-07-07 13:36:33,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:36:33,924 INFO L225 Difference]: With dead ends: 1630 [2020-07-07 13:36:33,924 INFO L226 Difference]: Without dead ends: 1017 [2020-07-07 13:36:33,936 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:36:33,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2020-07-07 13:36:34,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 806. [2020-07-07 13:36:34,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-07-07 13:36:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1016 transitions. [2020-07-07 13:36:34,118 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1016 transitions. Word has length 112 [2020-07-07 13:36:34,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:36:34,119 INFO L479 AbstractCegarLoop]: Abstraction has 806 states and 1016 transitions. [2020-07-07 13:36:34,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:36:34,119 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1016 transitions. [2020-07-07 13:36:34,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-07-07 13:36:34,127 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:36:34,128 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:36:34,128 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 13:36:34,129 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:36:34,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:36:34,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1416088099, now seen corresponding path program 1 times [2020-07-07 13:36:34,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:36:34,130 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1695669213] [2020-07-07 13:36:34,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:36:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:36:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:36:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:36:34,361 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:36:34,361 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:36:34,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1695669213] [2020-07-07 13:36:34,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:36:34,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:36:34,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790019069] [2020-07-07 13:36:34,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:36:34,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:36:34,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:36:34,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:36:34,365 INFO L87 Difference]: Start difference. First operand 806 states and 1016 transitions. Second operand 5 states. [2020-07-07 13:36:36,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:36:36,265 INFO L93 Difference]: Finished difference Result 2057 states and 2721 transitions. [2020-07-07 13:36:36,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 13:36:36,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2020-07-07 13:36:36,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:36:36,277 INFO L225 Difference]: With dead ends: 2057 [2020-07-07 13:36:36,277 INFO L226 Difference]: Without dead ends: 1273 [2020-07-07 13:36:36,282 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-07 13:36:36,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2020-07-07 13:36:36,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1261. [2020-07-07 13:36:36,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1261 states. [2020-07-07 13:36:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1624 transitions. [2020-07-07 13:36:36,434 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1624 transitions. Word has length 130 [2020-07-07 13:36:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:36:36,435 INFO L479 AbstractCegarLoop]: Abstraction has 1261 states and 1624 transitions. [2020-07-07 13:36:36,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:36:36,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1624 transitions. [2020-07-07 13:36:36,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-07-07 13:36:36,441 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:36:36,441 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:36,442 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 13:36:36,442 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:36:36,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:36:36,442 INFO L82 PathProgramCache]: Analyzing trace with hash -564964590, now seen corresponding path program 1 times [2020-07-07 13:36:36,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:36:36,443 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [326299236] [2020-07-07 13:36:36,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:36:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:36:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:36:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:36:36,739 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:36:36,740 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:36:36,740 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [326299236] [2020-07-07 13:36:36,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:36:36,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:36:36,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140223755] [2020-07-07 13:36:36,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:36:36,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:36:36,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:36:36,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:36:36,743 INFO L87 Difference]: Start difference. First operand 1261 states and 1624 transitions. Second operand 9 states. [2020-07-07 13:36:38,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:36:38,158 INFO L93 Difference]: Finished difference Result 2490 states and 3353 transitions. [2020-07-07 13:36:38,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-07 13:36:38,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 156 [2020-07-07 13:36:38,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:36:38,175 INFO L225 Difference]: With dead ends: 2490 [2020-07-07 13:36:38,179 INFO L226 Difference]: Without dead ends: 1251 [2020-07-07 13:36:38,187 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-07 13:36:38,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2020-07-07 13:36:38,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1177. [2020-07-07 13:36:38,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2020-07-07 13:36:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1454 transitions. [2020-07-07 13:36:38,337 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1454 transitions. Word has length 156 [2020-07-07 13:36:38,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:36:38,337 INFO L479 AbstractCegarLoop]: Abstraction has 1177 states and 1454 transitions. [2020-07-07 13:36:38,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:36:38,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1454 transitions. [2020-07-07 13:36:38,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-07 13:36:38,342 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:36:38,343 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, 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] [2020-07-07 13:36:38,345 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 13:36:38,346 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:36:38,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:36:38,346 INFO L82 PathProgramCache]: Analyzing trace with hash -91247174, now seen corresponding path program 1 times [2020-07-07 13:36:38,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:36:38,347 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1668713358] [2020-07-07 13:36:38,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:36:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:36:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:36:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:36:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:36:38,612 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:36:38,613 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:36:38,613 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1668713358] [2020-07-07 13:36:38,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:36:38,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-07 13:36:38,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111811428] [2020-07-07 13:36:38,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 13:36:38,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:36:38,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 13:36:38,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-07 13:36:38,619 INFO L87 Difference]: Start difference. First operand 1177 states and 1454 transitions. Second operand 8 states. [2020-07-07 13:36:40,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:36:40,841 INFO L93 Difference]: Finished difference Result 3242 states and 4114 transitions. [2020-07-07 13:36:40,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 13:36:40,844 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 175 [2020-07-07 13:36:40,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:36:40,856 INFO L225 Difference]: With dead ends: 3242 [2020-07-07 13:36:40,857 INFO L226 Difference]: Without dead ends: 1393 [2020-07-07 13:36:40,864 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-07-07 13:36:40,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-07-07 13:36:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1380. [2020-07-07 13:36:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1380 states. [2020-07-07 13:36:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1621 transitions. [2020-07-07 13:36:41,056 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1621 transitions. Word has length 175 [2020-07-07 13:36:41,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:36:41,057 INFO L479 AbstractCegarLoop]: Abstraction has 1380 states and 1621 transitions. [2020-07-07 13:36:41,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 13:36:41,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1621 transitions. [2020-07-07 13:36:41,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2020-07-07 13:36:41,065 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:36:41,065 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-07-07 13:36:41,065 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 13:36:41,066 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:36:41,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:36:41,066 INFO L82 PathProgramCache]: Analyzing trace with hash 54957218, now seen corresponding path program 1 times [2020-07-07 13:36:41,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:36:41,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1845309198] [2020-07-07 13:36:41,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:36:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:36:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:36:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:36:41,555 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:36:41,555 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:36:41,556 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1845309198] [2020-07-07 13:36:41,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:36:41,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 13:36:41,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800831100] [2020-07-07 13:36:41,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 13:36:41,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:36:41,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 13:36:41,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-07 13:36:41,560 INFO L87 Difference]: Start difference. First operand 1380 states and 1621 transitions. Second operand 10 states. [2020-07-07 13:36:44,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:36:44,800 INFO L93 Difference]: Finished difference Result 4018 states and 4994 transitions. [2020-07-07 13:36:44,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-07 13:36:44,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 196 [2020-07-07 13:36:44,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:36:44,821 INFO L225 Difference]: With dead ends: 4018 [2020-07-07 13:36:44,821 INFO L226 Difference]: Without dead ends: 2810 [2020-07-07 13:36:44,828 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2020-07-07 13:36:44,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2020-07-07 13:36:45,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 2471. [2020-07-07 13:36:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2471 states. [2020-07-07 13:36:45,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 2863 transitions. [2020-07-07 13:36:45,085 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 2863 transitions. Word has length 196 [2020-07-07 13:36:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:36:45,085 INFO L479 AbstractCegarLoop]: Abstraction has 2471 states and 2863 transitions. [2020-07-07 13:36:45,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 13:36:45,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 2863 transitions. [2020-07-07 13:36:45,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-07-07 13:36:45,095 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:36:45,095 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:45,095 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 13:36:45,095 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:36:45,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:36:45,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1650536411, now seen corresponding path program 1 times [2020-07-07 13:36:45,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:36:45,096 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1529299015] [2020-07-07 13:36:45,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:36:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:36:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:36:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:36:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:36:45,676 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:36:45,676 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:36:45,677 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1529299015] [2020-07-07 13:36:45,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:36:45,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-07 13:36:45,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839951805] [2020-07-07 13:36:45,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-07 13:36:45,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:36:45,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-07 13:36:45,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-07 13:36:45,679 INFO L87 Difference]: Start difference. First operand 2471 states and 2863 transitions. Second operand 11 states. [2020-07-07 13:36:48,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:36:48,785 INFO L93 Difference]: Finished difference Result 5736 states and 6709 transitions. [2020-07-07 13:36:48,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-07 13:36:48,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 213 [2020-07-07 13:36:48,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:36:48,808 INFO L225 Difference]: With dead ends: 5736 [2020-07-07 13:36:48,808 INFO L226 Difference]: Without dead ends: 3437 [2020-07-07 13:36:48,816 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=677, Unknown=0, NotChecked=0, Total=930 [2020-07-07 13:36:48,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2020-07-07 13:36:49,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 3255. [2020-07-07 13:36:49,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2020-07-07 13:36:49,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 3736 transitions. [2020-07-07 13:36:49,389 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 3736 transitions. Word has length 213 [2020-07-07 13:36:49,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:36:49,397 INFO L479 AbstractCegarLoop]: Abstraction has 3255 states and 3736 transitions. [2020-07-07 13:36:49,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-07 13:36:49,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 3736 transitions. [2020-07-07 13:36:49,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-07-07 13:36:49,413 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:36:49,414 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:49,414 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 13:36:49,414 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:36:49,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:36:49,414 INFO L82 PathProgramCache]: Analyzing trace with hash -44650108, now seen corresponding path program 1 times [2020-07-07 13:36:49,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:36:49,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [410189332] [2020-07-07 13:36:49,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:36:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:36:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:36:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:36:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:36:49,837 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:36:49,838 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:36:49,838 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [410189332] [2020-07-07 13:36:49,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:36:49,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 13:36:49,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680032444] [2020-07-07 13:36:49,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 13:36:49,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:36:49,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 13:36:49,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-07 13:36:49,840 INFO L87 Difference]: Start difference. First operand 3255 states and 3736 transitions. Second operand 10 states. [2020-07-07 13:36:53,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:36:53,253 INFO L93 Difference]: Finished difference Result 7380 states and 8584 transitions. [2020-07-07 13:36:53,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-07 13:36:53,254 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 218 [2020-07-07 13:36:53,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:36:53,279 INFO L225 Difference]: With dead ends: 7380 [2020-07-07 13:36:53,280 INFO L226 Difference]: Without dead ends: 4134 [2020-07-07 13:36:53,288 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2020-07-07 13:36:53,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4134 states. [2020-07-07 13:36:53,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4134 to 3721. [2020-07-07 13:36:53,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3721 states. [2020-07-07 13:36:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 4152 transitions. [2020-07-07 13:36:53,804 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 4152 transitions. Word has length 218 [2020-07-07 13:36:53,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:36:53,805 INFO L479 AbstractCegarLoop]: Abstraction has 3721 states and 4152 transitions. [2020-07-07 13:36:53,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 13:36:53,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 4152 transitions. [2020-07-07 13:36:53,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2020-07-07 13:36:53,817 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:36:53,818 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-07-07 13:36:53,818 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 13:36:53,818 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:36:53,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:36:53,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1161023568, now seen corresponding path program 1 times [2020-07-07 13:36:53,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:36:53,821 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [204787560] [2020-07-07 13:36:53,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:36:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 13:36:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 13:36:54,058 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:36:54,059 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-07 13:36:54,059 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-07 13:36:54,062 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 13:36:54,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 01:36:54 BoogieIcfgContainer [2020-07-07 13:36:54,108 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 13:36:54,110 INFO L168 Benchmark]: Toolchain (without parser) took 26233.08 ms. Allocated memory was 138.9 MB in the beginning and 787.0 MB in the end (delta: 648.0 MB). Free memory was 102.1 MB in the beginning and 137.7 MB in the end (delta: -35.5 MB). Peak memory consumption was 612.5 MB. Max. memory is 7.1 GB. [2020-07-07 13:36:54,111 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 138.9 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:36:54,112 INFO L168 Benchmark]: CACSL2BoogieTranslator took 697.73 ms. Allocated memory was 138.9 MB in the beginning and 205.0 MB in the end (delta: 66.1 MB). Free memory was 101.9 MB in the beginning and 171.4 MB in the end (delta: -69.5 MB). Peak memory consumption was 34.2 MB. Max. memory is 7.1 GB. [2020-07-07 13:36:54,113 INFO L168 Benchmark]: Boogie Preprocessor took 100.91 ms. Allocated memory is still 205.0 MB. Free memory was 171.4 MB in the beginning and 166.5 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2020-07-07 13:36:54,114 INFO L168 Benchmark]: RCFGBuilder took 1323.21 ms. Allocated memory was 205.0 MB in the beginning and 238.6 MB in the end (delta: 33.6 MB). Free memory was 166.5 MB in the beginning and 161.9 MB in the end (delta: 4.6 MB). Peak memory consumption was 82.3 MB. Max. memory is 7.1 GB. [2020-07-07 13:36:54,115 INFO L168 Benchmark]: TraceAbstraction took 24106.24 ms. Allocated memory was 238.6 MB in the beginning and 787.0 MB in the end (delta: 548.4 MB). Free memory was 161.9 MB in the beginning and 137.7 MB in the end (delta: 24.2 MB). Peak memory consumption was 572.6 MB. Max. memory is 7.1 GB. [2020-07-07 13:36:54,118 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.28 ms. Allocated memory is still 138.9 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 697.73 ms. Allocated memory was 138.9 MB in the beginning and 205.0 MB in the end (delta: 66.1 MB). Free memory was 101.9 MB in the beginning and 171.4 MB in the end (delta: -69.5 MB). Peak memory consumption was 34.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 100.91 ms. Allocated memory is still 205.0 MB. Free memory was 171.4 MB in the beginning and 166.5 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1323.21 ms. Allocated memory was 205.0 MB in the beginning and 238.6 MB in the end (delta: 33.6 MB). Free memory was 166.5 MB in the beginning and 161.9 MB in the end (delta: 4.6 MB). Peak memory consumption was 82.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24106.24 ms. Allocated memory was 238.6 MB in the beginning and 787.0 MB in the end (delta: 548.4 MB). Free memory was 161.9 MB in the beginning and 137.7 MB in the end (delta: 24.2 MB). Peak memory consumption was 572.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 430]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND TRUE (((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1)) [L166] a25 = 1 [L167] a28 = 9 [L168] return 26; [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) [L368] COND TRUE ((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1))) [L369] a11 = 1 [L370] a19 = 0 [L371] a25 = 1 [L372] a17 = 7 [L373] a28 = 9 [L374] return -1; [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L420] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L423] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L426] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) [L429] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7)) [L430] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 527 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 23.9s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1734 SDtfs, 9850 SDslu, 1926 SDs, 0 SdLazy, 9518 SolverSat, 1208 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3721occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 7 MinimizatonAttempts, 1244 StatesRemovedByMinimization, 7 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...