/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 10:25:17,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 10:25:17,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 10:25:17,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 10:25:17,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 10:25:17,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 10:25:17,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 10:25:17,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 10:25:17,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 10:25:17,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 10:25:17,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 10:25:17,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 10:25:17,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 10:25:17,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 10:25:17,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 10:25:17,970 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 10:25:17,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 10:25:17,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 10:25:17,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 10:25:17,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 10:25:17,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 10:25:17,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 10:25:17,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 10:25:17,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 10:25:17,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 10:25:17,983 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 10:25:17,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 10:25:17,984 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 10:25:17,985 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 10:25:17,986 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 10:25:17,986 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 10:25:17,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 10:25:17,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 10:25:17,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 10:25:17,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 10:25:17,990 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 10:25:17,991 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 10:25:17,991 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 10:25:17,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 10:25:17,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 10:25:17,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 10:25:17,996 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-21 10:25:18,024 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 10:25:18,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 10:25:18,025 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 10:25:18,026 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 10:25:18,026 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 10:25:18,026 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 10:25:18,026 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 10:25:18,027 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 10:25:18,027 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 10:25:18,027 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 10:25:18,027 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 10:25:18,027 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 10:25:18,028 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 10:25:18,028 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 10:25:18,028 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 10:25:18,028 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 10:25:18,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 10:25:18,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 10:25:18,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 10:25:18,029 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 10:25:18,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 10:25:18,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:25:18,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 10:25:18,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 10:25:18,030 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 10:25:18,030 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 10:25:18,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 10:25:18,031 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 10:25:18,031 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 10:25:18,031 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-09-21 10:25:18,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 10:25:18,488 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 10:25:18,494 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 10:25:18,496 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 10:25:18,496 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 10:25:18,499 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42.c [2020-09-21 10:25:18,596 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/66afd8149/03ba5d42260841f99bece7cc47eea9a3/FLAGac8378a10 [2020-09-21 10:25:19,249 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 10:25:19,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label42.c [2020-09-21 10:25:19,267 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/66afd8149/03ba5d42260841f99bece7cc47eea9a3/FLAGac8378a10 [2020-09-21 10:25:19,503 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/66afd8149/03ba5d42260841f99bece7cc47eea9a3 [2020-09-21 10:25:19,520 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 10:25:19,526 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 10:25:19,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 10:25:19,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 10:25:19,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 10:25:19,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:25:19" (1/1) ... [2020-09-21 10:25:19,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bc51459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:25:19, skipping insertion in model container [2020-09-21 10:25:19,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:25:19" (1/1) ... [2020-09-21 10:25:19,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 10:25:19,597 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 10:25:20,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:25:20,091 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 10:25:20,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:25:20,324 INFO L208 MainTranslator]: Completed translation [2020-09-21 10:25:20,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:25:20 WrapperNode [2020-09-21 10:25:20,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 10:25:20,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 10:25:20,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 10:25:20,329 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 10:25:20,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:25:20" (1/1) ... [2020-09-21 10:25:20,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:25:20" (1/1) ... [2020-09-21 10:25:20,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:25:20" (1/1) ... [2020-09-21 10:25:20,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:25:20" (1/1) ... [2020-09-21 10:25:20,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:25:20" (1/1) ... [2020-09-21 10:25:20,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:25:20" (1/1) ... [2020-09-21 10:25:20,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:25:20" (1/1) ... [2020-09-21 10:25:20,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 10:25:20,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 10:25:20,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 10:25:20,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 10:25:20,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:25:20" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:25:20,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 10:25:20,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 10:25:20,549 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-21 10:25:20,549 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 10:25:20,549 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-21 10:25:20,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 10:25:20,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-21 10:25:20,551 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-21 10:25:20,551 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 10:25:20,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 10:25:20,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 10:25:21,906 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 10:25:21,906 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-21 10:25:21,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:25:21 BoogieIcfgContainer [2020-09-21 10:25:21,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 10:25:21,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 10:25:21,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 10:25:21,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 10:25:21,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 10:25:19" (1/3) ... [2020-09-21 10:25:21,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6671493f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:25:21, skipping insertion in model container [2020-09-21 10:25:21,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:25:20" (2/3) ... [2020-09-21 10:25:21,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6671493f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:25:21, skipping insertion in model container [2020-09-21 10:25:21,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:25:21" (3/3) ... [2020-09-21 10:25:21,933 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label42.c [2020-09-21 10:25:21,951 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 10:25:21,964 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 10:25:21,993 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 10:25:22,034 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 10:25:22,034 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 10:25:22,034 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 10:25:22,034 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 10:25:22,035 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 10:25:22,035 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 10:25:22,035 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 10:25:22,035 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 10:25:22,070 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-09-21 10:25:22,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-21 10:25:22,080 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:25:22,082 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] [2020-09-21 10:25:22,082 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:25:22,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:25:22,093 INFO L82 PathProgramCache]: Analyzing trace with hash -42109674, now seen corresponding path program 1 times [2020-09-21 10:25:22,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:25:22,111 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [603310394] [2020-09-21 10:25:22,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:25:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:22,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:25:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:22,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:25:22,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [603310394] [2020-09-21 10:25:22,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:25:22,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:25:22,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799938569] [2020-09-21 10:25:22,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-21 10:25:22,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:25:22,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-21 10:25:22,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:25:22,586 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 4 states. [2020-09-21 10:25:24,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:25:24,199 INFO L93 Difference]: Finished difference Result 596 states and 1021 transitions. [2020-09-21 10:25:24,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:25:24,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-09-21 10:25:24,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:25:24,237 INFO L225 Difference]: With dead ends: 596 [2020-09-21 10:25:24,237 INFO L226 Difference]: Without dead ends: 302 [2020-09-21 10:25:24,250 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:25:24,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-09-21 10:25:24,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2020-09-21 10:25:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2020-09-21 10:25:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 430 transitions. [2020-09-21 10:25:24,368 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 430 transitions. Word has length 23 [2020-09-21 10:25:24,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:25:24,368 INFO L479 AbstractCegarLoop]: Abstraction has 298 states and 430 transitions. [2020-09-21 10:25:24,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-21 10:25:24,369 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 430 transitions. [2020-09-21 10:25:24,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-09-21 10:25:24,374 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:25:24,374 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] [2020-09-21 10:25:24,375 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 10:25:24,375 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:25:24,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:25:24,375 INFO L82 PathProgramCache]: Analyzing trace with hash 547923706, now seen corresponding path program 1 times [2020-09-21 10:25:24,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:25:24,376 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [150926715] [2020-09-21 10:25:24,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:25:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:24,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:25:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:24,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:25:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:24,803 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:25:24,804 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [150926715] [2020-09-21 10:25:24,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:25:24,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-21 10:25:24,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326811754] [2020-09-21 10:25:24,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:25:24,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:25:24,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:25:24,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:25:24,808 INFO L87 Difference]: Start difference. First operand 298 states and 430 transitions. Second operand 8 states. [2020-09-21 10:25:27,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:25:27,119 INFO L93 Difference]: Finished difference Result 1198 states and 1805 transitions. [2020-09-21 10:25:27,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-21 10:25:27,120 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2020-09-21 10:25:27,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:25:27,130 INFO L225 Difference]: With dead ends: 1198 [2020-09-21 10:25:27,130 INFO L226 Difference]: Without dead ends: 906 [2020-09-21 10:25:27,133 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-09-21 10:25:27,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2020-09-21 10:25:27,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 894. [2020-09-21 10:25:27,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2020-09-21 10:25:27,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1232 transitions. [2020-09-21 10:25:27,218 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1232 transitions. Word has length 97 [2020-09-21 10:25:27,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:25:27,219 INFO L479 AbstractCegarLoop]: Abstraction has 894 states and 1232 transitions. [2020-09-21 10:25:27,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:25:27,219 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1232 transitions. [2020-09-21 10:25:27,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-09-21 10:25:27,232 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:25:27,233 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] [2020-09-21 10:25:27,234 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 10:25:27,234 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:25:27,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:25:27,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1249958265, now seen corresponding path program 1 times [2020-09-21 10:25:27,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:25:27,237 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1776213707] [2020-09-21 10:25:27,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:25:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:27,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:25:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:27,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:25:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:27,553 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:25:27,555 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1776213707] [2020-09-21 10:25:27,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:25:27,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-21 10:25:27,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669796842] [2020-09-21 10:25:27,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:25:27,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:25:27,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:25:27,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:25:27,563 INFO L87 Difference]: Start difference. First operand 894 states and 1232 transitions. Second operand 8 states. [2020-09-21 10:25:29,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:25:29,722 INFO L93 Difference]: Finished difference Result 2080 states and 2940 transitions. [2020-09-21 10:25:29,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 10:25:29,727 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2020-09-21 10:25:29,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:25:29,739 INFO L225 Difference]: With dead ends: 2080 [2020-09-21 10:25:29,739 INFO L226 Difference]: Without dead ends: 1192 [2020-09-21 10:25:29,742 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:25:29,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-09-21 10:25:29,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1188. [2020-09-21 10:25:29,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1188 states. [2020-09-21 10:25:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1482 transitions. [2020-09-21 10:25:29,785 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1482 transitions. Word has length 102 [2020-09-21 10:25:29,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:25:29,786 INFO L479 AbstractCegarLoop]: Abstraction has 1188 states and 1482 transitions. [2020-09-21 10:25:29,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:25:29,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1482 transitions. [2020-09-21 10:25:29,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-21 10:25:29,789 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:25:29,789 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] [2020-09-21 10:25:29,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 10:25:29,790 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:25:29,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:25:29,790 INFO L82 PathProgramCache]: Analyzing trace with hash -99512690, now seen corresponding path program 1 times [2020-09-21 10:25:29,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:25:29,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1120979673] [2020-09-21 10:25:29,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:25:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:29,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:25:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:29,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:25:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:30,104 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:25:30,105 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1120979673] [2020-09-21 10:25:30,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:25:30,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-21 10:25:30,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361388815] [2020-09-21 10:25:30,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:25:30,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:25:30,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:25:30,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:25:30,110 INFO L87 Difference]: Start difference. First operand 1188 states and 1482 transitions. Second operand 8 states. [2020-09-21 10:25:31,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:25:31,834 INFO L93 Difference]: Finished difference Result 3008 states and 3961 transitions. [2020-09-21 10:25:31,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 10:25:31,835 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2020-09-21 10:25:31,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:25:31,847 INFO L225 Difference]: With dead ends: 3008 [2020-09-21 10:25:31,847 INFO L226 Difference]: Without dead ends: 1826 [2020-09-21 10:25:31,852 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-09-21 10:25:31,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2020-09-21 10:25:31,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1776. [2020-09-21 10:25:31,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2020-09-21 10:25:31,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2206 transitions. [2020-09-21 10:25:31,920 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2206 transitions. Word has length 123 [2020-09-21 10:25:31,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:25:31,921 INFO L479 AbstractCegarLoop]: Abstraction has 1776 states and 2206 transitions. [2020-09-21 10:25:31,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:25:31,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2206 transitions. [2020-09-21 10:25:31,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-09-21 10:25:31,924 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:25:31,924 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] [2020-09-21 10:25:31,924 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 10:25:31,924 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:25:31,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:25:31,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1701421403, now seen corresponding path program 1 times [2020-09-21 10:25:31,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:25:31,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2034555749] [2020-09-21 10:25:31,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:25:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:32,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:25:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:32,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:25:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:32,202 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:25:32,203 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2034555749] [2020-09-21 10:25:32,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:25:32,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-21 10:25:32,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904549179] [2020-09-21 10:25:32,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:25:32,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:25:32,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:25:32,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:25:32,205 INFO L87 Difference]: Start difference. First operand 1776 states and 2206 transitions. Second operand 7 states. [2020-09-21 10:25:33,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:25:33,665 INFO L93 Difference]: Finished difference Result 3725 states and 4639 transitions. [2020-09-21 10:25:33,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 10:25:33,666 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2020-09-21 10:25:33,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:25:33,677 INFO L225 Difference]: With dead ends: 3725 [2020-09-21 10:25:33,677 INFO L226 Difference]: Without dead ends: 1955 [2020-09-21 10:25:33,682 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:25:33,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2020-09-21 10:25:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1941. [2020-09-21 10:25:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2020-09-21 10:25:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2395 transitions. [2020-09-21 10:25:33,741 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2395 transitions. Word has length 140 [2020-09-21 10:25:33,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:25:33,742 INFO L479 AbstractCegarLoop]: Abstraction has 1941 states and 2395 transitions. [2020-09-21 10:25:33,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:25:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2395 transitions. [2020-09-21 10:25:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-09-21 10:25:33,744 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:25:33,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:25:33,744 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 10:25:33,745 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:25:33,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:25:33,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1059967410, now seen corresponding path program 1 times [2020-09-21 10:25:33,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:25:33,746 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1291868012] [2020-09-21 10:25:33,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:25:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:33,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:25:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:33,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:25:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:34,014 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-21 10:25:34,014 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1291868012] [2020-09-21 10:25:34,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:25:34,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:25:34,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427361543] [2020-09-21 10:25:34,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:25:34,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:25:34,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:25:34,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:25:34,018 INFO L87 Difference]: Start difference. First operand 1941 states and 2395 transitions. Second operand 7 states. [2020-09-21 10:25:36,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:25:36,193 INFO L93 Difference]: Finished difference Result 3109 states and 3927 transitions. [2020-09-21 10:25:36,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 10:25:36,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 157 [2020-09-21 10:25:36,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:25:36,211 INFO L225 Difference]: With dead ends: 3109 [2020-09-21 10:25:36,211 INFO L226 Difference]: Without dead ends: 3107 [2020-09-21 10:25:36,213 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:25:36,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2020-09-21 10:25:36,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 1951. [2020-09-21 10:25:36,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1951 states. [2020-09-21 10:25:36,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 2413 transitions. [2020-09-21 10:25:36,285 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 2413 transitions. Word has length 157 [2020-09-21 10:25:36,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:25:36,286 INFO L479 AbstractCegarLoop]: Abstraction has 1951 states and 2413 transitions. [2020-09-21 10:25:36,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:25:36,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 2413 transitions. [2020-09-21 10:25:36,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2020-09-21 10:25:36,290 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:25:36,290 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] [2020-09-21 10:25:36,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 10:25:36,291 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:25:36,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:25:36,291 INFO L82 PathProgramCache]: Analyzing trace with hash -2040878078, now seen corresponding path program 1 times [2020-09-21 10:25:36,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:25:36,292 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [868494850] [2020-09-21 10:25:36,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:25:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-21 10:25:36,361 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-21 10:25:36,361 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-21 10:25:36,367 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 10:25:36,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 10:25:36 BoogieIcfgContainer [2020-09-21 10:25:36,408 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 10:25:36,412 INFO L168 Benchmark]: Toolchain (without parser) took 16888.85 ms. Allocated memory was 140.5 MB in the beginning and 394.3 MB in the end (delta: 253.8 MB). Free memory was 101.7 MB in the beginning and 310.8 MB in the end (delta: -209.1 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. [2020-09-21 10:25:36,413 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-21 10:25:36,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 800.43 ms. Allocated memory was 140.5 MB in the beginning and 206.6 MB in the end (delta: 66.1 MB). Free memory was 101.0 MB in the beginning and 172.7 MB in the end (delta: -71.6 MB). Peak memory consumption was 33.8 MB. Max. memory is 7.1 GB. [2020-09-21 10:25:36,415 INFO L168 Benchmark]: Boogie Preprocessor took 128.55 ms. Allocated memory is still 206.6 MB. Free memory was 172.7 MB in the beginning and 167.8 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2020-09-21 10:25:36,416 INFO L168 Benchmark]: RCFGBuilder took 1462.68 ms. Allocated memory was 206.6 MB in the beginning and 237.5 MB in the end (delta: 30.9 MB). Free memory was 167.8 MB in the beginning and 180.7 MB in the end (delta: -12.9 MB). Peak memory consumption was 80.9 MB. Max. memory is 7.1 GB. [2020-09-21 10:25:36,417 INFO L168 Benchmark]: TraceAbstraction took 14486.81 ms. Allocated memory was 237.5 MB in the beginning and 394.3 MB in the end (delta: 156.8 MB). Free memory was 180.7 MB in the beginning and 310.8 MB in the end (delta: -130.1 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2020-09-21 10:25:36,420 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 800.43 ms. Allocated memory was 140.5 MB in the beginning and 206.6 MB in the end (delta: 66.1 MB). Free memory was 101.0 MB in the beginning and 172.7 MB in the end (delta: -71.6 MB). Peak memory consumption was 33.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 128.55 ms. Allocated memory is still 206.6 MB. Free memory was 172.7 MB in the beginning and 167.8 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1462.68 ms. Allocated memory was 206.6 MB in the beginning and 237.5 MB in the end (delta: 30.9 MB). Free memory was 167.8 MB in the beginning and 180.7 MB in the end (delta: -12.9 MB). Peak memory consumption was 80.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14486.81 ms. Allocated memory was 237.5 MB in the beginning and 394.3 MB in the end (delta: 156.8 MB). Free memory was 180.7 MB in the beginning and 310.8 MB in the end (delta: -130.1 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 55]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L211] a1 = (((a1 + -15535) - 211896) / 5) [L212] a10 = 2 [L214] return 22; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND TRUE ((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2)))) [L409] a1 = ((((a1 % 299890)+ 300108) * 1) * 1) [L410] a10 = 0 [L411] a19 = 8 [L413] return -1; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND TRUE (((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) [L55] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.3s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 148 SDtfs, 4607 SDslu, 201 SDs, 0 SdLazy, 5536 SolverSat, 1239 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1951occurred 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.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 1240 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 847 NumberOfCodeBlocks, 847 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 636 ConstructedInterpolants, 0 QuantifiedInterpolants, 202158 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 75/80 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...