/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 --rcfgbuilder.size.of.a.code.block SequenceOfStatements --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=5000 --traceabstraction.additional.smt.options interpolation-heuristic=NARROWEST --traceabstraction.additional.smt.options log-additional-information=true --traceabstraction.additional.smt.options unknown-allowed=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label28.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-adbd35c [2020-10-13 08:03:25,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-13 08:03:25,993 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-13 08:03:26,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-13 08:03:26,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-13 08:03:26,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-13 08:03:26,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-13 08:03:26,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-13 08:03:26,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-13 08:03:26,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-13 08:03:26,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-13 08:03:26,062 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-13 08:03:26,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-13 08:03:26,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-13 08:03:26,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-13 08:03:26,071 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-13 08:03:26,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-13 08:03:26,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-13 08:03:26,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-13 08:03:26,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-13 08:03:26,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-13 08:03:26,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-13 08:03:26,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-13 08:03:26,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-13 08:03:26,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-13 08:03:26,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-13 08:03:26,104 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-13 08:03:26,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-13 08:03:26,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-13 08:03:26,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-13 08:03:26,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-13 08:03:26,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-13 08:03:26,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-13 08:03:26,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-13 08:03:26,114 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-13 08:03:26,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-13 08:03:26,115 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-13 08:03:26,115 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-13 08:03:26,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-13 08:03:26,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-13 08:03:26,120 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-13 08:03:26,121 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-10-13 08:03:26,160 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-13 08:03:26,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-13 08:03:26,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-13 08:03:26,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-13 08:03:26,163 INFO L138 SettingsManager]: * Use SBE=true [2020-10-13 08:03:26,163 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-13 08:03:26,164 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-13 08:03:26,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-13 08:03:26,164 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-13 08:03:26,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-13 08:03:26,165 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-13 08:03:26,166 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-13 08:03:26,166 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-13 08:03:26,166 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-13 08:03:26,166 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-13 08:03:26,167 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-13 08:03:26,167 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-13 08:03:26,167 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-13 08:03:26,167 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-13 08:03:26,167 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-13 08:03:26,168 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-13 08:03:26,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-13 08:03:26,168 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-13 08:03:26,168 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-13 08:03:26,168 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-13 08:03:26,169 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-13 08:03:26,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-13 08:03:26,169 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-13 08:03:26,169 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-13 08:03:26,169 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.rcfgbuilder: Size of a code block -> SequenceOfStatements 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=5000;interpolation-heuristic=NARROWEST;log-additional-information=true;unknown-allowed=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=5000;interpolation-heuristic=NARROWEST;log-additional-information=true;unknown-allowed=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=5000;interpolation-heuristic=NARROWEST;log-additional-information=true;unknown-allowed=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=5000;interpolation-heuristic=NARROWEST;log-additional-information=true;unknown-allowed=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=5000;interpolation-heuristic=NARROWEST;log-additional-information=true;unknown-allowed=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=5000;interpolation-heuristic=NARROWEST;log-additional-information=true;unknown-allowed=true; [2020-10-13 08:03:26,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-13 08:03:26,470 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-13 08:03:26,475 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-13 08:03:26,477 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-13 08:03:26,477 INFO L275 PluginConnector]: CDTParser initialized [2020-10-13 08:03:26,478 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label28.c [2020-10-13 08:03:26,531 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/abf5ffc78/8c77a088015848a191fe957afe35ae8f/FLAGfb5711039 [2020-10-13 08:03:27,159 INFO L306 CDTParser]: Found 1 translation units. [2020-10-13 08:03:27,160 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label28.c [2020-10-13 08:03:27,187 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/abf5ffc78/8c77a088015848a191fe957afe35ae8f/FLAGfb5711039 [2020-10-13 08:03:27,447 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/abf5ffc78/8c77a088015848a191fe957afe35ae8f [2020-10-13 08:03:27,456 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-13 08:03:27,457 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-13 08:03:27,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-13 08:03:27,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-13 08:03:27,462 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-13 08:03:27,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:03:27" (1/1) ... [2020-10-13 08:03:27,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@535e39d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:03:27, skipping insertion in model container [2020-10-13 08:03:27,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:03:27" (1/1) ... [2020-10-13 08:03:27,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-13 08:03:27,525 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-13 08:03:28,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-13 08:03:28,057 INFO L203 MainTranslator]: Completed pre-run [2020-10-13 08:03:28,185 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-13 08:03:28,201 INFO L208 MainTranslator]: Completed translation [2020-10-13 08:03:28,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:03:28 WrapperNode [2020-10-13 08:03:28,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-13 08:03:28,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-13 08:03:28,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-13 08:03:28,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-13 08:03:28,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:03:28" (1/1) ... [2020-10-13 08:03:28,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:03:28" (1/1) ... [2020-10-13 08:03:28,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:03:28" (1/1) ... [2020-10-13 08:03:28,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:03:28" (1/1) ... [2020-10-13 08:03:28,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:03:28" (1/1) ... [2020-10-13 08:03:28,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:03:28" (1/1) ... [2020-10-13 08:03:28,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:03:28" (1/1) ... [2020-10-13 08:03:28,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-13 08:03:28,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-13 08:03:28,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-13 08:03:28,310 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-13 08:03:28,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:03:28" (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-10-13 08:03:28,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-13 08:03:28,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-13 08:03:28,398 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-13 08:03:28,398 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-13 08:03:28,399 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-13 08:03:28,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-10-13 08:03:28,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-13 08:03:28,399 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-13 08:03:28,399 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-13 08:03:28,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-13 08:03:28,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-13 08:03:29,721 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-13 08:03:29,721 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-13 08:03:29,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:03:29 BoogieIcfgContainer [2020-10-13 08:03:29,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-13 08:03:29,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-13 08:03:29,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-13 08:03:29,738 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-13 08:03:29,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:03:27" (1/3) ... [2020-10-13 08:03:29,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b406495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:03:29, skipping insertion in model container [2020-10-13 08:03:29,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:03:28" (2/3) ... [2020-10-13 08:03:29,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b406495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:03:29, skipping insertion in model container [2020-10-13 08:03:29,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:03:29" (3/3) ... [2020-10-13 08:03:29,744 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label28.c [2020-10-13 08:03:29,755 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-13 08:03:29,766 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-13 08:03:29,781 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-13 08:03:29,809 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-13 08:03:29,810 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-13 08:03:29,810 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-13 08:03:29,810 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-13 08:03:29,810 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-13 08:03:29,810 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-13 08:03:29,810 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-13 08:03:29,811 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-13 08:03:29,832 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-10-13 08:03:29,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-13 08:03:29,839 INFO L414 BasicCegarLoop]: Found error trace [2020-10-13 08:03:29,840 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-13 08:03:29,841 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-13 08:03:29,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-13 08:03:29,847 INFO L82 PathProgramCache]: Analyzing trace with hash 7815070, now seen corresponding path program 1 times [2020-10-13 08:03:29,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-13 08:03:29,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2051087473] [2020-10-13 08:03:29,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-13 08:03:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:30,028 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:30,321 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:30,322 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 25 [2020-10-13 08:03:30,322 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:30,322 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 323 [2020-10-13 08:03:30,324 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:30,325 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-13 08:03:30,325 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-13 08:03:30,326 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 19 [2020-10-13 08:03:30,326 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 3 [2020-10-13 08:03:30,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-13 08:03:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:30,477 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:30,497 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:30,497 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-13 08:03:30,497 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:30,498 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 23 [2020-10-13 08:03:30,499 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:30,499 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-13 08:03:30,499 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:03:30,500 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-13 08:03:30,500 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-13 08:03:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-13 08:03:30,516 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2051087473] [2020-10-13 08:03:30,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-13 08:03:30,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-13 08:03:30,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710605305] [2020-10-13 08:03:30,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-13 08:03:30,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-13 08:03:30,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-13 08:03:30,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-13 08:03:30,545 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 5 states. [2020-10-13 08:03:32,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-13 08:03:32,688 INFO L93 Difference]: Finished difference Result 730 states and 1300 transitions. [2020-10-13 08:03:32,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-13 08:03:32,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-13 08:03:32,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-13 08:03:32,710 INFO L225 Difference]: With dead ends: 730 [2020-10-13 08:03:32,710 INFO L226 Difference]: Without dead ends: 447 [2020-10-13 08:03:32,719 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-13 08:03:32,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2020-10-13 08:03:32,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 443. [2020-10-13 08:03:32,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2020-10-13 08:03:32,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 615 transitions. [2020-10-13 08:03:32,834 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 615 transitions. Word has length 17 [2020-10-13 08:03:32,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-13 08:03:32,835 INFO L479 AbstractCegarLoop]: Abstraction has 443 states and 615 transitions. [2020-10-13 08:03:32,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-13 08:03:32,835 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 615 transitions. [2020-10-13 08:03:32,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-10-13 08:03:32,843 INFO L414 BasicCegarLoop]: Found error trace [2020-10-13 08:03:32,846 INFO L422 BasicCegarLoop]: trace histogram [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-10-13 08:03:32,847 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-13 08:03:32,847 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-13 08:03:32,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-13 08:03:32,847 INFO L82 PathProgramCache]: Analyzing trace with hash 556045594, now seen corresponding path program 1 times [2020-10-13 08:03:32,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-13 08:03:32,848 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2105567878] [2020-10-13 08:03:32,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-13 08:03:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:32,914 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:33,024 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:33,396 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:33,397 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 97 [2020-10-13 08:03:33,397 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-13 08:03:33,397 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 508 [2020-10-13 08:03:33,398 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:33,398 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-13 08:03:33,399 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-13 08:03:33,399 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 16 [2020-10-13 08:03:33,399 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-13 08:03:33,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-13 08:03:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:33,452 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:33,455 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:33,455 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-13 08:03:33,455 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:33,456 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-13 08:03:33,456 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:33,456 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-13 08:03:33,456 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:03:33,457 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-13 08:03:33,457 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:33,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-13 08:03:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:33,491 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:33,536 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:33,537 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-13 08:03:33,537 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:33,537 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 54 [2020-10-13 08:03:33,537 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:33,538 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-13 08:03:33,538 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:03:33,538 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-13 08:03:33,538 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-13 08:03:33,603 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2105567878] [2020-10-13 08:03:33,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-13 08:03:33,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-13 08:03:33,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335624806] [2020-10-13 08:03:33,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-13 08:03:33,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-13 08:03:33,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-13 08:03:33,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-13 08:03:33,613 INFO L87 Difference]: Start difference. First operand 443 states and 615 transitions. Second operand 5 states. [2020-10-13 08:03:34,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-13 08:03:34,726 INFO L93 Difference]: Finished difference Result 1319 states and 1875 transitions. [2020-10-13 08:03:34,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-13 08:03:34,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2020-10-13 08:03:34,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-13 08:03:34,736 INFO L225 Difference]: With dead ends: 1319 [2020-10-13 08:03:34,736 INFO L226 Difference]: Without dead ends: 882 [2020-10-13 08:03:34,738 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-10-13 08:03:34,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2020-10-13 08:03:34,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 878. [2020-10-13 08:03:34,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2020-10-13 08:03:34,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1181 transitions. [2020-10-13 08:03:34,794 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1181 transitions. Word has length 87 [2020-10-13 08:03:34,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-13 08:03:34,795 INFO L479 AbstractCegarLoop]: Abstraction has 878 states and 1181 transitions. [2020-10-13 08:03:34,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-13 08:03:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1181 transitions. [2020-10-13 08:03:34,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-10-13 08:03:34,807 INFO L414 BasicCegarLoop]: Found error trace [2020-10-13 08:03:34,807 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-13 08:03:34,807 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-13 08:03:34,807 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-13 08:03:34,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-13 08:03:34,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1392486162, now seen corresponding path program 1 times [2020-10-13 08:03:34,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-13 08:03:34,808 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1121168710] [2020-10-13 08:03:34,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-13 08:03:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:34,879 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:35,054 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:35,248 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:35,718 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:36,312 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:36,314 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 181 [2020-10-13 08:03:36,314 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-13 08:03:36,315 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1460 [2020-10-13 08:03:36,315 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:36,315 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-13 08:03:36,315 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 164 [2020-10-13 08:03:36,315 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 12 [2020-10-13 08:03:36,316 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:36,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-13 08:03:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:36,485 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:36,487 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:36,487 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-13 08:03:36,487 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:36,487 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-13 08:03:36,487 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:36,488 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-13 08:03:36,488 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:03:36,488 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-13 08:03:36,488 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:36,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-13 08:03:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:36,504 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:36,523 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:36,523 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-13 08:03:36,524 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:36,524 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 19 [2020-10-13 08:03:36,524 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:36,524 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-13 08:03:36,524 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:03:36,525 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-13 08:03:36,525 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:36,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-13 08:03:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:36,573 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:36,623 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:36,623 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-13 08:03:36,623 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:36,624 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 60 [2020-10-13 08:03:36,624 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:36,624 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-13 08:03:36,624 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:03:36,624 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 68 [2020-10-13 08:03:36,625 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:36,690 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-10-13 08:03:36,691 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1121168710] [2020-10-13 08:03:36,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-13 08:03:36,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-13 08:03:36,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034080077] [2020-10-13 08:03:36,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-13 08:03:36,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-13 08:03:36,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-13 08:03:36,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-13 08:03:36,693 INFO L87 Difference]: Start difference. First operand 878 states and 1181 transitions. Second operand 5 states. [2020-10-13 08:03:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-13 08:03:37,587 INFO L93 Difference]: Finished difference Result 1763 states and 2385 transitions. [2020-10-13 08:03:37,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-13 08:03:37,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2020-10-13 08:03:37,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-13 08:03:37,598 INFO L225 Difference]: With dead ends: 1763 [2020-10-13 08:03:37,598 INFO L226 Difference]: Without dead ends: 882 [2020-10-13 08:03:37,600 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-13 08:03:37,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2020-10-13 08:03:37,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 878. [2020-10-13 08:03:37,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2020-10-13 08:03:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1177 transitions. [2020-10-13 08:03:37,632 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1177 transitions. Word has length 169 [2020-10-13 08:03:37,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-13 08:03:37,633 INFO L479 AbstractCegarLoop]: Abstraction has 878 states and 1177 transitions. [2020-10-13 08:03:37,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-13 08:03:37,633 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1177 transitions. [2020-10-13 08:03:37,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-10-13 08:03:37,645 INFO L414 BasicCegarLoop]: Found error trace [2020-10-13 08:03:37,645 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 08:03:37,645 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-13 08:03:37,646 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-13 08:03:37,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-13 08:03:37,646 INFO L82 PathProgramCache]: Analyzing trace with hash 552964622, now seen corresponding path program 1 times [2020-10-13 08:03:37,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-13 08:03:37,647 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [227926630] [2020-10-13 08:03:37,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-13 08:03:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:37,720 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:37,889 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:38,518 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:38,519 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 197 [2020-10-13 08:03:38,519 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-13 08:03:38,519 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 827 [2020-10-13 08:03:38,520 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:38,520 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-13 08:03:38,520 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 180 [2020-10-13 08:03:38,520 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 16 [2020-10-13 08:03:38,520 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:38,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-13 08:03:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:38,586 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:38,589 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:38,589 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-13 08:03:38,589 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:38,589 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-13 08:03:38,589 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:38,590 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-13 08:03:38,590 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:03:38,590 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-13 08:03:38,590 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:38,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-13 08:03:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:38,608 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:38,627 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:38,627 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-13 08:03:38,627 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:38,628 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 19 [2020-10-13 08:03:38,628 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:38,628 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-13 08:03:38,628 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:03:38,628 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-13 08:03:38,629 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:38,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-13 08:03:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:38,683 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:38,750 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:38,750 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 99 [2020-10-13 08:03:38,751 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:38,751 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 81 [2020-10-13 08:03:38,751 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:38,751 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-13 08:03:38,751 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:03:38,752 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-13 08:03:38,752 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2020-10-13 08:03:38,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [227926630] [2020-10-13 08:03:38,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-13 08:03:38,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-13 08:03:38,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041702035] [2020-10-13 08:03:38,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-13 08:03:38,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-13 08:03:38,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-13 08:03:38,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-13 08:03:38,809 INFO L87 Difference]: Start difference. First operand 878 states and 1177 transitions. Second operand 5 states. [2020-10-13 08:03:40,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-13 08:03:40,115 INFO L93 Difference]: Finished difference Result 2624 states and 3586 transitions. [2020-10-13 08:03:40,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-13 08:03:40,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 185 [2020-10-13 08:03:40,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-13 08:03:40,128 INFO L225 Difference]: With dead ends: 2624 [2020-10-13 08:03:40,128 INFO L226 Difference]: Without dead ends: 1752 [2020-10-13 08:03:40,131 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-10-13 08:03:40,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2020-10-13 08:03:40,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1462. [2020-10-13 08:03:40,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1462 states. [2020-10-13 08:03:40,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 1981 transitions. [2020-10-13 08:03:40,196 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 1981 transitions. Word has length 185 [2020-10-13 08:03:40,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-13 08:03:40,196 INFO L479 AbstractCegarLoop]: Abstraction has 1462 states and 1981 transitions. [2020-10-13 08:03:40,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-13 08:03:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1981 transitions. [2020-10-13 08:03:40,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-10-13 08:03:40,203 INFO L414 BasicCegarLoop]: Found error trace [2020-10-13 08:03:40,203 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-13 08:03:40,203 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-13 08:03:40,204 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-13 08:03:40,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-13 08:03:40,204 INFO L82 PathProgramCache]: Analyzing trace with hash 473377697, now seen corresponding path program 1 times [2020-10-13 08:03:40,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-13 08:03:40,205 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [426314894] [2020-10-13 08:03:40,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-13 08:03:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:40,273 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:40,475 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:40,775 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:40,775 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 228 [2020-10-13 08:03:40,775 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-13 08:03:40,775 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 523 [2020-10-13 08:03:40,776 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:40,776 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-13 08:03:40,776 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-13 08:03:40,776 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 26 [2020-10-13 08:03:40,776 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:40,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-13 08:03:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:40,856 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:40,860 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:40,860 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-13 08:03:40,861 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:40,861 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-13 08:03:40,861 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:40,861 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-13 08:03:40,862 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:03:40,862 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-13 08:03:40,862 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:40,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-13 08:03:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:40,894 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:40,938 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:40,938 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-13 08:03:40,939 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:40,939 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 53 [2020-10-13 08:03:40,939 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:40,939 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-13 08:03:40,939 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:03:40,940 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-13 08:03:40,940 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:40,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-13 08:03:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:41,004 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:41,045 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:41,410 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:41,410 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 121 [2020-10-13 08:03:41,410 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-13 08:03:41,411 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 421 [2020-10-13 08:03:41,411 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:41,411 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-13 08:03:41,411 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-13 08:03:41,411 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 121 [2020-10-13 08:03:41,412 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 96 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-13 08:03:41,964 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [426314894] [2020-10-13 08:03:41,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-13 08:03:41,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-13 08:03:41,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632072971] [2020-10-13 08:03:41,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-13 08:03:41,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-13 08:03:41,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-13 08:03:41,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-13 08:03:41,967 INFO L87 Difference]: Start difference. First operand 1462 states and 1981 transitions. Second operand 7 states. [2020-10-13 08:03:43,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-13 08:03:43,319 INFO L93 Difference]: Finished difference Result 2989 states and 4137 transitions. [2020-10-13 08:03:43,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-13 08:03:43,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 216 [2020-10-13 08:03:43,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-13 08:03:43,330 INFO L225 Difference]: With dead ends: 2989 [2020-10-13 08:03:43,330 INFO L226 Difference]: Without dead ends: 1506 [2020-10-13 08:03:43,336 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-13 08:03:43,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2020-10-13 08:03:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1466. [2020-10-13 08:03:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2020-10-13 08:03:43,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 1986 transitions. [2020-10-13 08:03:43,428 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 1986 transitions. Word has length 216 [2020-10-13 08:03:43,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-13 08:03:43,429 INFO L479 AbstractCegarLoop]: Abstraction has 1466 states and 1986 transitions. [2020-10-13 08:03:43,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-13 08:03:43,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1986 transitions. [2020-10-13 08:03:43,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2020-10-13 08:03:43,434 INFO L414 BasicCegarLoop]: Found error trace [2020-10-13 08:03:43,434 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 08:03:43,434 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-13 08:03:43,434 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-13 08:03:43,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-13 08:03:43,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1146561798, now seen corresponding path program 1 times [2020-10-13 08:03:43,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-13 08:03:43,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1451649272] [2020-10-13 08:03:43,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-13 08:03:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:43,512 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:43,735 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:44,192 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:44,192 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 235 [2020-10-13 08:03:44,193 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-13 08:03:44,193 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 710 [2020-10-13 08:03:44,193 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:44,194 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-13 08:03:44,194 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 218 [2020-10-13 08:03:44,194 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 16 [2020-10-13 08:03:44,195 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-13 08:03:44,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-13 08:03:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:44,285 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:44,287 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:44,288 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-13 08:03:44,288 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:44,288 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-13 08:03:44,288 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:44,289 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-13 08:03:44,289 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:03:44,289 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-13 08:03:44,289 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:44,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-13 08:03:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:44,309 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:44,329 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:44,329 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-13 08:03:44,330 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:44,330 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 21 [2020-10-13 08:03:44,330 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:44,331 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-13 08:03:44,331 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:03:44,331 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-13 08:03:44,332 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-13 08:03:44,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-13 08:03:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:44,412 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:44,504 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:44,504 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 137 [2020-10-13 08:03:44,504 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:44,505 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 116 [2020-10-13 08:03:44,505 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:44,505 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-13 08:03:44,505 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:03:44,505 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 131 [2020-10-13 08:03:44,505 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2020-10-13 08:03:44,656 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1451649272] [2020-10-13 08:03:44,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-13 08:03:44,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-13 08:03:44,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815277246] [2020-10-13 08:03:44,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-13 08:03:44,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-13 08:03:44,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-13 08:03:44,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-13 08:03:44,659 INFO L87 Difference]: Start difference. First operand 1466 states and 1986 transitions. Second operand 6 states. [2020-10-13 08:03:46,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-13 08:03:46,189 INFO L93 Difference]: Finished difference Result 2199 states and 3120 transitions. [2020-10-13 08:03:46,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-13 08:03:46,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 223 [2020-10-13 08:03:46,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-13 08:03:46,206 INFO L225 Difference]: With dead ends: 2199 [2020-10-13 08:03:46,206 INFO L226 Difference]: Without dead ends: 2197 [2020-10-13 08:03:46,208 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-13 08:03:46,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2020-10-13 08:03:46,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 1758. [2020-10-13 08:03:46,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1758 states. [2020-10-13 08:03:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 2460 transitions. [2020-10-13 08:03:46,262 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 2460 transitions. Word has length 223 [2020-10-13 08:03:46,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-13 08:03:46,263 INFO L479 AbstractCegarLoop]: Abstraction has 1758 states and 2460 transitions. [2020-10-13 08:03:46,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-13 08:03:46,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 2460 transitions. [2020-10-13 08:03:46,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-10-13 08:03:46,269 INFO L414 BasicCegarLoop]: Found error trace [2020-10-13 08:03:46,269 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-13 08:03:46,270 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-13 08:03:46,270 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-13 08:03:46,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-13 08:03:46,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1151302970, now seen corresponding path program 1 times [2020-10-13 08:03:46,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-13 08:03:46,271 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [4390879] [2020-10-13 08:03:46,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-13 08:03:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:46,347 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:46,523 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:47,390 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:47,422 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:47,423 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 293 [2020-10-13 08:03:47,424 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-13 08:03:47,424 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1105 [2020-10-13 08:03:47,424 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:47,425 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-13 08:03:47,425 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-13 08:03:47,425 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 75 [2020-10-13 08:03:47,425 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:47,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-13 08:03:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:47,473 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:47,475 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:47,476 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-13 08:03:47,476 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:47,476 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-13 08:03:47,476 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:47,476 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-13 08:03:47,476 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:03:47,477 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-13 08:03:47,477 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:47,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-13 08:03:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:47,507 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:47,545 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:47,545 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-13 08:03:47,546 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:47,546 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 46 [2020-10-13 08:03:47,546 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:47,546 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-13 08:03:47,546 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:03:47,547 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-13 08:03:47,547 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:47,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-13 08:03:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:47,582 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:47,663 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:47,664 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 73 [2020-10-13 08:03:47,664 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:47,665 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 88 [2020-10-13 08:03:47,668 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:47,669 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-13 08:03:47,669 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-13 08:03:47,670 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 73 [2020-10-13 08:03:47,670 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 4 [2020-10-13 08:03:47,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2020-10-13 08:03:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:47,779 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:47,850 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:47,851 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 121 [2020-10-13 08:03:47,851 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:47,852 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 94 [2020-10-13 08:03:47,852 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:47,852 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-13 08:03:47,853 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 118 [2020-10-13 08:03:47,853 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-13 08:03:47,853 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-13 08:03:48,082 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 101 proven. 71 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-10-13 08:03:48,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [4390879] [2020-10-13 08:03:48,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-13 08:03:48,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-13 08:03:48,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090718005] [2020-10-13 08:03:48,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-13 08:03:48,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-13 08:03:48,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-13 08:03:48,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-13 08:03:48,088 INFO L87 Difference]: Start difference. First operand 1758 states and 2460 transitions. Second operand 7 states. [2020-10-13 08:03:49,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-13 08:03:49,992 INFO L93 Difference]: Finished difference Result 4267 states and 6198 transitions. [2020-10-13 08:03:49,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-13 08:03:49,993 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 279 [2020-10-13 08:03:49,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-13 08:03:50,009 INFO L225 Difference]: With dead ends: 4267 [2020-10-13 08:03:50,009 INFO L226 Difference]: Without dead ends: 2515 [2020-10-13 08:03:50,018 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 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-10-13 08:03:50,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2020-10-13 08:03:50,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 1780. [2020-10-13 08:03:50,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1780 states. [2020-10-13 08:03:50,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2298 transitions. [2020-10-13 08:03:50,108 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2298 transitions. Word has length 279 [2020-10-13 08:03:50,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-13 08:03:50,108 INFO L479 AbstractCegarLoop]: Abstraction has 1780 states and 2298 transitions. [2020-10-13 08:03:50,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-13 08:03:50,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2298 transitions. [2020-10-13 08:03:50,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2020-10-13 08:03:50,117 INFO L414 BasicCegarLoop]: Found error trace [2020-10-13 08:03:50,118 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-13 08:03:50,118 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-13 08:03:50,118 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-13 08:03:50,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-13 08:03:50,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1445651026, now seen corresponding path program 1 times [2020-10-13 08:03:50,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-13 08:03:50,119 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [941327714] [2020-10-13 08:03:50,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-13 08:03:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:50,206 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:50,275 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:50,934 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:51,573 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:51,573 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 303 [2020-10-13 08:03:51,573 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-13 08:03:51,573 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1399 [2020-10-13 08:03:51,574 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:51,574 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-13 08:03:51,574 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 164 [2020-10-13 08:03:51,574 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 19 [2020-10-13 08:03:51,574 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:51,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-13 08:03:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:51,659 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:51,660 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:51,661 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-13 08:03:51,661 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:51,661 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-13 08:03:51,661 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:51,661 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-13 08:03:51,662 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:03:51,662 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-13 08:03:51,662 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:51,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-13 08:03:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:51,676 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:51,691 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:51,691 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-13 08:03:51,691 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:51,691 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 15 [2020-10-13 08:03:51,692 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:51,692 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-13 08:03:51,692 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:03:51,693 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-13 08:03:51,693 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-13 08:03:51,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-13 08:03:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:51,745 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:51,815 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:51,816 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 83 [2020-10-13 08:03:51,816 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:51,816 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 93 [2020-10-13 08:03:51,817 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:51,817 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-13 08:03:51,817 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:03:51,818 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 77 [2020-10-13 08:03:51,818 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-13 08:03:51,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2020-10-13 08:03:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:51,913 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:52,006 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:52,243 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:52,243 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 121 [2020-10-13 08:03:52,244 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-13 08:03:52,244 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 347 [2020-10-13 08:03:52,244 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:52,244 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-13 08:03:52,244 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-13 08:03:52,245 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 121 [2020-10-13 08:03:52,245 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:52,440 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 181 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-10-13 08:03:52,441 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [941327714] [2020-10-13 08:03:52,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-13 08:03:52,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-13 08:03:52,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244251717] [2020-10-13 08:03:52,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-13 08:03:52,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-13 08:03:52,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-13 08:03:52,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-13 08:03:52,443 INFO L87 Difference]: Start difference. First operand 1780 states and 2298 transitions. Second operand 7 states. [2020-10-13 08:03:53,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-13 08:03:53,765 INFO L93 Difference]: Finished difference Result 3728 states and 5364 transitions. [2020-10-13 08:03:53,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-13 08:03:53,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 289 [2020-10-13 08:03:53,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-13 08:03:53,781 INFO L225 Difference]: With dead ends: 3728 [2020-10-13 08:03:53,781 INFO L226 Difference]: Without dead ends: 1930 [2020-10-13 08:03:53,790 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-13 08:03:53,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2020-10-13 08:03:53,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1788. [2020-10-13 08:03:53,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1788 states. [2020-10-13 08:03:53,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 2294 transitions. [2020-10-13 08:03:53,880 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 2294 transitions. Word has length 289 [2020-10-13 08:03:53,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-13 08:03:53,881 INFO L479 AbstractCegarLoop]: Abstraction has 1788 states and 2294 transitions. [2020-10-13 08:03:53,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-13 08:03:53,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2294 transitions. [2020-10-13 08:03:53,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2020-10-13 08:03:53,889 INFO L414 BasicCegarLoop]: Found error trace [2020-10-13 08:03:53,890 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-13 08:03:53,890 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-13 08:03:53,890 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-13 08:03:53,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-13 08:03:53,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1162357367, now seen corresponding path program 1 times [2020-10-13 08:03:53,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-13 08:03:53,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [883012253] [2020-10-13 08:03:53,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-13 08:03:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:54,031 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:54,182 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:54,945 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:54,945 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 338 [2020-10-13 08:03:54,946 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-13 08:03:54,946 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 962 [2020-10-13 08:03:54,946 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:54,946 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-13 08:03:54,946 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 199 [2020-10-13 08:03:54,947 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 123 [2020-10-13 08:03:54,947 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:55,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-13 08:03:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:55,022 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:55,024 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:55,025 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-13 08:03:55,025 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:55,025 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-13 08:03:55,025 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:55,025 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-13 08:03:55,026 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:03:55,026 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-13 08:03:55,026 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:55,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-13 08:03:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:55,050 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:55,080 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:55,080 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-13 08:03:55,080 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:55,080 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 30 [2020-10-13 08:03:55,081 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:55,081 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-13 08:03:55,081 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:03:55,082 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-13 08:03:55,082 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-13 08:03:55,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-13 08:03:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:55,140 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:55,173 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:55,173 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 73 [2020-10-13 08:03:55,174 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:55,174 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 40 [2020-10-13 08:03:55,174 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:55,174 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-13 08:03:55,174 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:03:55,174 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 67 [2020-10-13 08:03:55,175 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:55,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2020-10-13 08:03:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:03:55,229 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:03:55,374 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:03:55,374 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 121 [2020-10-13 08:03:55,374 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:03:55,374 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 160 [2020-10-13 08:03:55,375 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:03:55,375 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-13 08:03:55,375 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-13 08:03:55,375 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 121 [2020-10-13 08:03:55,376 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:03:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 216 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2020-10-13 08:03:55,539 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [883012253] [2020-10-13 08:03:55,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-13 08:03:55,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-13 08:03:55,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655144465] [2020-10-13 08:03:55,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-13 08:03:55,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-13 08:03:55,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-13 08:03:55,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-13 08:03:55,541 INFO L87 Difference]: Start difference. First operand 1788 states and 2294 transitions. Second operand 7 states. [2020-10-13 08:03:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-13 08:03:57,322 INFO L93 Difference]: Finished difference Result 4242 states and 5871 transitions. [2020-10-13 08:03:57,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-13 08:03:57,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 324 [2020-10-13 08:03:57,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-13 08:03:57,337 INFO L225 Difference]: With dead ends: 4242 [2020-10-13 08:03:57,338 INFO L226 Difference]: Without dead ends: 2460 [2020-10-13 08:03:57,343 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-13 08:03:57,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2020-10-13 08:03:57,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 2241. [2020-10-13 08:03:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2241 states. [2020-10-13 08:03:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 2829 transitions. [2020-10-13 08:03:57,426 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 2829 transitions. Word has length 324 [2020-10-13 08:03:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-13 08:03:57,427 INFO L479 AbstractCegarLoop]: Abstraction has 2241 states and 2829 transitions. [2020-10-13 08:03:57,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-13 08:03:57,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 2829 transitions. [2020-10-13 08:03:57,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2020-10-13 08:03:57,448 INFO L414 BasicCegarLoop]: Found error trace [2020-10-13 08:03:57,448 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-13 08:03:57,449 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-13 08:03:57,449 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-13 08:03:57,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-13 08:03:57,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1654194082, now seen corresponding path program 1 times [2020-10-13 08:03:57,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-13 08:03:57,450 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1054854234] [2020-10-13 08:03:57,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-13 08:03:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-13 08:03:57,551 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-13 08:03:57,551 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-13 08:03:57,561 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-13 08:03:57,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 08:03:57 BoogieIcfgContainer [2020-10-13 08:03:57,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-13 08:03:57,645 INFO L168 Benchmark]: Toolchain (without parser) took 30186.03 ms. Allocated memory was 148.4 MB in the beginning and 699.4 MB in the end (delta: 551.0 MB). Free memory was 102.1 MB in the beginning and 479.1 MB in the end (delta: -377.0 MB). Peak memory consumption was 174.1 MB. Max. memory is 7.1 GB. [2020-10-13 08:03:57,646 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 148.4 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-13 08:03:57,647 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.86 ms. Allocated memory was 148.4 MB in the beginning and 207.6 MB in the end (delta: 59.2 MB). Free memory was 101.9 MB in the beginning and 173.3 MB in the end (delta: -71.4 MB). Peak memory consumption was 30.5 MB. Max. memory is 7.1 GB. [2020-10-13 08:03:57,649 INFO L168 Benchmark]: Boogie Preprocessor took 106.75 ms. Allocated memory is still 207.6 MB. Free memory was 173.3 MB in the beginning and 168.6 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2020-10-13 08:03:57,654 INFO L168 Benchmark]: RCFGBuilder took 1423.99 ms. Allocated memory was 207.6 MB in the beginning and 236.5 MB in the end (delta: 28.8 MB). Free memory was 168.6 MB in the beginning and 177.7 MB in the end (delta: -9.2 MB). Peak memory consumption was 79.5 MB. Max. memory is 7.1 GB. [2020-10-13 08:03:57,655 INFO L168 Benchmark]: TraceAbstraction took 27906.31 ms. Allocated memory was 236.5 MB in the beginning and 699.4 MB in the end (delta: 462.9 MB). Free memory was 176.3 MB in the beginning and 479.1 MB in the end (delta: -302.7 MB). Peak memory consumption was 160.2 MB. Max. memory is 7.1 GB. [2020-10-13 08:03:57,666 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.14 ms. Allocated memory is still 148.4 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 743.86 ms. Allocated memory was 148.4 MB in the beginning and 207.6 MB in the end (delta: 59.2 MB). Free memory was 101.9 MB in the beginning and 173.3 MB in the end (delta: -71.4 MB). Peak memory consumption was 30.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 106.75 ms. Allocated memory is still 207.6 MB. Free memory was 173.3 MB in the beginning and 168.6 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1423.99 ms. Allocated memory was 207.6 MB in the beginning and 236.5 MB in the end (delta: 28.8 MB). Free memory was 168.6 MB in the beginning and 177.7 MB in the end (delta: -9.2 MB). Peak memory consumption was 79.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27906.31 ms. Allocated memory was 236.5 MB in the beginning and 699.4 MB in the end (delta: 462.9 MB). Free memory was 176.3 MB in the beginning and 479.1 MB in the end (delta: -302.7 MB). Peak memory consumption was 160.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 37]: 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 TRUE ((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 ))) [L287] a1 = ((((((a1 % 89)+ 74) - -21) * 5) % 89)- -118) [L288] a19 = 10 [L290] 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 TRUE (((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1)) [L455] a1 = ((((a1 + 381077) % 25)- -1) / 5) [L456] a10 = 2 [L457] a19 = 7 [L459] 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 TRUE (((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)) [L37] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 27.7s, OverallIterations: 10, TraceHistogramMax: 4, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 266 SDtfs, 3230 SDslu, 311 SDs, 0 SdLazy, 7820 SolverSat, 1056 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2241occurred 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.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 1877 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 2126 NumberOfCodeBlocks, 2126 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1780 ConstructedInterpolants, 0 QuantifiedInterpolants, 1430554 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 1081/1165 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...