/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=BIGGEST --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-12 13:05:27,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-12 13:05:27,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-12 13:05:27,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-12 13:05:27,219 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-12 13:05:27,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-12 13:05:27,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-12 13:05:27,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-12 13:05:27,225 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-12 13:05:27,226 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-12 13:05:27,227 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-12 13:05:27,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-12 13:05:27,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-12 13:05:27,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-12 13:05:27,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-12 13:05:27,232 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-12 13:05:27,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-12 13:05:27,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-12 13:05:27,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-12 13:05:27,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-12 13:05:27,238 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-12 13:05:27,239 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-12 13:05:27,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-12 13:05:27,244 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-12 13:05:27,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-12 13:05:27,248 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-12 13:05:27,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-12 13:05:27,250 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-12 13:05:27,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-12 13:05:27,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-12 13:05:27,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-12 13:05:27,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-12 13:05:27,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-12 13:05:27,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-12 13:05:27,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-12 13:05:27,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-12 13:05:27,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-12 13:05:27,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-12 13:05:27,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-12 13:05:27,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-12 13:05:27,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-12 13:05:27,267 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-12 13:05:27,317 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-12 13:05:27,319 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-12 13:05:27,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-12 13:05:27,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-12 13:05:27,321 INFO L138 SettingsManager]: * Use SBE=true [2020-10-12 13:05:27,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-12 13:05:27,321 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-12 13:05:27,321 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-12 13:05:27,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-12 13:05:27,322 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-12 13:05:27,324 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-12 13:05:27,324 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-12 13:05:27,324 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-12 13:05:27,324 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-12 13:05:27,325 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-12 13:05:27,325 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-12 13:05:27,326 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-12 13:05:27,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-12 13:05:27,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-12 13:05:27,327 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-12 13:05:27,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-12 13:05:27,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-12 13:05:27,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-12 13:05:27,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-12 13:05:27,328 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-12 13:05:27,328 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-12 13:05:27,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-12 13:05:27,328 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-12 13:05:27,329 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-12 13:05:27,329 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=BIGGEST;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=BIGGEST;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=BIGGEST;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=BIGGEST;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=BIGGEST;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=BIGGEST;log-additional-information=true;unknown-allowed=true; [2020-10-12 13:05:27,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-12 13:05:27,675 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-12 13:05:27,678 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-12 13:05:27,680 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-12 13:05:27,681 INFO L275 PluginConnector]: CDTParser initialized [2020-10-12 13:05:27,681 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-12 13:05:27,742 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/556b2c4d1/5b4ea195f7c242e3bb4bfd35047e7de3/FLAGeb9af48cd [2020-10-12 13:05:28,234 INFO L306 CDTParser]: Found 1 translation units. [2020-10-12 13:05:28,235 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label28.c [2020-10-12 13:05:28,253 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/556b2c4d1/5b4ea195f7c242e3bb4bfd35047e7de3/FLAGeb9af48cd [2020-10-12 13:05:28,510 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/556b2c4d1/5b4ea195f7c242e3bb4bfd35047e7de3 [2020-10-12 13:05:28,520 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-12 13:05:28,522 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-12 13:05:28,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-12 13:05:28,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-12 13:05:28,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-12 13:05:28,528 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 01:05:28" (1/1) ... [2020-10-12 13:05:28,531 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad6a6c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:28, skipping insertion in model container [2020-10-12 13:05:28,531 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 01:05:28" (1/1) ... [2020-10-12 13:05:28,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-12 13:05:28,583 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-12 13:05:29,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-12 13:05:29,123 INFO L203 MainTranslator]: Completed pre-run [2020-10-12 13:05:29,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-12 13:05:29,395 INFO L208 MainTranslator]: Completed translation [2020-10-12 13:05:29,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:29 WrapperNode [2020-10-12 13:05:29,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-12 13:05:29,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-12 13:05:29,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-12 13:05:29,397 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-12 13:05:29,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:29" (1/1) ... [2020-10-12 13:05:29,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:29" (1/1) ... [2020-10-12 13:05:29,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:29" (1/1) ... [2020-10-12 13:05:29,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:29" (1/1) ... [2020-10-12 13:05:29,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:29" (1/1) ... [2020-10-12 13:05:29,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:29" (1/1) ... [2020-10-12 13:05:29,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:29" (1/1) ... [2020-10-12 13:05:29,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-12 13:05:29,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-12 13:05:29,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-12 13:05:29,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-12 13:05:29,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:29" (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-12 13:05:29,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-12 13:05:29,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-12 13:05:29,616 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-12 13:05:29,616 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-12 13:05:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-12 13:05:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-10-12 13:05:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-12 13:05:29,618 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-12 13:05:29,618 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-12 13:05:29,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-12 13:05:29,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-12 13:05:31,071 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-12 13:05:31,072 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-12 13:05:31,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:05:31 BoogieIcfgContainer [2020-10-12 13:05:31,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-12 13:05:31,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-12 13:05:31,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-12 13:05:31,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-12 13:05:31,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 01:05:28" (1/3) ... [2020-10-12 13:05:31,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3947fc7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 01:05:31, skipping insertion in model container [2020-10-12 13:05:31,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:29" (2/3) ... [2020-10-12 13:05:31,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3947fc7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 01:05:31, skipping insertion in model container [2020-10-12 13:05:31,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:05:31" (3/3) ... [2020-10-12 13:05:31,094 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label28.c [2020-10-12 13:05:31,106 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-12 13:05:31,118 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-12 13:05:31,132 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-12 13:05:31,168 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-12 13:05:31,169 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-12 13:05:31,169 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-12 13:05:31,170 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-12 13:05:31,170 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-12 13:05:31,170 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-12 13:05:31,170 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-12 13:05:31,170 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-12 13:05:31,197 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-10-12 13:05:31,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-12 13:05:31,204 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:05:31,205 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-12 13:05:31,205 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:05:31,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:05:31,211 INFO L82 PathProgramCache]: Analyzing trace with hash 7815070, now seen corresponding path program 1 times [2020-10-12 13:05:31,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:05:31,221 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1263718191] [2020-10-12 13:05:31,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:05:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:31,381 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:31,658 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:31,659 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 25 [2020-10-12 13:05:31,659 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:05:31,659 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 317 [2020-10-12 13:05:31,661 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:31,661 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-12 13:05:31,662 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-12 13:05:31,662 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 19 [2020-10-12 13:05:31,662 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-12 13:05:31,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:05:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:31,787 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:31,809 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:31,809 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:05:31,810 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:05:31,810 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 24 [2020-10-12 13:05:31,811 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:31,811 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:05:31,811 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:05:31,812 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-12 13:05:31,812 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:05:31,833 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-12 13:05:31,834 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1263718191] [2020-10-12 13:05:31,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-12 13:05:31,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-12 13:05:31,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42116339] [2020-10-12 13:05:31,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-12 13:05:31,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:05:31,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-12 13:05:31,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-12 13:05:31,872 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 5 states. [2020-10-12 13:05:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:05:34,080 INFO L93 Difference]: Finished difference Result 730 states and 1300 transitions. [2020-10-12 13:05:34,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-12 13:05:34,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-12 13:05:34,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:05:34,128 INFO L225 Difference]: With dead ends: 730 [2020-10-12 13:05:34,129 INFO L226 Difference]: Without dead ends: 447 [2020-10-12 13:05:34,149 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-12 13:05:34,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2020-10-12 13:05:34,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 443. [2020-10-12 13:05:34,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2020-10-12 13:05:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 615 transitions. [2020-10-12 13:05:34,302 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 615 transitions. Word has length 17 [2020-10-12 13:05:34,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:05:34,303 INFO L479 AbstractCegarLoop]: Abstraction has 443 states and 615 transitions. [2020-10-12 13:05:34,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-12 13:05:34,303 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 615 transitions. [2020-10-12 13:05:34,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-10-12 13:05:34,309 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:05:34,309 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-12 13:05:34,310 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-12 13:05:34,310 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:05:34,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:05:34,311 INFO L82 PathProgramCache]: Analyzing trace with hash 556045594, now seen corresponding path program 1 times [2020-10-12 13:05:34,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:05:34,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1011103513] [2020-10-12 13:05:34,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:05:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:34,441 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:34,617 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:35,110 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:35,110 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 97 [2020-10-12 13:05:35,111 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-12 13:05:35,111 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 716 [2020-10-12 13:05:35,112 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:35,112 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 8 [2020-10-12 13:05:35,112 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-12 13:05:35,113 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-12 13:05:35,113 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:05:35,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:05:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:35,177 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:35,182 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:35,183 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:05:35,183 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:05:35,183 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-12 13:05:35,183 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:35,184 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:05:35,184 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:05:35,184 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-12 13:05:35,184 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:05:35,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:05:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:35,222 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:35,257 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:35,346 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:35,346 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-12 13:05:35,347 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-12 13:05:35,347 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 132 [2020-10-12 13:05:35,347 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:35,347 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:05:35,348 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:05:35,348 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 71 [2020-10-12 13:05:35,348 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:05:35,423 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-12 13:05:35,424 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1011103513] [2020-10-12 13:05:35,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:05:35,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-12 13:05:35,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020608526] [2020-10-12 13:05:35,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-12 13:05:35,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:05:35,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-12 13:05:35,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-12 13:05:35,428 INFO L87 Difference]: Start difference. First operand 443 states and 615 transitions. Second operand 7 states. [2020-10-12 13:05:37,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:05:37,305 INFO L93 Difference]: Finished difference Result 1192 states and 1791 transitions. [2020-10-12 13:05:37,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-12 13:05:37,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2020-10-12 13:05:37,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:05:37,318 INFO L225 Difference]: With dead ends: 1192 [2020-10-12 13:05:37,318 INFO L226 Difference]: Without dead ends: 1190 [2020-10-12 13:05:37,319 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-10-12 13:05:37,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-10-12 13:05:37,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 735. [2020-10-12 13:05:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2020-10-12 13:05:37,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1070 transitions. [2020-10-12 13:05:37,376 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1070 transitions. Word has length 87 [2020-10-12 13:05:37,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:05:37,377 INFO L479 AbstractCegarLoop]: Abstraction has 735 states and 1070 transitions. [2020-10-12 13:05:37,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-12 13:05:37,377 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1070 transitions. [2020-10-12 13:05:37,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-10-12 13:05:37,388 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:05:37,389 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-12 13:05:37,389 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-12 13:05:37,389 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:05:37,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:05:37,390 INFO L82 PathProgramCache]: Analyzing trace with hash 552964622, now seen corresponding path program 1 times [2020-10-12 13:05:37,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:05:37,390 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1995462112] [2020-10-12 13:05:37,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:05:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:37,469 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:37,659 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:38,311 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:38,312 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 197 [2020-10-12 13:05:38,312 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-12 13:05:38,312 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 873 [2020-10-12 13:05:38,312 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:38,312 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:05:38,313 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-12 13:05:38,313 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 101 [2020-10-12 13:05:38,313 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:05:38,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:05:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:38,379 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:38,381 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:38,381 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:05:38,382 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:05:38,382 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-12 13:05:38,382 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:38,382 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:05:38,383 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:05:38,383 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:05:38,383 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:05:38,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:05:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:38,418 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:38,466 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:38,466 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-12 13:05:38,466 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:05:38,467 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 56 [2020-10-12 13:05:38,467 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:38,467 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:05:38,467 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:05:38,467 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-12 13:05:38,468 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:05:38,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-12 13:05:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:38,530 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:38,659 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:38,660 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 99 [2020-10-12 13:05:38,660 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:05:38,660 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 144 [2020-10-12 13:05:38,660 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:38,660 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:05:38,661 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:05:38,661 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 99 [2020-10-12 13:05:38,661 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:05:38,764 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-12 13:05:38,765 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1995462112] [2020-10-12 13:05:38,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:05:38,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-12 13:05:38,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552689895] [2020-10-12 13:05:38,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-12 13:05:38,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:05:38,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-12 13:05:38,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-12 13:05:38,767 INFO L87 Difference]: Start difference. First operand 735 states and 1070 transitions. Second operand 7 states. [2020-10-12 13:05:40,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:05:40,334 INFO L93 Difference]: Finished difference Result 1488 states and 2181 transitions. [2020-10-12 13:05:40,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-12 13:05:40,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 185 [2020-10-12 13:05:40,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:05:40,344 INFO L225 Difference]: With dead ends: 1488 [2020-10-12 13:05:40,345 INFO L226 Difference]: Without dead ends: 759 [2020-10-12 13:05:40,348 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-12 13:05:40,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2020-10-12 13:05:40,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 594. [2020-10-12 13:05:40,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2020-10-12 13:05:40,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 711 transitions. [2020-10-12 13:05:40,385 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 711 transitions. Word has length 185 [2020-10-12 13:05:40,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:05:40,390 INFO L479 AbstractCegarLoop]: Abstraction has 594 states and 711 transitions. [2020-10-12 13:05:40,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-12 13:05:40,390 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 711 transitions. [2020-10-12 13:05:40,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-10-12 13:05:40,402 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:05:40,403 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, 1, 1, 1, 1, 1, 1, 1, 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-12 13:05:40,404 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-12 13:05:40,404 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:05:40,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:05:40,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1276300145, now seen corresponding path program 1 times [2020-10-12 13:05:40,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:05:40,405 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1355208272] [2020-10-12 13:05:40,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:05:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:40,469 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:40,828 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:41,868 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:41,868 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 204 [2020-10-12 13:05:41,869 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-12 13:05:41,869 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1420 [2020-10-12 13:05:41,876 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:41,876 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-12 13:05:41,876 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-12 13:05:41,876 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 83 [2020-10-12 13:05:41,877 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:05:41,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:05:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:41,956 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:41,966 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:41,967 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:05:41,967 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:05:41,967 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 11 [2020-10-12 13:05:41,967 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:41,968 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:05:41,968 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:05:41,968 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-12 13:05:41,968 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:05:42,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:05:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:42,059 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:42,164 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:42,164 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-12 13:05:42,164 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:05:42,164 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 114 [2020-10-12 13:05:42,165 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:42,165 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:05:42,165 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:05:42,165 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-10-12 13:05:42,165 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:05:42,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-12 13:05:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:42,265 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:42,305 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:42,305 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 99 [2020-10-12 13:05:42,305 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:05:42,306 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 53 [2020-10-12 13:05:42,306 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:42,306 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:05:42,306 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 96 [2020-10-12 13:05:42,306 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:05:42,307 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:05:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 20 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-12 13:05:42,386 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1355208272] [2020-10-12 13:05:42,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:05:42,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-12 13:05:42,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440329915] [2020-10-12 13:05:42,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-12 13:05:42,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:05:42,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-12 13:05:42,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-12 13:05:42,388 INFO L87 Difference]: Start difference. First operand 594 states and 711 transitions. Second operand 7 states. [2020-10-12 13:05:43,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:05:43,611 INFO L93 Difference]: Finished difference Result 1345 states and 1610 transitions. [2020-10-12 13:05:43,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-12 13:05:43,612 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2020-10-12 13:05:43,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:05:43,618 INFO L225 Difference]: With dead ends: 1345 [2020-10-12 13:05:43,619 INFO L226 Difference]: Without dead ends: 757 [2020-10-12 13:05:43,621 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-10-12 13:05:43,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2020-10-12 13:05:43,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 743. [2020-10-12 13:05:43,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2020-10-12 13:05:43,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 877 transitions. [2020-10-12 13:05:43,656 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 877 transitions. Word has length 192 [2020-10-12 13:05:43,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:05:43,656 INFO L479 AbstractCegarLoop]: Abstraction has 743 states and 877 transitions. [2020-10-12 13:05:43,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-12 13:05:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 877 transitions. [2020-10-12 13:05:43,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-10-12 13:05:43,661 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:05:43,661 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] [2020-10-12 13:05:43,662 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-12 13:05:43,662 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:05:43,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:05:43,663 INFO L82 PathProgramCache]: Analyzing trace with hash 391993621, now seen corresponding path program 1 times [2020-10-12 13:05:43,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:05:43,663 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1455406863] [2020-10-12 13:05:43,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:05:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:43,763 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:44,002 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:44,201 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:44,755 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:44,755 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 206 [2020-10-12 13:05:44,756 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-12 13:05:44,756 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1016 [2020-10-12 13:05:44,756 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:44,756 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:05:44,756 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-12 13:05:44,757 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 101 [2020-10-12 13:05:44,757 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:05:44,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:05:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:44,815 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:44,817 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:44,817 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:05:44,817 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:05:44,818 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-12 13:05:44,818 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:44,818 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:05:44,818 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:05:44,819 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:05:44,819 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:05:44,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:05:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:44,854 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:44,912 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:44,913 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-12 13:05:44,913 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:05:44,913 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 67 [2020-10-12 13:05:44,913 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:44,920 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:05:44,920 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:05:44,920 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-12 13:05:44,920 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 6 [2020-10-12 13:05:44,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-12 13:05:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:45,017 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:45,131 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:45,132 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 99 [2020-10-12 13:05:45,132 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:05:45,132 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 132 [2020-10-12 13:05:45,132 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:45,132 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:05:45,133 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:05:45,133 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 99 [2020-10-12 13:05:45,133 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:05:45,221 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-12 13:05:45,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1455406863] [2020-10-12 13:05:45,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:05:45,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-12 13:05:45,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356882065] [2020-10-12 13:05:45,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-12 13:05:45,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:05:45,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-12 13:05:45,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-12 13:05:45,224 INFO L87 Difference]: Start difference. First operand 743 states and 877 transitions. Second operand 7 states. [2020-10-12 13:05:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:05:48,874 INFO L93 Difference]: Finished difference Result 1512 states and 1866 transitions. [2020-10-12 13:05:48,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-12 13:05:48,875 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 194 [2020-10-12 13:05:48,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:05:48,885 INFO L225 Difference]: With dead ends: 1512 [2020-10-12 13:05:48,886 INFO L226 Difference]: Without dead ends: 918 [2020-10-12 13:05:48,889 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-12 13:05:48,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2020-10-12 13:05:48,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 896. [2020-10-12 13:05:48,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2020-10-12 13:05:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1076 transitions. [2020-10-12 13:05:48,932 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1076 transitions. Word has length 194 [2020-10-12 13:05:48,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:05:48,933 INFO L479 AbstractCegarLoop]: Abstraction has 896 states and 1076 transitions. [2020-10-12 13:05:48,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-12 13:05:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1076 transitions. [2020-10-12 13:05:48,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-10-12 13:05:48,939 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:05:48,939 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-12 13:05:48,940 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-12 13:05:48,940 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:05:48,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:05:48,940 INFO L82 PathProgramCache]: Analyzing trace with hash 2082694709, now seen corresponding path program 1 times [2020-10-12 13:05:48,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:05:48,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1408602366] [2020-10-12 13:05:48,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:05:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:49,007 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:49,324 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:49,449 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:51,040 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:51,040 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 222 [2020-10-12 13:05:51,040 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-12 13:05:51,040 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2057 [2020-10-12 13:05:51,041 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:51,041 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-12 13:05:51,041 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-12 13:05:51,041 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 101 [2020-10-12 13:05:51,041 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:05:51,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:05:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:51,084 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:51,089 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:51,089 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:05:51,089 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:05:51,090 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-12 13:05:51,090 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:51,090 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:05:51,090 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:05:51,090 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-12 13:05:51,091 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:05:51,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:05:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:51,143 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:51,239 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:51,240 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 96 [2020-10-12 13:05:51,240 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:05:51,240 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 107 [2020-10-12 13:05:51,240 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:51,241 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:05:51,241 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:05:51,241 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 96 [2020-10-12 13:05:51,241 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:05:51,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2020-10-12 13:05:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:51,319 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:51,351 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:51,352 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 99 [2020-10-12 13:05:51,352 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:05:51,352 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 42 [2020-10-12 13:05:51,352 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:51,353 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:05:51,353 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 96 [2020-10-12 13:05:51,353 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:05:51,353 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:05:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 20 proven. 90 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-12 13:05:51,420 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1408602366] [2020-10-12 13:05:51,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:05:51,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-12 13:05:51,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330882384] [2020-10-12 13:05:51,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-12 13:05:51,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:05:51,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-12 13:05:51,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-12 13:05:51,423 INFO L87 Difference]: Start difference. First operand 896 states and 1076 transitions. Second operand 8 states. [2020-10-12 13:05:53,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:05:53,008 INFO L93 Difference]: Finished difference Result 1983 states and 2482 transitions. [2020-10-12 13:05:53,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-12 13:05:53,015 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 210 [2020-10-12 13:05:53,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:05:53,024 INFO L225 Difference]: With dead ends: 1983 [2020-10-12 13:05:53,024 INFO L226 Difference]: Without dead ends: 1236 [2020-10-12 13:05:53,027 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-10-12 13:05:53,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-10-12 13:05:53,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1202. [2020-10-12 13:05:53,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1202 states. [2020-10-12 13:05:53,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1384 transitions. [2020-10-12 13:05:53,068 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1384 transitions. Word has length 210 [2020-10-12 13:05:53,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:05:53,068 INFO L479 AbstractCegarLoop]: Abstraction has 1202 states and 1384 transitions. [2020-10-12 13:05:53,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-12 13:05:53,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1384 transitions. [2020-10-12 13:05:53,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2020-10-12 13:05:53,073 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:05:53,074 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, 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] [2020-10-12 13:05:53,074 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-12 13:05:53,074 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:05:53,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:05:53,075 INFO L82 PathProgramCache]: Analyzing trace with hash 15454926, now seen corresponding path program 1 times [2020-10-12 13:05:53,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:05:53,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2133463613] [2020-10-12 13:05:53,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:05:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:53,135 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:53,253 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:53,570 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:53,826 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:55,986 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:55,987 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 285 [2020-10-12 13:05:55,987 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-12 13:05:55,987 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2874 [2020-10-12 13:05:55,988 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:55,988 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-12 13:05:55,988 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-12 13:05:55,988 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 180 [2020-10-12 13:05:55,989 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:05:56,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:05:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:56,076 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:56,080 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:56,080 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:05:56,081 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:05:56,081 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-12 13:05:56,082 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:56,082 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:05:56,082 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:05:56,083 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:05:56,083 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:05:56,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:05:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:56,120 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:56,191 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:56,192 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-12 13:05:56,192 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:05:56,192 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 81 [2020-10-12 13:05:56,192 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:56,193 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:05:56,193 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:05:56,193 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-12 13:05:56,193 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:05:56,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-12 13:05:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:56,234 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:56,290 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:56,361 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:56,361 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-12 13:05:56,363 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-12 13:05:56,363 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 134 [2020-10-12 13:05:56,364 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:56,364 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:05:56,364 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:05:56,365 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-10-12 13:05:56,365 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:05:56,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-10-12 13:05:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:56,459 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:56,601 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:05:56,602 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 99 [2020-10-12 13:05:56,602 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:05:56,603 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 156 [2020-10-12 13:05:56,603 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:05:56,603 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:05:56,604 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:05:56,604 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 99 [2020-10-12 13:05:56,605 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:05:56,790 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-10-12 13:05:56,790 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2133463613] [2020-10-12 13:05:56,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:05:56,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-12 13:05:56,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806888836] [2020-10-12 13:05:56,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-12 13:05:56,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:05:56,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-12 13:05:56,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-12 13:05:56,795 INFO L87 Difference]: Start difference. First operand 1202 states and 1384 transitions. Second operand 8 states. [2020-10-12 13:05:59,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:05:59,484 INFO L93 Difference]: Finished difference Result 3276 states and 3850 transitions. [2020-10-12 13:05:59,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-12 13:05:59,485 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 271 [2020-10-12 13:05:59,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:05:59,493 INFO L225 Difference]: With dead ends: 3276 [2020-10-12 13:05:59,493 INFO L226 Difference]: Without dead ends: 1627 [2020-10-12 13:05:59,498 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-10-12 13:05:59,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2020-10-12 13:05:59,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1333. [2020-10-12 13:05:59,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2020-10-12 13:05:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1458 transitions. [2020-10-12 13:05:59,537 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1458 transitions. Word has length 271 [2020-10-12 13:05:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:05:59,537 INFO L479 AbstractCegarLoop]: Abstraction has 1333 states and 1458 transitions. [2020-10-12 13:05:59,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-12 13:05:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1458 transitions. [2020-10-12 13:05:59,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2020-10-12 13:05:59,544 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:05:59,544 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, 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] [2020-10-12 13:05:59,544 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-12 13:05:59,545 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:05:59,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:05:59,545 INFO L82 PathProgramCache]: Analyzing trace with hash 332571206, now seen corresponding path program 1 times [2020-10-12 13:05:59,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:05:59,546 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [817830472] [2020-10-12 13:05:59,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:05:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:05:59,669 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:05:59,937 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:00,823 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:00,823 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 321 [2020-10-12 13:06:00,823 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-12 13:06:00,823 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1200 [2020-10-12 13:06:00,824 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:00,824 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:06:00,824 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-12 13:06:00,824 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 80 [2020-10-12 13:06:00,825 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:00,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:06:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:00,900 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:00,902 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:00,902 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:06:00,903 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:00,903 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-12 13:06:00,903 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:00,903 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:06:00,904 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:06:00,904 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:06:00,904 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:06:00,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:06:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:00,985 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:01,054 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:01,055 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-12 13:06:01,055 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:01,055 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 80 [2020-10-12 13:06:01,056 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:01,056 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:06:01,057 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:06:01,057 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-12 13:06:01,057 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:06:01,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-12 13:06:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:01,152 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:01,272 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:01,272 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-12 13:06:01,273 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:01,273 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 132 [2020-10-12 13:06:01,273 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:01,273 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:06:01,274 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:06:01,274 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-10-12 13:06:01,274 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:01,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2020-10-12 13:06:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:01,416 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:01,464 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:01,464 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 99 [2020-10-12 13:06:01,464 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:01,465 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 63 [2020-10-12 13:06:01,465 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:01,465 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:06:01,465 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 96 [2020-10-12 13:06:01,466 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:06:01,466 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:06:01,709 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 108 proven. 76 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2020-10-12 13:06:01,709 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [817830472] [2020-10-12 13:06:01,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:06:01,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-12 13:06:01,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478450621] [2020-10-12 13:06:01,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-12 13:06:01,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:06:01,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-12 13:06:01,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-12 13:06:01,712 INFO L87 Difference]: Start difference. First operand 1333 states and 1458 transitions. Second operand 8 states. [2020-10-12 13:06:05,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:06:05,823 INFO L93 Difference]: Finished difference Result 3115 states and 3485 transitions. [2020-10-12 13:06:05,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-12 13:06:05,829 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 307 [2020-10-12 13:06:05,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:06:05,840 INFO L225 Difference]: With dead ends: 3115 [2020-10-12 13:06:05,840 INFO L226 Difference]: Without dead ends: 1931 [2020-10-12 13:06:05,843 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-10-12 13:06:05,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2020-10-12 13:06:05,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1923. [2020-10-12 13:06:05,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1923 states. [2020-10-12 13:06:05,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2095 transitions. [2020-10-12 13:06:05,902 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 2095 transitions. Word has length 307 [2020-10-12 13:06:05,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:06:05,903 INFO L479 AbstractCegarLoop]: Abstraction has 1923 states and 2095 transitions. [2020-10-12 13:06:05,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-12 13:06:05,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2095 transitions. [2020-10-12 13:06:05,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2020-10-12 13:06:05,910 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:06:05,911 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, 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] [2020-10-12 13:06:05,911 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-12 13:06:05,911 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:06:05,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:06:05,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1830285813, now seen corresponding path program 1 times [2020-10-12 13:06:05,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:06:05,912 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1101957430] [2020-10-12 13:06:05,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:06:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:06,070 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:06,530 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:06,531 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 340 [2020-10-12 13:06:06,531 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:06,531 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 538 [2020-10-12 13:06:06,531 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:06,532 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:06:06,532 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 323 [2020-10-12 13:06:06,532 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 16 [2020-10-12 13:06:06,532 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:06,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:06:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:06,620 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:06,622 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:06,623 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:06:06,623 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:06,623 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-12 13:06:06,623 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:06,624 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:06:06,624 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:06:06,624 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:06:06,624 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:06,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:06:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:06,644 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:06,685 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:06,685 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 135 [2020-10-12 13:06:06,685 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:06,686 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 42 [2020-10-12 13:06:06,686 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:06,686 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:06:06,686 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:06:06,686 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:06:06,687 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:06,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-10-12 13:06:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:06,732 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:06,749 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:06,750 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-12 13:06:06,750 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:06,750 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 18 [2020-10-12 13:06:06,750 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:06,750 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:06:06,751 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:06:06,751 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:06:06,751 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:06,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2020-10-12 13:06:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:06,797 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:06,858 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:06,858 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 99 [2020-10-12 13:06:06,858 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:06,859 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 73 [2020-10-12 13:06:06,859 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:06,859 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:06:06,859 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:06:06,859 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-12 13:06:06,860 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2020-10-12 13:06:06,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1101957430] [2020-10-12 13:06:06,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:06:06,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-12 13:06:06,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195941047] [2020-10-12 13:06:06,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-12 13:06:06,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:06:06,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-12 13:06:06,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-12 13:06:06,952 INFO L87 Difference]: Start difference. First operand 1923 states and 2095 transitions. Second operand 5 states. [2020-10-12 13:06:08,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:06:08,355 INFO L93 Difference]: Finished difference Result 4569 states and 5039 transitions. [2020-10-12 13:06:08,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-12 13:06:08,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 326 [2020-10-12 13:06:08,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:06:08,369 INFO L225 Difference]: With dead ends: 4569 [2020-10-12 13:06:08,370 INFO L226 Difference]: Without dead ends: 2650 [2020-10-12 13:06:08,375 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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-12 13:06:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-10-12 13:06:08,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2360. [2020-10-12 13:06:08,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2360 states. [2020-10-12 13:06:08,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 2617 transitions. [2020-10-12 13:06:08,462 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 2617 transitions. Word has length 326 [2020-10-12 13:06:08,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:06:08,463 INFO L479 AbstractCegarLoop]: Abstraction has 2360 states and 2617 transitions. [2020-10-12 13:06:08,463 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-12 13:06:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 2617 transitions. [2020-10-12 13:06:08,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2020-10-12 13:06:08,474 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:06:08,474 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-12 13:06:08,475 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-12 13:06:08,475 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:06:08,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:06:08,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1654194082, now seen corresponding path program 1 times [2020-10-12 13:06:08,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:06:08,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1227040626] [2020-10-12 13:06:08,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:06:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-12 13:06:08,602 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-12 13:06:08,602 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-12 13:06:08,607 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-12 13:06:08,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 01:06:08 BoogieIcfgContainer [2020-10-12 13:06:08,652 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-12 13:06:08,654 INFO L168 Benchmark]: Toolchain (without parser) took 40132.02 ms. Allocated memory was 137.9 MB in the beginning and 733.5 MB in the end (delta: 595.6 MB). Free memory was 100.0 MB in the beginning and 656.3 MB in the end (delta: -556.3 MB). Peak memory consumption was 615.8 MB. Max. memory is 7.1 GB. [2020-10-12 13:06:08,655 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.0 MB in the end (delta: 419.6 kB). Peak memory consumption was 419.6 kB. Max. memory is 7.1 GB. [2020-10-12 13:06:08,656 INFO L168 Benchmark]: CACSL2BoogieTranslator took 873.18 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 99.6 MB in the beginning and 169.2 MB in the end (delta: -69.6 MB). Peak memory consumption was 34.3 MB. Max. memory is 7.1 GB. [2020-10-12 13:06:08,658 INFO L168 Benchmark]: Boogie Preprocessor took 128.75 ms. Allocated memory is still 202.9 MB. Free memory was 169.2 MB in the beginning and 163.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. [2020-10-12 13:06:08,659 INFO L168 Benchmark]: RCFGBuilder took 1557.96 ms. Allocated memory was 202.9 MB in the beginning and 232.8 MB in the end (delta: 29.9 MB). Free memory was 163.8 MB in the beginning and 180.1 MB in the end (delta: -16.3 MB). Peak memory consumption was 85.9 MB. Max. memory is 7.1 GB. [2020-10-12 13:06:08,660 INFO L168 Benchmark]: TraceAbstraction took 37565.82 ms. Allocated memory was 232.8 MB in the beginning and 733.5 MB in the end (delta: 500.7 MB). Free memory was 180.1 MB in the beginning and 656.3 MB in the end (delta: -476.2 MB). Peak memory consumption was 601.0 MB. Max. memory is 7.1 GB. [2020-10-12 13:06:08,663 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.17 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.0 MB in the end (delta: 419.6 kB). Peak memory consumption was 419.6 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 873.18 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 99.6 MB in the beginning and 169.2 MB in the end (delta: -69.6 MB). Peak memory consumption was 34.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 128.75 ms. Allocated memory is still 202.9 MB. Free memory was 169.2 MB in the beginning and 163.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1557.96 ms. Allocated memory was 202.9 MB in the beginning and 232.8 MB in the end (delta: 29.9 MB). Free memory was 163.8 MB in the beginning and 180.1 MB in the end (delta: -16.3 MB). Peak memory consumption was 85.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 37565.82 ms. Allocated memory was 232.8 MB in the beginning and 733.5 MB in the end (delta: 500.7 MB). Free memory was 180.1 MB in the beginning and 656.3 MB in the end (delta: -476.2 MB). Peak memory consumption was 601.0 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: 37.4s, OverallIterations: 10, TraceHistogramMax: 4, AutomataDifference: 20.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 264 SDtfs, 4358 SDslu, 367 SDs, 0 SdLazy, 9662 SolverSat, 1561 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 15.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2360occurred 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.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 1286 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 2126 NumberOfCodeBlocks, 2126 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1780 ConstructedInterpolants, 0 QuantifiedInterpolants, 1079954 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 982/1238 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...