/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options produce-proofs=true --traceabstraction.additional.smt.options produce-unsat-cores=true --traceabstraction.additional.smt.options enumeration-timeout=1000 --traceabstraction.additional.smt.options interpolation-heuristic=SMALLEST --traceabstraction.additional.smt.options log-additional-information=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label55.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 12:32:02,285 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 12:32:02,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 12:32:02,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 12:32:02,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 12:32:02,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 12:32:02,347 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 12:32:02,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 12:32:02,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 12:32:02,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 12:32:02,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 12:32:02,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 12:32:02,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 12:32:02,363 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 12:32:02,366 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 12:32:02,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 12:32:02,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 12:32:02,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 12:32:02,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 12:32:02,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 12:32:02,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 12:32:02,385 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 12:32:02,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 12:32:02,387 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 12:32:02,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 12:32:02,399 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 12:32:02,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 12:32:02,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 12:32:02,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 12:32:02,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 12:32:02,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 12:32:02,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 12:32:02,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 12:32:02,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 12:32:02,419 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 12:32:02,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 12:32:02,420 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 12:32:02,421 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 12:32:02,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 12:32:02,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 12:32:02,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 12:32:02,425 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-21 12:32:02,471 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 12:32:02,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 12:32:02,473 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 12:32:02,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 12:32:02,474 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 12:32:02,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 12:32:02,474 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 12:32:02,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 12:32:02,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 12:32:02,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 12:32:02,476 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 12:32:02,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 12:32:02,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 12:32:02,477 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 12:32:02,477 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 12:32:02,478 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 12:32:02,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 12:32:02,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 12:32:02,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 12:32:02,479 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 12:32:02,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 12:32:02,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 12:32:02,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 12:32:02,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 12:32:02,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 12:32:02,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 12:32:02,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 12:32:02,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 12:32:02,480 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 12:32:02,481 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=1000;interpolation-heuristic=SMALLEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=1000;interpolation-heuristic=SMALLEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=1000;interpolation-heuristic=SMALLEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=1000;interpolation-heuristic=SMALLEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=1000;interpolation-heuristic=SMALLEST;log-additional-information=true; [2020-09-21 12:32:02,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 12:32:02,969 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 12:32:02,973 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 12:32:02,975 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 12:32:02,976 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 12:32:02,977 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label55.c [2020-09-21 12:32:03,073 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/dbc95a108/19b6877e129d4871800f7da6dc56e1ea/FLAG64c761765 [2020-09-21 12:32:03,712 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 12:32:03,712 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label55.c [2020-09-21 12:32:03,728 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/dbc95a108/19b6877e129d4871800f7da6dc56e1ea/FLAG64c761765 [2020-09-21 12:32:03,947 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/dbc95a108/19b6877e129d4871800f7da6dc56e1ea [2020-09-21 12:32:03,965 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 12:32:03,972 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 12:32:03,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 12:32:03,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 12:32:03,980 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 12:32:03,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 12:32:03" (1/1) ... [2020-09-21 12:32:03,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad15a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:32:03, skipping insertion in model container [2020-09-21 12:32:03,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 12:32:03" (1/1) ... [2020-09-21 12:32:04,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 12:32:04,075 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 12:32:04,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 12:32:04,700 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 12:32:04,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 12:32:04,865 INFO L208 MainTranslator]: Completed translation [2020-09-21 12:32:04,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:32:04 WrapperNode [2020-09-21 12:32:04,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 12:32:04,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 12:32:04,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 12:32:04,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 12:32:04,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:32:04" (1/1) ... [2020-09-21 12:32:04,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:32:04" (1/1) ... [2020-09-21 12:32:04,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:32:04" (1/1) ... [2020-09-21 12:32:04,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:32:04" (1/1) ... [2020-09-21 12:32:04,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:32:04" (1/1) ... [2020-09-21 12:32:04,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:32:04" (1/1) ... [2020-09-21 12:32:04,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:32:04" (1/1) ... [2020-09-21 12:32:04,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 12:32:04,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 12:32:04,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 12:32:04,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 12:32:04,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:32:04" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 12:32:05,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 12:32:05,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 12:32:05,087 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-21 12:32:05,087 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 12:32:05,087 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-21 12:32:05,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 12:32:05,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-21 12:32:05,088 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-21 12:32:05,088 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 12:32:05,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 12:32:05,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 12:32:06,483 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 12:32:06,484 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-21 12:32:06,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 12:32:06 BoogieIcfgContainer [2020-09-21 12:32:06,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 12:32:06,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 12:32:06,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 12:32:06,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 12:32:06,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 12:32:03" (1/3) ... [2020-09-21 12:32:06,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dc07a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 12:32:06, skipping insertion in model container [2020-09-21 12:32:06,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:32:04" (2/3) ... [2020-09-21 12:32:06,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dc07a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 12:32:06, skipping insertion in model container [2020-09-21 12:32:06,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 12:32:06" (3/3) ... [2020-09-21 12:32:06,502 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label55.c [2020-09-21 12:32:06,516 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 12:32:06,528 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 12:32:06,556 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 12:32:06,595 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 12:32:06,595 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 12:32:06,595 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 12:32:06,595 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 12:32:06,595 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 12:32:06,596 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 12:32:06,596 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 12:32:06,596 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 12:32:06,629 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-09-21 12:32:06,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-21 12:32:06,639 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:32:06,641 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 12:32:06,641 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:32:06,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:32:06,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1305395761, now seen corresponding path program 1 times [2020-09-21 12:32:06,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:32:06,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [542750188] [2020-09-21 12:32:06,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:32:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:06,883 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:07,275 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:07,275 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 33 [2020-09-21 12:32:07,276 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:07,276 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 433 [2020-09-21 12:32:07,278 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:07,278 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-21 12:32:07,279 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 6 [2020-09-21 12:32:07,279 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 26 [2020-09-21 12:32:07,279 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 3 [2020-09-21 12:32:07,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:32:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:07,427 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:07,433 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:07,433 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:32:07,433 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:07,433 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-09-21 12:32:07,434 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:07,434 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:32:07,434 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:07,434 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-09-21 12:32:07,435 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:32:07,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 12:32:07,449 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [542750188] [2020-09-21 12:32:07,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 12:32:07,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 12:32:07,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466993777] [2020-09-21 12:32:07,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-21 12:32:07,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:32:07,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-21 12:32:07,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 12:32:07,483 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 4 states. [2020-09-21 12:32:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:32:09,128 INFO L93 Difference]: Finished difference Result 581 states and 1006 transitions. [2020-09-21 12:32:09,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 12:32:09,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-09-21 12:32:09,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:32:09,168 INFO L225 Difference]: With dead ends: 581 [2020-09-21 12:32:09,168 INFO L226 Difference]: Without dead ends: 302 [2020-09-21 12:32:09,177 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-21 12:32:09,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-09-21 12:32:09,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2020-09-21 12:32:09,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2020-09-21 12:32:09,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 395 transitions. [2020-09-21 12:32:09,267 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 395 transitions. Word has length 24 [2020-09-21 12:32:09,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:32:09,268 INFO L479 AbstractCegarLoop]: Abstraction has 298 states and 395 transitions. [2020-09-21 12:32:09,268 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-21 12:32:09,269 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 395 transitions. [2020-09-21 12:32:09,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-09-21 12:32:09,273 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:32:09,274 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 12:32:09,274 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 12:32:09,274 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:32:09,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:32:09,275 INFO L82 PathProgramCache]: Analyzing trace with hash -2120148430, now seen corresponding path program 1 times [2020-09-21 12:32:09,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:32:09,276 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1202419970] [2020-09-21 12:32:09,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:32:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:09,390 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:09,479 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:10,182 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:10,182 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 105 [2020-09-21 12:32:10,183 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-21 12:32:10,183 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 828 [2020-09-21 12:32:10,184 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:10,184 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:32:10,185 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 81 [2020-09-21 12:32:10,185 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 23 [2020-09-21 12:32:10,185 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:32:10,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:32:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:10,254 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:10,259 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:10,260 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:32:10,260 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:10,260 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 7 [2020-09-21 12:32:10,261 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:10,261 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:32:10,261 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:10,261 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:32:10,262 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:32:10,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:32:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:10,314 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:10,371 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:10,372 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 72 [2020-09-21 12:32:10,372 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:10,372 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 71 [2020-09-21 12:32:10,373 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:10,373 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:32:10,373 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:10,373 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-09-21 12:32:10,374 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:32:10,421 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 12:32:10,421 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1202419970] [2020-09-21 12:32:10,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:32:10,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-21 12:32:10,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456182212] [2020-09-21 12:32:10,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 12:32:10,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:32:10,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 12:32:10,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-21 12:32:10,426 INFO L87 Difference]: Start difference. First operand 298 states and 395 transitions. Second operand 5 states. [2020-09-21 12:32:11,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:32:11,852 INFO L93 Difference]: Finished difference Result 739 states and 1019 transitions. [2020-09-21 12:32:11,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 12:32:11,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2020-09-21 12:32:11,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:32:11,864 INFO L225 Difference]: With dead ends: 739 [2020-09-21 12:32:11,864 INFO L226 Difference]: Without dead ends: 447 [2020-09-21 12:32:11,866 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-21 12:32:11,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2020-09-21 12:32:11,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 443. [2020-09-21 12:32:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2020-09-21 12:32:11,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 553 transitions. [2020-09-21 12:32:11,897 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 553 transitions. Word has length 94 [2020-09-21 12:32:11,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:32:11,897 INFO L479 AbstractCegarLoop]: Abstraction has 443 states and 553 transitions. [2020-09-21 12:32:11,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 12:32:11,898 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 553 transitions. [2020-09-21 12:32:11,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-09-21 12:32:11,900 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:32:11,900 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 12:32:11,901 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 12:32:11,901 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:32:11,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:32:11,901 INFO L82 PathProgramCache]: Analyzing trace with hash -892420335, now seen corresponding path program 1 times [2020-09-21 12:32:11,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:32:11,902 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [313631549] [2020-09-21 12:32:11,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:32:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:11,964 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:12,039 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:12,577 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:12,942 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:12,942 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 112 [2020-09-21 12:32:12,943 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-21 12:32:12,943 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1006 [2020-09-21 12:32:12,943 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:12,943 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:32:12,943 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 88 [2020-09-21 12:32:12,944 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 23 [2020-09-21 12:32:12,944 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:13,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:32:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:13,017 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:13,022 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:13,023 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:32:13,023 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:13,023 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-09-21 12:32:13,023 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:13,024 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:32:13,024 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:13,024 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:32:13,024 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:13,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:32:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:13,070 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:13,178 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:13,178 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 79 [2020-09-21 12:32:13,179 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:13,179 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 123 [2020-09-21 12:32:13,179 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:13,179 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:32:13,180 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:13,180 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 72 [2020-09-21 12:32:13,180 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:13,232 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 12:32:13,233 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [313631549] [2020-09-21 12:32:13,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:32:13,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-21 12:32:13,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429564082] [2020-09-21 12:32:13,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-21 12:32:13,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:32:13,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-21 12:32:13,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-21 12:32:13,235 INFO L87 Difference]: Start difference. First operand 443 states and 553 transitions. Second operand 6 states. [2020-09-21 12:32:15,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:32:15,051 INFO L93 Difference]: Finished difference Result 1319 states and 1693 transitions. [2020-09-21 12:32:15,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 12:32:15,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2020-09-21 12:32:15,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:32:15,060 INFO L225 Difference]: With dead ends: 1319 [2020-09-21 12:32:15,061 INFO L226 Difference]: Without dead ends: 1317 [2020-09-21 12:32:15,062 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-09-21 12:32:15,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2020-09-21 12:32:15,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 739. [2020-09-21 12:32:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2020-09-21 12:32:15,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1020 transitions. [2020-09-21 12:32:15,136 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1020 transitions. Word has length 101 [2020-09-21 12:32:15,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:32:15,136 INFO L479 AbstractCegarLoop]: Abstraction has 739 states and 1020 transitions. [2020-09-21 12:32:15,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-21 12:32:15,137 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1020 transitions. [2020-09-21 12:32:15,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-09-21 12:32:15,142 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:32:15,144 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 12:32:15,144 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 12:32:15,144 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:32:15,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:32:15,145 INFO L82 PathProgramCache]: Analyzing trace with hash -689374291, now seen corresponding path program 1 times [2020-09-21 12:32:15,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:32:15,145 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [11090218] [2020-09-21 12:32:15,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:32:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:15,220 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:15,557 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:15,557 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 114 [2020-09-21 12:32:15,558 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:15,562 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 366 [2020-09-21 12:32:15,563 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:15,563 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:32:15,563 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 90 [2020-09-21 12:32:15,563 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 23 [2020-09-21 12:32:15,563 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:15,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:32:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:15,640 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:15,644 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:15,645 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:32:15,645 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:15,645 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-09-21 12:32:15,645 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:15,653 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:32:15,653 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:15,654 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:32:15,654 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 8 [2020-09-21 12:32:15,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:32:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:15,719 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:15,779 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:15,779 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 81 [2020-09-21 12:32:15,779 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:15,780 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 76 [2020-09-21 12:32:15,780 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:15,780 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:32:15,780 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:15,781 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-09-21 12:32:15,781 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 12:32:15,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [11090218] [2020-09-21 12:32:15,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:32:15,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-21 12:32:15,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615338149] [2020-09-21 12:32:15,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 12:32:15,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:32:15,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 12:32:15,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-21 12:32:15,842 INFO L87 Difference]: Start difference. First operand 739 states and 1020 transitions. Second operand 5 states. [2020-09-21 12:32:17,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:32:17,052 INFO L93 Difference]: Finished difference Result 1911 states and 2776 transitions. [2020-09-21 12:32:17,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 12:32:17,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2020-09-21 12:32:17,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:32:17,063 INFO L225 Difference]: With dead ends: 1911 [2020-09-21 12:32:17,064 INFO L226 Difference]: Without dead ends: 1178 [2020-09-21 12:32:17,066 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-21 12:32:17,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-09-21 12:32:17,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1029. [2020-09-21 12:32:17,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2020-09-21 12:32:17,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1428 transitions. [2020-09-21 12:32:17,129 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1428 transitions. Word has length 103 [2020-09-21 12:32:17,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:32:17,131 INFO L479 AbstractCegarLoop]: Abstraction has 1029 states and 1428 transitions. [2020-09-21 12:32:17,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 12:32:17,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1428 transitions. [2020-09-21 12:32:17,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-09-21 12:32:17,143 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:32:17,144 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 12:32:17,144 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 12:32:17,144 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:32:17,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:32:17,145 INFO L82 PathProgramCache]: Analyzing trace with hash 328846220, now seen corresponding path program 1 times [2020-09-21 12:32:17,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:32:17,145 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1970468290] [2020-09-21 12:32:17,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:32:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:17,234 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:17,361 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:18,218 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:18,219 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 204 [2020-09-21 12:32:18,219 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-21 12:32:18,221 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1019 [2020-09-21 12:32:18,221 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:18,221 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:32:18,221 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 88 [2020-09-21 12:32:18,222 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-09-21 12:32:18,222 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:18,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:32:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:18,303 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:18,308 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:18,309 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:32:18,309 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:18,309 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 7 [2020-09-21 12:32:18,310 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:18,310 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:32:18,310 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:18,311 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:32:18,311 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:32:18,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:32:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:18,362 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:18,445 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:18,445 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 79 [2020-09-21 12:32:18,445 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:18,445 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 97 [2020-09-21 12:32:18,446 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:18,446 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:32:18,446 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:18,446 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 72 [2020-09-21 12:32:18,446 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:18,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-09-21 12:32:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:18,513 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:18,645 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:18,645 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 92 [2020-09-21 12:32:18,645 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:18,645 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 150 [2020-09-21 12:32:18,646 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:18,646 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:32:18,646 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 12:32:18,646 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-09-21 12:32:18,647 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:18,755 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-21 12:32:18,756 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1970468290] [2020-09-21 12:32:18,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:32:18,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 12:32:18,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576785565] [2020-09-21 12:32:18,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 12:32:18,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:32:18,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 12:32:18,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 12:32:18,759 INFO L87 Difference]: Start difference. First operand 1029 states and 1428 transitions. Second operand 7 states. [2020-09-21 12:32:20,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:32:20,536 INFO L93 Difference]: Finished difference Result 2374 states and 3410 transitions. [2020-09-21 12:32:20,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-21 12:32:20,539 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 191 [2020-09-21 12:32:20,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:32:20,553 INFO L225 Difference]: With dead ends: 2374 [2020-09-21 12:32:20,553 INFO L226 Difference]: Without dead ends: 1351 [2020-09-21 12:32:20,557 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-09-21 12:32:20,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-09-21 12:32:20,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1049. [2020-09-21 12:32:20,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1049 states. [2020-09-21 12:32:20,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1398 transitions. [2020-09-21 12:32:20,610 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1398 transitions. Word has length 191 [2020-09-21 12:32:20,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:32:20,610 INFO L479 AbstractCegarLoop]: Abstraction has 1049 states and 1398 transitions. [2020-09-21 12:32:20,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 12:32:20,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1398 transitions. [2020-09-21 12:32:20,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-09-21 12:32:20,619 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:32:20,619 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 12:32:20,620 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 12:32:20,620 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:32:20,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:32:20,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1133923432, now seen corresponding path program 1 times [2020-09-21 12:32:20,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:32:20,621 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [213217462] [2020-09-21 12:32:20,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:32:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:20,707 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:20,917 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:21,666 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:21,666 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 214 [2020-09-21 12:32:21,666 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-21 12:32:21,667 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1001 [2020-09-21 12:32:21,667 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:21,667 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:32:21,667 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 98 [2020-09-21 12:32:21,668 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-09-21 12:32:21,668 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:21,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:32:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:21,744 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:21,748 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:21,749 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:32:21,749 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:21,749 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-09-21 12:32:21,749 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:21,750 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:32:21,750 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:21,750 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:32:21,750 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:21,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:32:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:21,806 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:21,909 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:21,909 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 89 [2020-09-21 12:32:21,909 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:21,909 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 123 [2020-09-21 12:32:21,910 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:21,910 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:32:21,910 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:21,910 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 82 [2020-09-21 12:32:21,910 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:21,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-09-21 12:32:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:21,983 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:22,118 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:22,119 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 92 [2020-09-21 12:32:22,119 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:22,119 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 154 [2020-09-21 12:32:22,119 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:22,120 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:32:22,120 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 12:32:22,120 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-09-21 12:32:22,120 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:22,222 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 118 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-21 12:32:22,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [213217462] [2020-09-21 12:32:22,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:32:22,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 12:32:22,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803416153] [2020-09-21 12:32:22,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 12:32:22,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:32:22,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 12:32:22,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 12:32:22,225 INFO L87 Difference]: Start difference. First operand 1049 states and 1398 transitions. Second operand 7 states. [2020-09-21 12:32:24,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:32:24,208 INFO L93 Difference]: Finished difference Result 2847 states and 3849 transitions. [2020-09-21 12:32:24,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 12:32:24,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 201 [2020-09-21 12:32:24,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:32:24,218 INFO L225 Difference]: With dead ends: 2847 [2020-09-21 12:32:24,219 INFO L226 Difference]: Without dead ends: 1804 [2020-09-21 12:32:24,222 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-09-21 12:32:24,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2020-09-21 12:32:24,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1494. [2020-09-21 12:32:24,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1494 states. [2020-09-21 12:32:24,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1946 transitions. [2020-09-21 12:32:24,270 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1946 transitions. Word has length 201 [2020-09-21 12:32:24,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:32:24,271 INFO L479 AbstractCegarLoop]: Abstraction has 1494 states and 1946 transitions. [2020-09-21 12:32:24,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 12:32:24,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1946 transitions. [2020-09-21 12:32:24,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-09-21 12:32:24,275 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:32:24,276 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 12:32:24,276 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 12:32:24,276 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:32:24,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:32:24,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1813673464, now seen corresponding path program 1 times [2020-09-21 12:32:24,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:32:24,277 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [958705910] [2020-09-21 12:32:24,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:32:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:24,347 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:24,735 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:24,850 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:25,350 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:25,350 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 222 [2020-09-21 12:32:25,350 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-21 12:32:25,351 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1034 [2020-09-21 12:32:25,351 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:25,351 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:32:25,351 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 198 [2020-09-21 12:32:25,351 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 23 [2020-09-21 12:32:25,352 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:25,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:32:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:25,434 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:25,438 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:25,438 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:32:25,439 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:25,439 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-09-21 12:32:25,439 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:25,439 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:32:25,440 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:25,440 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:32:25,440 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:25,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:32:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:25,466 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:25,495 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:25,495 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 97 [2020-09-21 12:32:25,495 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:25,495 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 33 [2020-09-21 12:32:25,496 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:25,497 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:32:25,497 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:25,497 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:32:25,497 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:32:25,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2020-09-21 12:32:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:25,581 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:25,645 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:25,645 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 92 [2020-09-21 12:32:25,646 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:25,646 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 86 [2020-09-21 12:32:25,646 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:25,646 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:32:25,646 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:25,647 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 85 [2020-09-21 12:32:25,647 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2020-09-21 12:32:25,719 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [958705910] [2020-09-21 12:32:25,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:32:25,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-21 12:32:25,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268017337] [2020-09-21 12:32:25,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 12:32:25,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:32:25,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 12:32:25,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-21 12:32:25,722 INFO L87 Difference]: Start difference. First operand 1494 states and 1946 transitions. Second operand 5 states. [2020-09-21 12:32:27,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:32:27,144 INFO L93 Difference]: Finished difference Result 4005 states and 5392 transitions. [2020-09-21 12:32:27,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 12:32:27,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2020-09-21 12:32:27,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:32:27,161 INFO L225 Difference]: With dead ends: 4005 [2020-09-21 12:32:27,162 INFO L226 Difference]: Without dead ends: 2517 [2020-09-21 12:32:27,167 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-21 12:32:27,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2517 states. [2020-09-21 12:32:27,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2517 to 2364. [2020-09-21 12:32:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2364 states. [2020-09-21 12:32:27,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 2987 transitions. [2020-09-21 12:32:27,234 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 2987 transitions. Word has length 209 [2020-09-21 12:32:27,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:32:27,235 INFO L479 AbstractCegarLoop]: Abstraction has 2364 states and 2987 transitions. [2020-09-21 12:32:27,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 12:32:27,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 2987 transitions. [2020-09-21 12:32:27,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2020-09-21 12:32:27,242 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:32:27,242 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 12:32:27,243 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 12:32:27,243 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:32:27,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:32:27,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1066694831, now seen corresponding path program 1 times [2020-09-21 12:32:27,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:32:27,244 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [769563970] [2020-09-21 12:32:27,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:32:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:27,388 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:27,730 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:28,046 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:28,386 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:28,386 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 243 [2020-09-21 12:32:28,386 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-21 12:32:28,387 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1059 [2020-09-21 12:32:28,387 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:28,387 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:32:28,387 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 219 [2020-09-21 12:32:28,388 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 11 [2020-09-21 12:32:28,388 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:28,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:32:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:28,495 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:28,500 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:28,501 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:32:28,501 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:28,501 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-09-21 12:32:28,501 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:28,503 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:32:28,503 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:28,503 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:32:28,504 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-09-21 12:32:28,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:32:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:28,529 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:28,547 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:28,547 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 81 [2020-09-21 12:32:28,548 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:28,548 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 22 [2020-09-21 12:32:28,548 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:28,548 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:32:28,548 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:28,549 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:32:28,549 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:28,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-21 12:32:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:28,622 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:28,723 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:28,723 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 129 [2020-09-21 12:32:28,724 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:28,724 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 126 [2020-09-21 12:32:28,724 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:28,724 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:32:28,724 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:28,725 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 122 [2020-09-21 12:32:28,725 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:28,825 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2020-09-21 12:32:28,826 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [769563970] [2020-09-21 12:32:28,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:32:28,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-21 12:32:28,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052919634] [2020-09-21 12:32:28,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 12:32:28,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:32:28,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 12:32:28,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-21 12:32:28,827 INFO L87 Difference]: Start difference. First operand 2364 states and 2987 transitions. Second operand 5 states. [2020-09-21 12:32:29,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:32:29,963 INFO L93 Difference]: Finished difference Result 4738 states and 6046 transitions. [2020-09-21 12:32:29,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 12:32:29,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2020-09-21 12:32:29,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:32:29,975 INFO L225 Difference]: With dead ends: 4738 [2020-09-21 12:32:29,975 INFO L226 Difference]: Without dead ends: 2372 [2020-09-21 12:32:29,981 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-21 12:32:29,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2020-09-21 12:32:30,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 2364. [2020-09-21 12:32:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2364 states. [2020-09-21 12:32:30,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 2980 transitions. [2020-09-21 12:32:30,043 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 2980 transitions. Word has length 230 [2020-09-21 12:32:30,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:32:30,044 INFO L479 AbstractCegarLoop]: Abstraction has 2364 states and 2980 transitions. [2020-09-21 12:32:30,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 12:32:30,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 2980 transitions. [2020-09-21 12:32:30,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2020-09-21 12:32:30,052 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:32:30,052 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 12:32:30,053 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-21 12:32:30,053 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:32:30,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:32:30,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1643123341, now seen corresponding path program 1 times [2020-09-21 12:32:30,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:32:30,054 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1056231490] [2020-09-21 12:32:30,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:32:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:30,137 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:30,501 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:31,042 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:31,043 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 257 [2020-09-21 12:32:31,043 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-21 12:32:31,043 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 947 [2020-09-21 12:32:31,043 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:31,044 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:32:31,044 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 90 [2020-09-21 12:32:31,044 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 144 [2020-09-21 12:32:31,044 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:31,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:32:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:31,121 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:31,125 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:31,126 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:32:31,126 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:31,126 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-09-21 12:32:31,126 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:31,127 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:32:31,127 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:31,127 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:32:31,127 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:31,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:32:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:31,166 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:31,212 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:31,212 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 81 [2020-09-21 12:32:31,212 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:31,213 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 58 [2020-09-21 12:32:31,213 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:31,213 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:32:31,213 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:31,213 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-09-21 12:32:31,214 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:31,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-21 12:32:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:31,299 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:31,612 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:31,612 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 143 [2020-09-21 12:32:31,612 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:31,612 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 341 [2020-09-21 12:32:31,613 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:31,613 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:32:31,613 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 12:32:31,614 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 142 [2020-09-21 12:32:31,614 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:32:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-21 12:32:31,860 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1056231490] [2020-09-21 12:32:31,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:32:31,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 12:32:31,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285168080] [2020-09-21 12:32:31,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 12:32:31,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:32:31,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 12:32:31,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 12:32:31,863 INFO L87 Difference]: Start difference. First operand 2364 states and 2980 transitions. Second operand 7 states. [2020-09-21 12:32:34,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:32:34,494 INFO L93 Difference]: Finished difference Result 7549 states and 9774 transitions. [2020-09-21 12:32:34,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 12:32:34,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 244 [2020-09-21 12:32:34,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:32:34,516 INFO L225 Difference]: With dead ends: 7549 [2020-09-21 12:32:34,517 INFO L226 Difference]: Without dead ends: 4295 [2020-09-21 12:32:34,528 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-09-21 12:32:34,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4295 states. [2020-09-21 12:32:34,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4295 to 4140. [2020-09-21 12:32:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2020-09-21 12:32:34,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 5061 transitions. [2020-09-21 12:32:34,707 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 5061 transitions. Word has length 244 [2020-09-21 12:32:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:32:34,708 INFO L479 AbstractCegarLoop]: Abstraction has 4140 states and 5061 transitions. [2020-09-21 12:32:34,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 12:32:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 5061 transitions. [2020-09-21 12:32:34,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2020-09-21 12:32:34,719 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:32:34,720 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-21 12:32:34,720 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-21 12:32:34,720 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:32:34,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:32:34,720 INFO L82 PathProgramCache]: Analyzing trace with hash -288992109, now seen corresponding path program 1 times [2020-09-21 12:32:34,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:32:34,721 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1948666623] [2020-09-21 12:32:34,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:32:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:34,793 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:34,906 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:35,791 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:35,791 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 273 [2020-09-21 12:32:35,791 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-21 12:32:35,791 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1028 [2020-09-21 12:32:35,792 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:35,792 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-21 12:32:35,792 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 6 [2020-09-21 12:32:35,792 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 101 [2020-09-21 12:32:35,792 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:35,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:32:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:35,853 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:35,859 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:35,859 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:32:35,860 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:35,860 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 7 [2020-09-21 12:32:35,860 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:35,860 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:32:35,860 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:35,861 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-09-21 12:32:35,861 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:35,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:32:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:35,912 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:36,049 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:36,049 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 97 [2020-09-21 12:32:36,049 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:36,050 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 154 [2020-09-21 12:32:36,050 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:36,050 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:32:36,050 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 12:32:36,050 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 96 [2020-09-21 12:32:36,051 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:36,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2020-09-21 12:32:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:36,166 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:36,228 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:36,228 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 143 [2020-09-21 12:32:36,229 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:36,229 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 87 [2020-09-21 12:32:36,229 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:36,229 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:32:36,229 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 140 [2020-09-21 12:32:36,229 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:32:36,230 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:36,344 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 34 proven. 90 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-21 12:32:36,344 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1948666623] [2020-09-21 12:32:36,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:32:36,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 12:32:36,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004373852] [2020-09-21 12:32:36,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 12:32:36,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:32:36,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 12:32:36,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 12:32:36,346 INFO L87 Difference]: Start difference. First operand 4140 states and 5061 transitions. Second operand 7 states. [2020-09-21 12:32:37,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:32:37,927 INFO L93 Difference]: Finished difference Result 8014 states and 9779 transitions. [2020-09-21 12:32:37,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 12:32:37,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 260 [2020-09-21 12:32:37,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:32:37,944 INFO L225 Difference]: With dead ends: 8014 [2020-09-21 12:32:37,945 INFO L226 Difference]: Without dead ends: 3880 [2020-09-21 12:32:37,956 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-09-21 12:32:37,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3880 states. [2020-09-21 12:32:38,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3880 to 2805. [2020-09-21 12:32:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2805 states. [2020-09-21 12:32:38,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 3213 transitions. [2020-09-21 12:32:38,055 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 3213 transitions. Word has length 260 [2020-09-21 12:32:38,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:32:38,056 INFO L479 AbstractCegarLoop]: Abstraction has 2805 states and 3213 transitions. [2020-09-21 12:32:38,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 12:32:38,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 3213 transitions. [2020-09-21 12:32:38,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2020-09-21 12:32:38,065 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:32:38,065 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-21 12:32:38,065 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-21 12:32:38,066 INFO L427 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:32:38,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:32:38,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1432198242, now seen corresponding path program 1 times [2020-09-21 12:32:38,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:32:38,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1333936607] [2020-09-21 12:32:38,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:32:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:38,149 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:38,377 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:39,114 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:39,114 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 274 [2020-09-21 12:32:39,114 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-21 12:32:39,114 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1000 [2020-09-21 12:32:39,115 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:39,115 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:32:39,115 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 107 [2020-09-21 12:32:39,115 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 144 [2020-09-21 12:32:39,115 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:39,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:32:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:39,189 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:39,193 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:39,193 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:32:39,193 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:39,193 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-09-21 12:32:39,194 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:39,194 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:32:39,194 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:39,194 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:32:39,195 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:39,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:32:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:39,241 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:39,305 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:39,306 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 98 [2020-09-21 12:32:39,306 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:39,306 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 80 [2020-09-21 12:32:39,306 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:39,306 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:32:39,307 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:39,307 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-09-21 12:32:39,307 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:39,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-09-21 12:32:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:39,404 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:39,676 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:39,677 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 143 [2020-09-21 12:32:39,677 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:39,677 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 300 [2020-09-21 12:32:39,677 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:39,678 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:32:39,678 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 12:32:39,678 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 142 [2020-09-21 12:32:39,678 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:39,809 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 127 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-21 12:32:39,809 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1333936607] [2020-09-21 12:32:39,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:32:39,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 12:32:39,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454087917] [2020-09-21 12:32:39,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 12:32:39,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:32:39,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 12:32:39,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 12:32:39,811 INFO L87 Difference]: Start difference. First operand 2805 states and 3213 transitions. Second operand 7 states. [2020-09-21 12:32:41,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:32:41,582 INFO L93 Difference]: Finished difference Result 5628 states and 6464 transitions. [2020-09-21 12:32:41,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-21 12:32:41,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 261 [2020-09-21 12:32:41,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:32:41,594 INFO L225 Difference]: With dead ends: 5628 [2020-09-21 12:32:41,595 INFO L226 Difference]: Without dead ends: 2829 [2020-09-21 12:32:41,601 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-09-21 12:32:41,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2020-09-21 12:32:41,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2666. [2020-09-21 12:32:41,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2666 states. [2020-09-21 12:32:41,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2666 states and 2970 transitions. [2020-09-21 12:32:41,670 INFO L78 Accepts]: Start accepts. Automaton has 2666 states and 2970 transitions. Word has length 261 [2020-09-21 12:32:41,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:32:41,671 INFO L479 AbstractCegarLoop]: Abstraction has 2666 states and 2970 transitions. [2020-09-21 12:32:41,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 12:32:41,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 2970 transitions. [2020-09-21 12:32:41,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2020-09-21 12:32:41,680 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:32:41,680 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 12:32:41,680 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-21 12:32:41,681 INFO L427 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:32:41,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:32:41,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1637300869, now seen corresponding path program 1 times [2020-09-21 12:32:41,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:32:41,682 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1303853964] [2020-09-21 12:32:41,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:32:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-21 12:32:41,769 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-21 12:32:41,769 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-21 12:32:41,777 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-21 12:32:41,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 12:32:41 BoogieIcfgContainer [2020-09-21 12:32:41,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 12:32:41,847 INFO L168 Benchmark]: Toolchain (without parser) took 37878.76 ms. Allocated memory was 140.0 MB in the beginning and 657.5 MB in the end (delta: 517.5 MB). Free memory was 101.9 MB in the beginning and 195.1 MB in the end (delta: -93.2 MB). Peak memory consumption was 424.2 MB. Max. memory is 7.1 GB. [2020-09-21 12:32:41,848 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-21 12:32:41,849 INFO L168 Benchmark]: CACSL2BoogieTranslator took 891.03 ms. Allocated memory was 140.0 MB in the beginning and 205.0 MB in the end (delta: 65.0 MB). Free memory was 101.2 MB in the beginning and 171.2 MB in the end (delta: -69.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. [2020-09-21 12:32:41,850 INFO L168 Benchmark]: Boogie Preprocessor took 119.87 ms. Allocated memory is still 205.0 MB. Free memory was 171.2 MB in the beginning and 166.3 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2020-09-21 12:32:41,851 INFO L168 Benchmark]: RCFGBuilder took 1504.29 ms. Allocated memory was 205.0 MB in the beginning and 239.1 MB in the end (delta: 34.1 MB). Free memory was 166.3 MB in the beginning and 182.8 MB in the end (delta: -16.5 MB). Peak memory consumption was 81.9 MB. Max. memory is 7.1 GB. [2020-09-21 12:32:41,852 INFO L168 Benchmark]: TraceAbstraction took 35350.97 ms. Allocated memory was 239.1 MB in the beginning and 657.5 MB in the end (delta: 418.4 MB). Free memory was 182.8 MB in the beginning and 195.1 MB in the end (delta: -12.3 MB). Peak memory consumption was 406.1 MB. Max. memory is 7.1 GB. [2020-09-21 12:32:41,855 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.22 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 891.03 ms. Allocated memory was 140.0 MB in the beginning and 205.0 MB in the end (delta: 65.0 MB). Free memory was 101.2 MB in the beginning and 171.2 MB in the end (delta: -69.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 119.87 ms. Allocated memory is still 205.0 MB. Free memory was 171.2 MB in the beginning and 166.3 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1504.29 ms. Allocated memory was 205.0 MB in the beginning and 239.1 MB in the end (delta: 34.1 MB). Free memory was 166.3 MB in the beginning and 182.8 MB in the end (delta: -16.5 MB). Peak memory consumption was 81.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35350.97 ms. Allocated memory was 239.1 MB in the beginning and 657.5 MB in the end (delta: 418.4 MB). Free memory was 182.8 MB in the beginning and 195.1 MB in the end (delta: -12.3 MB). Peak memory consumption was 406.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 58]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] return 25; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) [L517] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) [L526] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) [L529] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) [L534] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) [L540] COND FALSE !(((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0)))) [L545] COND FALSE !(((a4==14) && (((a12==0) && ((a19==9) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a10==4)))) [L548] COND FALSE !(((((( ((38 < a1) && (218 >= a1)) && (input == 3)) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10))) [L554] COND FALSE !((((a4==14) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 4)) && (a12==0)) && (a19==9))) && (a10==2))) [L557] COND TRUE ((a12==0) && ((( 218 < a1 && ((a19==9) && (input == 5))) && (a10==1)) && (a4==14))) [L558] a1 = ((((a1 * 9)/ 10) + 58620) - 603783) [L559] a10 = 4 [L560] a19 = 8 [L562] return -1; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND TRUE (((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)) [L58] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 35.1s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 313 SDtfs, 4474 SDslu, 366 SDs, 0 SdLazy, 9781 SolverSat, 1407 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4140occurred 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: 0.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 2901 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 2198 NumberOfCodeBlocks, 2198 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1907 ConstructedInterpolants, 0 QuantifiedInterpolants, 805924 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 787/892 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...