/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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=WIDESTAMONGSMALL --traceabstraction.additional.smt.options tolerance=0.6 --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 language data_model -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-0f64333 [2020-10-28 12:00:34,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-28 12:00:34,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-28 12:00:34,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-28 12:00:34,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-28 12:00:34,066 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-28 12:00:34,068 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-28 12:00:34,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-28 12:00:34,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-28 12:00:34,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-28 12:00:34,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-28 12:00:34,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-28 12:00:34,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-28 12:00:34,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-28 12:00:34,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-28 12:00:34,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-28 12:00:34,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-28 12:00:34,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-28 12:00:34,123 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-28 12:00:34,132 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-28 12:00:34,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-28 12:00:34,136 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-28 12:00:34,137 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-28 12:00:34,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-28 12:00:34,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-28 12:00:34,150 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-28 12:00:34,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-28 12:00:34,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-28 12:00:34,153 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-28 12:00:34,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-28 12:00:34,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-28 12:00:34,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-28 12:00:34,158 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-28 12:00:34,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-28 12:00:34,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-28 12:00:34,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-28 12:00:34,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-28 12:00:34,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-28 12:00:34,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-28 12:00:34,163 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-28 12:00:34,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-28 12:00:34,172 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-28 12:00:34,223 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-28 12:00:34,224 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-28 12:00:34,228 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-28 12:00:34,229 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-28 12:00:34,229 INFO L138 SettingsManager]: * Use SBE=true [2020-10-28 12:00:34,229 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-28 12:00:34,229 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-28 12:00:34,230 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-28 12:00:34,230 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-28 12:00:34,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-28 12:00:34,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-28 12:00:34,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-28 12:00:34,232 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-28 12:00:34,232 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-28 12:00:34,232 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-28 12:00:34,232 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-28 12:00:34,233 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-28 12:00:34,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-28 12:00:34,233 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-28 12:00:34,233 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-28 12:00:34,234 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-28 12:00:34,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-28 12:00:34,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-28 12:00:34,234 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-28 12:00:34,235 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-28 12:00:34,235 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-28 12:00:34,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-28 12:00:34,235 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-28 12:00:34,235 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-28 12:00:34,236 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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=WIDESTAMONGSMALL;tolerance=0.6;log-additional-information=true;unknown-allowed=true; [2020-10-28 12:00:34,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-28 12:00:34,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-28 12:00:34,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-28 12:00:34,728 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-28 12:00:34,729 INFO L275 PluginConnector]: CDTParser initialized [2020-10-28 12:00:34,730 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42.c [2020-10-28 12:00:34,811 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ce3366a4e/fbafa048d4ab433e98d349452e51c780/FLAGe43611abb [2020-10-28 12:00:35,620 INFO L306 CDTParser]: Found 1 translation units. [2020-10-28 12:00:35,621 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label42.c [2020-10-28 12:00:35,646 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ce3366a4e/fbafa048d4ab433e98d349452e51c780/FLAGe43611abb [2020-10-28 12:00:35,860 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ce3366a4e/fbafa048d4ab433e98d349452e51c780 [2020-10-28 12:00:35,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-28 12:00:35,875 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-28 12:00:35,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-28 12:00:35,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-28 12:00:35,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-28 12:00:35,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 12:00:35" (1/1) ... [2020-10-28 12:00:35,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7015976b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 12:00:35, skipping insertion in model container [2020-10-28 12:00:35,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 12:00:35" (1/1) ... [2020-10-28 12:00:35,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-28 12:00:35,974 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-28 12:00:36,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-28 12:00:36,428 INFO L203 MainTranslator]: Completed pre-run [2020-10-28 12:00:36,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-28 12:00:36,646 INFO L208 MainTranslator]: Completed translation [2020-10-28 12:00:36,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 12:00:36 WrapperNode [2020-10-28 12:00:36,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-28 12:00:36,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-28 12:00:36,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-28 12:00:36,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-28 12:00:36,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 12:00:36" (1/1) ... [2020-10-28 12:00:36,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 12:00:36" (1/1) ... [2020-10-28 12:00:36,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 12:00:36" (1/1) ... [2020-10-28 12:00:36,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 12:00:36" (1/1) ... [2020-10-28 12:00:36,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 12:00:36" (1/1) ... [2020-10-28 12:00:36,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 12:00:36" (1/1) ... [2020-10-28 12:00:36,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 12:00:36" (1/1) ... [2020-10-28 12:00:36,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-28 12:00:36,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-28 12:00:36,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-28 12:00:36,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-28 12:00:36,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 12:00:36" (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-28 12:00:36,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-28 12:00:36,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-28 12:00:36,849 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-28 12:00:36,849 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-28 12:00:36,849 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-28 12:00:36,849 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-28 12:00:36,849 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-28 12:00:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-28 12:00:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-28 12:00:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-28 12:00:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-28 12:00:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-28 12:00:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-28 12:00:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-28 12:00:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-28 12:00:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-28 12:00:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-28 12:00:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-28 12:00:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-28 12:00:38,201 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-28 12:00:38,202 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-28 12:00:38,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 12:00:38 BoogieIcfgContainer [2020-10-28 12:00:38,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-28 12:00:38,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-28 12:00:38,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-28 12:00:38,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-28 12:00:38,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 12:00:35" (1/3) ... [2020-10-28 12:00:38,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1bc905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 12:00:38, skipping insertion in model container [2020-10-28 12:00:38,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 12:00:36" (2/3) ... [2020-10-28 12:00:38,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1bc905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 12:00:38, skipping insertion in model container [2020-10-28 12:00:38,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 12:00:38" (3/3) ... [2020-10-28 12:00:38,218 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label42.c [2020-10-28 12:00:38,230 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-28 12:00:38,236 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-28 12:00:38,251 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-28 12:00:38,300 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-28 12:00:38,301 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-28 12:00:38,301 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-28 12:00:38,301 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-28 12:00:38,301 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-28 12:00:38,302 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-28 12:00:38,302 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-28 12:00:38,302 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-28 12:00:38,340 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states. [2020-10-28 12:00:38,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-28 12:00:38,356 INFO L414 BasicCegarLoop]: Found error trace [2020-10-28 12:00:38,358 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-28 12:00:38,358 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-28 12:00:38,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-28 12:00:38,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1476214996, now seen corresponding path program 1 times [2020-10-28 12:00:38,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-28 12:00:38,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [186870552] [2020-10-28 12:00:38,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-28 12:00:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-28 12:00:38,741 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:39,142 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-28 12:00:39,143 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 34 [2020-10-28 12:00:39,143 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-28 12:00:39,144 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 482 [2020-10-28 12:00:39,146 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-28 12:00:39,147 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-10-28 12:00:39,148 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-28 12:00:39,148 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-28 12:00:39,148 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 25 [2020-10-28 12:00:39,149 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 5 [2020-10-28 12:00:39,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-28 12:00:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-28 12:00:39,319 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:39,397 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-28 12:00:39,397 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-28 12:00:39,397 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-28 12:00:39,398 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 82 [2020-10-28 12:00:39,398 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-28 12:00:39,398 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-10-28 12:00:39,399 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-28 12:00:39,399 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-28 12:00:39,399 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-28 12:00:39,399 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-28 12:00:39,415 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-28 12:00:39,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [186870552] [2020-10-28 12:00:39,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-28 12:00:39,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-28 12:00:39,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692107684] [2020-10-28 12:00:39,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-28 12:00:39,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-28 12:00:39,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-28 12:00:39,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-28 12:00:39,449 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 4 states. [2020-10-28 12:00:41,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-28 12:00:41,331 INFO L93 Difference]: Finished difference Result 586 states and 1013 transitions. [2020-10-28 12:00:41,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-28 12:00:41,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-28 12:00:41,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-28 12:00:41,364 INFO L225 Difference]: With dead ends: 586 [2020-10-28 12:00:41,365 INFO L226 Difference]: Without dead ends: 303 [2020-10-28 12:00:41,383 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-28 12:00:41,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-10-28 12:00:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 297. [2020-10-28 12:00:41,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2020-10-28 12:00:41,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 424 transitions. [2020-10-28 12:00:41,486 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 424 transitions. Word has length 24 [2020-10-28 12:00:41,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-28 12:00:41,486 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 424 transitions. [2020-10-28 12:00:41,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-28 12:00:41,487 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 424 transitions. [2020-10-28 12:00:41,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-10-28 12:00:41,492 INFO L414 BasicCegarLoop]: Found error trace [2020-10-28 12:00:41,492 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-28 12:00:41,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-28 12:00:41,493 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-28 12:00:41,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-28 12:00:41,494 INFO L82 PathProgramCache]: Analyzing trace with hash 190287532, now seen corresponding path program 1 times [2020-10-28 12:00:41,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-28 12:00:41,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1855521843] [2020-10-28 12:00:41,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-28 12:00:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-28 12:00:41,559 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:41,758 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:42,316 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:42,428 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-28 12:00:42,428 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 108 [2020-10-28 12:00:42,428 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-28 12:00:42,429 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 892 [2020-10-28 12:00:42,430 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-28 12:00:42,430 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-10-28 12:00:42,430 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-28 12:00:42,430 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-28 12:00:42,430 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-10-28 12:00:42,431 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-28 12:00:42,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-28 12:00:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-28 12:00:42,591 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:42,611 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-28 12:00:42,612 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-28 12:00:42,612 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-28 12:00:42,612 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 23 [2020-10-28 12:00:42,612 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-28 12:00:42,613 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-10-28 12:00:42,613 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-28 12:00:42,614 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-28 12:00:42,614 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-28 12:00:42,614 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-28 12:00:42,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-28 12:00:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-28 12:00:42,677 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:42,793 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-28 12:00:42,794 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 73 [2020-10-28 12:00:42,794 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-28 12:00:42,794 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 134 [2020-10-28 12:00:42,795 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-28 12:00:42,795 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-10-28 12:00:42,795 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-28 12:00:42,796 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-28 12:00:42,796 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 73 [2020-10-28 12:00:42,796 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-28 12:00:42,887 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-28 12:00:42,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1855521843] [2020-10-28 12:00:42,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-28 12:00:42,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-28 12:00:42,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380798099] [2020-10-28 12:00:42,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-28 12:00:42,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-28 12:00:42,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-28 12:00:42,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-28 12:00:42,894 INFO L87 Difference]: Start difference. First operand 297 states and 424 transitions. Second operand 7 states. [2020-10-28 12:00:44,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-28 12:00:44,994 INFO L93 Difference]: Finished difference Result 908 states and 1332 transitions. [2020-10-28 12:00:44,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-28 12:00:44,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2020-10-28 12:00:44,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-28 12:00:45,010 INFO L225 Difference]: With dead ends: 908 [2020-10-28 12:00:45,010 INFO L226 Difference]: Without dead ends: 617 [2020-10-28 12:00:45,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-28 12:00:45,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-10-28 12:00:45,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 597. [2020-10-28 12:00:45,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2020-10-28 12:00:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 769 transitions. [2020-10-28 12:00:45,073 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 769 transitions. Word has length 96 [2020-10-28 12:00:45,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-28 12:00:45,074 INFO L481 AbstractCegarLoop]: Abstraction has 597 states and 769 transitions. [2020-10-28 12:00:45,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-28 12:00:45,074 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 769 transitions. [2020-10-28 12:00:45,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-10-28 12:00:45,079 INFO L414 BasicCegarLoop]: Found error trace [2020-10-28 12:00:45,079 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-28 12:00:45,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-28 12:00:45,080 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-28 12:00:45,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-28 12:00:45,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1669888048, now seen corresponding path program 1 times [2020-10-28 12:00:45,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-28 12:00:45,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [902985121] [2020-10-28 12:00:45,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-28 12:00:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-28 12:00:45,140 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:45,346 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-28 12:00:45,346 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 115 [2020-10-28 12:00:45,346 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-28 12:00:45,346 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 225 [2020-10-28 12:00:45,347 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-28 12:00:45,347 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-10-28 12:00:45,347 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-28 12:00:45,347 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-28 12:00:45,347 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 22 [2020-10-28 12:00:45,347 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-28 12:00:45,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-28 12:00:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-28 12:00:45,448 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:45,453 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-28 12:00:45,456 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-28 12:00:45,456 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-28 12:00:45,456 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 11 [2020-10-28 12:00:45,457 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-28 12:00:45,457 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-10-28 12:00:45,457 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-28 12:00:45,457 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-28 12:00:45,457 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-28 12:00:45,457 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-28 12:00:45,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-28 12:00:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-28 12:00:45,553 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:45,617 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-28 12:00:45,618 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-28 12:00:45,618 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-28 12:00:45,618 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 107 [2020-10-28 12:00:45,618 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-28 12:00:45,619 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-10-28 12:00:45,619 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-28 12:00:45,619 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-28 12:00:45,619 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-28 12:00:45,619 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-28 12:00:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-28 12:00:45,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [902985121] [2020-10-28 12:00:45,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-28 12:00:45,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-28 12:00:45,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782955315] [2020-10-28 12:00:45,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-28 12:00:45,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-28 12:00:45,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-28 12:00:45,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-28 12:00:45,673 INFO L87 Difference]: Start difference. First operand 597 states and 769 transitions. Second operand 5 states. [2020-10-28 12:00:47,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-28 12:00:47,343 INFO L93 Difference]: Finished difference Result 1194 states and 1548 transitions. [2020-10-28 12:00:47,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-28 12:00:47,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2020-10-28 12:00:47,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-28 12:00:47,355 INFO L225 Difference]: With dead ends: 1194 [2020-10-28 12:00:47,356 INFO L226 Difference]: Without dead ends: 603 [2020-10-28 12:00:47,358 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-28 12:00:47,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-10-28 12:00:47,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 597. [2020-10-28 12:00:47,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2020-10-28 12:00:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 750 transitions. [2020-10-28 12:00:47,401 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 750 transitions. Word has length 103 [2020-10-28 12:00:47,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-28 12:00:47,402 INFO L481 AbstractCegarLoop]: Abstraction has 597 states and 750 transitions. [2020-10-28 12:00:47,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-28 12:00:47,402 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 750 transitions. [2020-10-28 12:00:47,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-10-28 12:00:47,409 INFO L414 BasicCegarLoop]: Found error trace [2020-10-28 12:00:47,409 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-28 12:00:47,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-28 12:00:47,410 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-28 12:00:47,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-28 12:00:47,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1146351644, now seen corresponding path program 1 times [2020-10-28 12:00:47,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-28 12:00:47,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [746487649] [2020-10-28 12:00:47,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-28 12:00:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-28 12:00:47,489 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:47,864 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:48,721 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-28 12:00:48,727 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 153 [2020-10-28 12:00:48,728 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-28 12:00:48,728 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1263 [2020-10-28 12:00:48,728 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-28 12:00:48,728 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-10-28 12:00:48,728 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-28 12:00:48,728 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-28 12:00:48,729 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 123 [2020-10-28 12:00:48,729 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-28 12:00:48,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-28 12:00:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-28 12:00:48,857 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:48,880 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-28 12:00:48,881 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-28 12:00:48,881 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-28 12:00:48,884 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 33 [2020-10-28 12:00:48,884 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-28 12:00:48,885 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-10-28 12:00:48,885 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-28 12:00:48,885 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-28 12:00:48,885 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-28 12:00:48,885 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-28 12:00:48,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-28 12:00:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-28 12:00:48,983 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:49,190 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-28 12:00:49,190 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 118 [2020-10-28 12:00:49,190 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-28 12:00:49,190 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 227 [2020-10-28 12:00:49,191 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-28 12:00:49,192 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-10-28 12:00:49,193 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-28 12:00:49,193 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-28 12:00:49,193 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 118 [2020-10-28 12:00:49,193 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-28 12:00:49,418 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-28 12:00:49,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [746487649] [2020-10-28 12:00:49,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-28 12:00:49,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-28 12:00:49,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875983252] [2020-10-28 12:00:49,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-28 12:00:49,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-28 12:00:49,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-28 12:00:49,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-28 12:00:49,428 INFO L87 Difference]: Start difference. First operand 597 states and 750 transitions. Second operand 7 states. [2020-10-28 12:00:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-28 12:00:51,278 INFO L93 Difference]: Finished difference Result 1351 states and 1679 transitions. [2020-10-28 12:00:51,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-28 12:00:51,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2020-10-28 12:00:51,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-28 12:00:51,285 INFO L225 Difference]: With dead ends: 1351 [2020-10-28 12:00:51,285 INFO L226 Difference]: Without dead ends: 760 [2020-10-28 12:00:51,288 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-10-28 12:00:51,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2020-10-28 12:00:51,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 746. [2020-10-28 12:00:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2020-10-28 12:00:51,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 908 transitions. [2020-10-28 12:00:51,317 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 908 transitions. Word has length 141 [2020-10-28 12:00:51,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-28 12:00:51,317 INFO L481 AbstractCegarLoop]: Abstraction has 746 states and 908 transitions. [2020-10-28 12:00:51,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-28 12:00:51,318 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 908 transitions. [2020-10-28 12:00:51,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-10-28 12:00:51,322 INFO L414 BasicCegarLoop]: Found error trace [2020-10-28 12:00:51,322 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-28 12:00:51,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-28 12:00:51,322 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-28 12:00:51,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-28 12:00:51,323 INFO L82 PathProgramCache]: Analyzing trace with hash -124168792, now seen corresponding path program 1 times [2020-10-28 12:00:51,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-28 12:00:51,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2039606430] [2020-10-28 12:00:51,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-28 12:00:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-28 12:00:51,394 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:51,590 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:52,316 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-28 12:00:52,316 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 189 [2020-10-28 12:00:52,316 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-28 12:00:52,316 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 949 [2020-10-28 12:00:52,317 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-28 12:00:52,317 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-10-28 12:00:52,317 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-28 12:00:52,317 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-28 12:00:52,317 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 84 [2020-10-28 12:00:52,317 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-28 12:00:52,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-28 12:00:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-28 12:00:52,423 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:52,430 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-28 12:00:52,431 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-28 12:00:52,431 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-28 12:00:52,431 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-10-28 12:00:52,431 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-28 12:00:52,431 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-10-28 12:00:52,432 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-28 12:00:52,432 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-28 12:00:52,432 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-28 12:00:52,432 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-28 12:00:52,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-28 12:00:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-28 12:00:52,469 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:52,513 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-28 12:00:52,514 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-28 12:00:52,514 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-28 12:00:52,514 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 52 [2020-10-28 12:00:52,514 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-28 12:00:52,514 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-10-28 12:00:52,514 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-28 12:00:52,515 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-28 12:00:52,515 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-28 12:00:52,515 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-28 12:00:52,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-28 12:00:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-28 12:00:52,566 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:52,746 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-28 12:00:52,747 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 82 [2020-10-28 12:00:52,751 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-28 12:00:52,751 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 192 [2020-10-28 12:00:52,752 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-28 12:00:52,752 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-10-28 12:00:52,752 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-28 12:00:52,752 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-28 12:00:52,753 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 82 [2020-10-28 12:00:52,753 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-28 12:00:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 99 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-28 12:00:52,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2039606430] [2020-10-28 12:00:52,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-28 12:00:52,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-28 12:00:52,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216392224] [2020-10-28 12:00:52,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-28 12:00:52,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-28 12:00:52,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-28 12:00:52,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-28 12:00:52,856 INFO L87 Difference]: Start difference. First operand 746 states and 908 transitions. Second operand 7 states. [2020-10-28 12:00:55,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-28 12:00:55,081 INFO L93 Difference]: Finished difference Result 1673 states and 2182 transitions. [2020-10-28 12:00:55,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-28 12:00:55,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 175 [2020-10-28 12:00:55,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-28 12:00:55,092 INFO L225 Difference]: With dead ends: 1673 [2020-10-28 12:00:55,093 INFO L226 Difference]: Without dead ends: 1076 [2020-10-28 12:00:55,095 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-28 12:00:55,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2020-10-28 12:00:55,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 899. [2020-10-28 12:00:55,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2020-10-28 12:00:55,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1079 transitions. [2020-10-28 12:00:55,137 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1079 transitions. Word has length 175 [2020-10-28 12:00:55,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-28 12:00:55,138 INFO L481 AbstractCegarLoop]: Abstraction has 899 states and 1079 transitions. [2020-10-28 12:00:55,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-28 12:00:55,138 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1079 transitions. [2020-10-28 12:00:55,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-10-28 12:00:55,141 INFO L414 BasicCegarLoop]: Found error trace [2020-10-28 12:00:55,142 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-28 12:00:55,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-28 12:00:55,142 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-28 12:00:55,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-28 12:00:55,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1588953000, now seen corresponding path program 1 times [2020-10-28 12:00:55,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-28 12:00:55,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [726229860] [2020-10-28 12:00:55,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-28 12:00:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-28 12:00:55,209 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:55,271 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:55,763 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:56,140 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-28 12:00:56,141 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 198 [2020-10-28 12:00:56,141 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-28 12:00:56,141 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 955 [2020-10-28 12:00:56,141 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-28 12:00:56,141 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-10-28 12:00:56,141 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-28 12:00:56,142 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-28 12:00:56,142 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 84 [2020-10-28 12:00:56,142 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-28 12:00:56,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-28 12:00:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-28 12:00:56,252 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:56,259 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-28 12:00:56,260 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-28 12:00:56,260 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-28 12:00:56,260 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-10-28 12:00:56,261 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-28 12:00:56,261 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-10-28 12:00:56,261 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-28 12:00:56,261 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-28 12:00:56,263 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-28 12:00:56,263 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-28 12:00:56,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-28 12:00:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-28 12:00:56,325 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:56,374 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-28 12:00:56,374 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-28 12:00:56,374 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-28 12:00:56,375 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 58 [2020-10-28 12:00:56,375 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-28 12:00:56,375 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-10-28 12:00:56,375 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-28 12:00:56,375 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-28 12:00:56,375 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-28 12:00:56,376 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-28 12:00:56,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-28 12:00:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-28 12:00:56,445 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-28 12:00:56,531 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-28 12:00:56,531 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 82 [2020-10-28 12:00:56,531 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-28 12:00:56,531 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 94 [2020-10-28 12:00:56,531 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-28 12:00:56,532 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-10-28 12:00:56,532 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-28 12:00:56,532 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-28 12:00:56,532 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 82 [2020-10-28 12:00:56,532 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-28 12:00:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-28 12:00:56,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [726229860] [2020-10-28 12:00:56,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-28 12:00:56,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-28 12:00:56,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272842033] [2020-10-28 12:00:56,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-28 12:00:56,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-28 12:00:56,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-28 12:00:56,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-28 12:00:56,674 INFO L87 Difference]: Start difference. First operand 899 states and 1079 transitions. Second operand 8 states. [2020-10-28 12:00:59,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-28 12:00:59,550 INFO L93 Difference]: Finished difference Result 2102 states and 2574 transitions. [2020-10-28 12:00:59,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-28 12:00:59,551 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 184 [2020-10-28 12:00:59,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-28 12:00:59,557 INFO L225 Difference]: With dead ends: 2102 [2020-10-28 12:00:59,558 INFO L226 Difference]: Without dead ends: 1052 [2020-10-28 12:00:59,561 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-10-28 12:00:59,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2020-10-28 12:00:59,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1044. [2020-10-28 12:00:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1044 states. [2020-10-28 12:00:59,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1139 transitions. [2020-10-28 12:00:59,597 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1139 transitions. Word has length 184 [2020-10-28 12:00:59,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-28 12:00:59,597 INFO L481 AbstractCegarLoop]: Abstraction has 1044 states and 1139 transitions. [2020-10-28 12:00:59,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-28 12:00:59,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1139 transitions. [2020-10-28 12:00:59,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2020-10-28 12:00:59,601 INFO L414 BasicCegarLoop]: Found error trace [2020-10-28 12:00:59,601 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 12:00:59,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-28 12:00:59,601 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-28 12:00:59,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-28 12:00:59,602 INFO L82 PathProgramCache]: Analyzing trace with hash 540824416, now seen corresponding path program 1 times [2020-10-28 12:00:59,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-28 12:00:59,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [556021454] [2020-10-28 12:00:59,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-28 12:00:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-28 12:00:59,648 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-28 12:00:59,648 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-28 12:00:59,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-28 12:00:59,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 12:00:59 BoogieIcfgContainer [2020-10-28 12:00:59,692 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-28 12:00:59,695 INFO L168 Benchmark]: Toolchain (without parser) took 23824.93 ms. Allocated memory was 151.0 MB in the beginning and 448.8 MB in the end (delta: 297.8 MB). Free memory was 124.9 MB in the beginning and 213.4 MB in the end (delta: -88.5 MB). Peak memory consumption was 210.0 MB. Max. memory is 8.0 GB. [2020-10-28 12:00:59,695 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 151.0 MB. Free memory was 123.4 MB in the beginning and 123.3 MB in the end (delta: 80.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-28 12:00:59,696 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.53 ms. Allocated memory is still 151.0 MB. Free memory was 124.2 MB in the beginning and 130.1 MB in the end (delta: -5.9 MB). Peak memory consumption was 30.1 MB. Max. memory is 8.0 GB. [2020-10-28 12:00:59,697 INFO L168 Benchmark]: Boogie Preprocessor took 110.30 ms. Allocated memory is still 151.0 MB. Free memory was 130.1 MB in the beginning and 125.4 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-10-28 12:00:59,698 INFO L168 Benchmark]: RCFGBuilder took 1446.67 ms. Allocated memory is still 151.0 MB. Free memory was 125.4 MB in the beginning and 104.1 MB in the end (delta: 21.3 MB). Peak memory consumption was 82.8 MB. Max. memory is 8.0 GB. [2020-10-28 12:00:59,699 INFO L168 Benchmark]: TraceAbstraction took 21482.39 ms. Allocated memory was 151.0 MB in the beginning and 448.8 MB in the end (delta: 297.8 MB). Free memory was 104.1 MB in the beginning and 213.4 MB in the end (delta: -109.3 MB). Peak memory consumption was 188.5 MB. Max. memory is 8.0 GB. [2020-10-28 12:00:59,702 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 151.0 MB. Free memory was 123.4 MB in the beginning and 123.3 MB in the end (delta: 80.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 767.53 ms. Allocated memory is still 151.0 MB. Free memory was 124.2 MB in the beginning and 130.1 MB in the end (delta: -5.9 MB). Peak memory consumption was 30.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 110.30 ms. Allocated memory is still 151.0 MB. Free memory was 130.1 MB in the beginning and 125.4 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1446.67 ms. Allocated memory is still 151.0 MB. Free memory was 125.4 MB in the beginning and 104.1 MB in the end (delta: 21.3 MB). Peak memory consumption was 82.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 21482.39 ms. Allocated memory was 151.0 MB in the beginning and 448.8 MB in the end (delta: 297.8 MB). Free memory was 104.1 MB in the beginning and 213.4 MB in the end (delta: -109.3 MB). Peak memory consumption was 188.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] int inputC = 3; [L10] int inputD = 4; [L11] int inputE = 5; [L12] int inputF = 6; [L13] int inputB = 2; [L16] int a1 = 23; [L17] int a19 = 9; [L18] int a10 = 0; [L19] int a12 = 0; [L20] int a4 = 14; [L581] int output = -1; [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL, EXPR calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L212] COND TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L213] a1 = (((a1 + -15535) - 211896) / 5) [L214] a10 = 2 [L216] return 22; [L592] RET, EXPR calculate_output(input) [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL, EXPR calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L212] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L217] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L222] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L227] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L233] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L238] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L241] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L246] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L251] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L256] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L262] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L267] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L273] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L279] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L285] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L288] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L293] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L298] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L303] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L308] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L314] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L319] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L322] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L325] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L328] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L331] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L337] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L342] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L347] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L353] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L356] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L359] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L362] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L367] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L372] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L377] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L380] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L385] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L390] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L395] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L400] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L405] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L410] COND TRUE ((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2)))) [L411] a1 = ((((a1 % 299890)+ 300108) * 1) * 1) [L412] a10 = 0 [L413] a19 = 8 [L415] return -1; [L592] RET, EXPR calculate_output(input) [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND TRUE (((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) [L57] CALL reach_error() [L4] __assert_fail("0", "Problem10_label42.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 219 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.3s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 149 SDtfs, 2451 SDslu, 166 SDs, 0 SdLazy, 5416 SolverSat, 962 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1044occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 231 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 929 NumberOfCodeBlocks, 929 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 717 ConstructedInterpolants, 0 QuantifiedInterpolants, 396848 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 256/261 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...