/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=SHALLOWEST -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label13.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-18 20:20:58,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-18 20:20:58,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-18 20:20:58,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-18 20:20:58,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-18 20:20:58,810 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-18 20:20:58,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-18 20:20:58,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-18 20:20:58,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-18 20:20:58,815 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-18 20:20:58,816 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-18 20:20:58,817 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-18 20:20:58,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-18 20:20:58,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-18 20:20:58,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-18 20:20:58,821 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-18 20:20:58,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-18 20:20:58,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-18 20:20:58,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-18 20:20:58,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-18 20:20:58,827 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-18 20:20:58,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-18 20:20:58,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-18 20:20:58,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-18 20:20:58,833 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-18 20:20:58,833 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-18 20:20:58,833 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-18 20:20:58,834 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-18 20:20:58,835 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-18 20:20:58,836 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-18 20:20:58,836 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-18 20:20:58,837 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-18 20:20:58,837 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-18 20:20:58,838 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-18 20:20:58,839 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-18 20:20:58,840 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-18 20:20:58,840 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-18 20:20:58,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-18 20:20:58,841 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-18 20:20:58,842 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-18 20:20:58,842 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-18 20:20:58,843 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-08-18 20:20:58,868 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-18 20:20:58,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-18 20:20:58,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-18 20:20:58,870 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-18 20:20:58,870 INFO L138 SettingsManager]: * Use SBE=true [2020-08-18 20:20:58,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-18 20:20:58,870 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-18 20:20:58,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-18 20:20:58,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-18 20:20:58,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-18 20:20:58,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-18 20:20:58,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-18 20:20:58,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-18 20:20:58,872 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-18 20:20:58,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-18 20:20:58,872 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-18 20:20:58,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-18 20:20:58,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-18 20:20:58,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-18 20:20:58,873 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-18 20:20:58,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-18 20:20:58,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-18 20:20:58,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-18 20:20:58,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-18 20:20:58,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-18 20:20:58,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-18 20:20:58,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-18 20:20:58,875 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-18 20:20:58,875 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-18 20:20:58,875 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SHALLOWEST; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SHALLOWEST; [2020-08-18 20:20:59,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-18 20:20:59,228 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-18 20:20:59,232 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-18 20:20:59,233 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-18 20:20:59,234 INFO L275 PluginConnector]: CDTParser initialized [2020-08-18 20:20:59,235 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label13.c [2020-08-18 20:20:59,301 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cdf530407/276bf1805bb84fd8a189c90307c6353e/FLAG8fe91bb6c [2020-08-18 20:20:59,835 INFO L306 CDTParser]: Found 1 translation units. [2020-08-18 20:20:59,835 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem02_label13.c [2020-08-18 20:20:59,850 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cdf530407/276bf1805bb84fd8a189c90307c6353e/FLAG8fe91bb6c [2020-08-18 20:21:00,099 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cdf530407/276bf1805bb84fd8a189c90307c6353e [2020-08-18 20:21:00,109 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-18 20:21:00,111 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-18 20:21:00,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-18 20:21:00,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-18 20:21:00,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-18 20:21:00,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 08:21:00" (1/1) ... [2020-08-18 20:21:00,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ca24e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 08:21:00, skipping insertion in model container [2020-08-18 20:21:00,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 08:21:00" (1/1) ... [2020-08-18 20:21:00,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-18 20:21:00,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-18 20:21:00,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 20:21:00,616 INFO L203 MainTranslator]: Completed pre-run [2020-08-18 20:21:00,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 20:21:00,877 INFO L208 MainTranslator]: Completed translation [2020-08-18 20:21:00,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 08:21:00 WrapperNode [2020-08-18 20:21:00,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-18 20:21:00,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-18 20:21:00,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-18 20:21:00,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-18 20:21:00,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 08:21:00" (1/1) ... [2020-08-18 20:21:00,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 08:21:00" (1/1) ... [2020-08-18 20:21:00,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 08:21:00" (1/1) ... [2020-08-18 20:21:00,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 08:21:00" (1/1) ... [2020-08-18 20:21:00,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 08:21:00" (1/1) ... [2020-08-18 20:21:00,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 08:21:00" (1/1) ... [2020-08-18 20:21:01,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 08:21:00" (1/1) ... [2020-08-18 20:21:01,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-18 20:21:01,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-18 20:21:01,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-18 20:21:01,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-18 20:21:01,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 08:21:00" (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-08-18 20:21:01,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-18 20:21:01,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-18 20:21:01,111 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-08-18 20:21:01,112 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-18 20:21:01,112 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-08-18 20:21:01,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-18 20:21:01,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-18 20:21:01,113 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-08-18 20:21:01,113 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-18 20:21:01,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-18 20:21:01,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-18 20:21:02,332 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-18 20:21:02,333 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-18 20:21:02,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 08:21:02 BoogieIcfgContainer [2020-08-18 20:21:02,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-18 20:21:02,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-18 20:21:02,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-18 20:21:02,345 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-18 20:21:02,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.08 08:21:00" (1/3) ... [2020-08-18 20:21:02,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe0685a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 08:21:02, skipping insertion in model container [2020-08-18 20:21:02,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 08:21:00" (2/3) ... [2020-08-18 20:21:02,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe0685a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 08:21:02, skipping insertion in model container [2020-08-18 20:21:02,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 08:21:02" (3/3) ... [2020-08-18 20:21:02,350 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label13.c [2020-08-18 20:21:02,361 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-18 20:21:02,369 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-18 20:21:02,385 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-18 20:21:02,411 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-18 20:21:02,411 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-18 20:21:02,411 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-18 20:21:02,411 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-18 20:21:02,412 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-18 20:21:02,412 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-18 20:21:02,412 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-18 20:21:02,412 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-18 20:21:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2020-08-18 20:21:02,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-08-18 20:21:02,448 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 20:21:02,449 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-18 20:21:02,449 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 20:21:02,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 20:21:02,456 INFO L82 PathProgramCache]: Analyzing trace with hash -807098266, now seen corresponding path program 1 times [2020-08-18 20:21:02,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 20:21:02,466 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1916918913] [2020-08-18 20:21:02,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 20:21:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:02,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 20:21:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 20:21:03,074 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1916918913] [2020-08-18 20:21:03,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 20:21:03,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-08-18 20:21:03,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209908128] [2020-08-18 20:21:03,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 20:21:03,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 20:21:03,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 20:21:03,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-18 20:21:03,099 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 5 states. [2020-08-18 20:21:05,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 20:21:05,383 INFO L93 Difference]: Finished difference Result 813 states and 1406 transitions. [2020-08-18 20:21:05,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 20:21:05,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2020-08-18 20:21:05,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 20:21:05,407 INFO L225 Difference]: With dead ends: 813 [2020-08-18 20:21:05,407 INFO L226 Difference]: Without dead ends: 488 [2020-08-18 20:21:05,416 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-08-18 20:21:05,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2020-08-18 20:21:05,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 481. [2020-08-18 20:21:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2020-08-18 20:21:05,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 692 transitions. [2020-08-18 20:21:05,541 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 692 transitions. Word has length 92 [2020-08-18 20:21:05,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 20:21:05,542 INFO L479 AbstractCegarLoop]: Abstraction has 481 states and 692 transitions. [2020-08-18 20:21:05,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 20:21:05,542 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 692 transitions. [2020-08-18 20:21:05,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-08-18 20:21:05,549 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 20:21:05,549 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-08-18 20:21:05,550 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-18 20:21:05,550 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 20:21:05,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 20:21:05,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1327241471, now seen corresponding path program 1 times [2020-08-18 20:21:05,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 20:21:05,555 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1941144466] [2020-08-18 20:21:05,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 20:21:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:05,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 20:21:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:05,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 20:21:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 20:21:05,783 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1941144466] [2020-08-18 20:21:05,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 20:21:05,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-18 20:21:05,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646266647] [2020-08-18 20:21:05,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 20:21:05,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 20:21:05,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 20:21:05,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-18 20:21:05,787 INFO L87 Difference]: Start difference. First operand 481 states and 692 transitions. Second operand 5 states. [2020-08-18 20:21:07,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 20:21:07,090 INFO L93 Difference]: Finished difference Result 1402 states and 2060 transitions. [2020-08-18 20:21:07,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 20:21:07,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2020-08-18 20:21:07,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 20:21:07,102 INFO L225 Difference]: With dead ends: 1402 [2020-08-18 20:21:07,103 INFO L226 Difference]: Without dead ends: 927 [2020-08-18 20:21:07,105 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-08-18 20:21:07,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2020-08-18 20:21:07,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 920. [2020-08-18 20:21:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2020-08-18 20:21:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1270 transitions. [2020-08-18 20:21:07,162 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1270 transitions. Word has length 100 [2020-08-18 20:21:07,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 20:21:07,162 INFO L479 AbstractCegarLoop]: Abstraction has 920 states and 1270 transitions. [2020-08-18 20:21:07,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 20:21:07,163 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1270 transitions. [2020-08-18 20:21:07,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-08-18 20:21:07,172 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 20:21:07,172 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 20:21:07,173 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-18 20:21:07,173 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 20:21:07,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 20:21:07,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1161387902, now seen corresponding path program 1 times [2020-08-18 20:21:07,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 20:21:07,174 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [289732026] [2020-08-18 20:21:07,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 20:21:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:07,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 20:21:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:07,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 20:21:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 20:21:07,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [289732026] [2020-08-18 20:21:07,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 20:21:07,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-18 20:21:07,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176164263] [2020-08-18 20:21:07,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-18 20:21:07,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 20:21:07,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-18 20:21:07,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-18 20:21:07,387 INFO L87 Difference]: Start difference. First operand 920 states and 1270 transitions. Second operand 8 states. [2020-08-18 20:21:09,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 20:21:09,486 INFO L93 Difference]: Finished difference Result 3684 states and 5428 transitions. [2020-08-18 20:21:09,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-18 20:21:09,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 114 [2020-08-18 20:21:09,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 20:21:09,506 INFO L225 Difference]: With dead ends: 3684 [2020-08-18 20:21:09,507 INFO L226 Difference]: Without dead ends: 2770 [2020-08-18 20:21:09,511 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-08-18 20:21:09,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2020-08-18 20:21:09,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2711. [2020-08-18 20:21:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2711 states. [2020-08-18 20:21:09,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3729 transitions. [2020-08-18 20:21:09,611 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3729 transitions. Word has length 114 [2020-08-18 20:21:09,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 20:21:09,612 INFO L479 AbstractCegarLoop]: Abstraction has 2711 states and 3729 transitions. [2020-08-18 20:21:09,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-18 20:21:09,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3729 transitions. [2020-08-18 20:21:09,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-08-18 20:21:09,621 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 20:21:09,622 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-18 20:21:09,622 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-18 20:21:09,622 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 20:21:09,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 20:21:09,623 INFO L82 PathProgramCache]: Analyzing trace with hash 2038920805, now seen corresponding path program 1 times [2020-08-18 20:21:09,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 20:21:09,623 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1654623816] [2020-08-18 20:21:09,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 20:21:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:09,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 20:21:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:09,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 20:21:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:09,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-18 20:21:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-18 20:21:09,806 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1654623816] [2020-08-18 20:21:09,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 20:21:09,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-18 20:21:09,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623364618] [2020-08-18 20:21:09,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-18 20:21:09,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 20:21:09,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-18 20:21:09,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-08-18 20:21:09,809 INFO L87 Difference]: Start difference. First operand 2711 states and 3729 transitions. Second operand 9 states. [2020-08-18 20:21:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 20:21:11,171 INFO L93 Difference]: Finished difference Result 5741 states and 8183 transitions. [2020-08-18 20:21:11,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-18 20:21:11,172 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2020-08-18 20:21:11,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 20:21:11,192 INFO L225 Difference]: With dead ends: 5741 [2020-08-18 20:21:11,192 INFO L226 Difference]: Without dead ends: 3036 [2020-08-18 20:21:11,200 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-08-18 20:21:11,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2020-08-18 20:21:11,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 2255. [2020-08-18 20:21:11,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2255 states. [2020-08-18 20:21:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 3000 transitions. [2020-08-18 20:21:11,292 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 3000 transitions. Word has length 133 [2020-08-18 20:21:11,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 20:21:11,293 INFO L479 AbstractCegarLoop]: Abstraction has 2255 states and 3000 transitions. [2020-08-18 20:21:11,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-18 20:21:11,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 3000 transitions. [2020-08-18 20:21:11,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-18 20:21:11,299 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 20:21:11,300 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-18 20:21:11,300 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-18 20:21:11,300 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 20:21:11,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 20:21:11,301 INFO L82 PathProgramCache]: Analyzing trace with hash -384739270, now seen corresponding path program 1 times [2020-08-18 20:21:11,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 20:21:11,301 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [444292190] [2020-08-18 20:21:11,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 20:21:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:11,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 20:21:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:11,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 20:21:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:11,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-08-18 20:21:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:11,493 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 52 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-18 20:21:11,494 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [444292190] [2020-08-18 20:21:11,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 20:21:11,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-18 20:21:11,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491011541] [2020-08-18 20:21:11,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-18 20:21:11,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 20:21:11,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-18 20:21:11,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-18 20:21:11,497 INFO L87 Difference]: Start difference. First operand 2255 states and 3000 transitions. Second operand 8 states. [2020-08-18 20:21:13,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 20:21:13,457 INFO L93 Difference]: Finished difference Result 6444 states and 8821 transitions. [2020-08-18 20:21:13,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-18 20:21:13,458 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2020-08-18 20:21:13,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 20:21:13,478 INFO L225 Difference]: With dead ends: 6444 [2020-08-18 20:21:13,479 INFO L226 Difference]: Without dead ends: 4195 [2020-08-18 20:21:13,486 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-08-18 20:21:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2020-08-18 20:21:13,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 3749. [2020-08-18 20:21:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3749 states. [2020-08-18 20:21:13,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3749 states to 3749 states and 4649 transitions. [2020-08-18 20:21:13,623 INFO L78 Accepts]: Start accepts. Automaton has 3749 states and 4649 transitions. Word has length 150 [2020-08-18 20:21:13,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 20:21:13,626 INFO L479 AbstractCegarLoop]: Abstraction has 3749 states and 4649 transitions. [2020-08-18 20:21:13,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-18 20:21:13,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3749 states and 4649 transitions. [2020-08-18 20:21:13,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-08-18 20:21:13,643 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 20:21:13,680 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 20:21:13,681 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-18 20:21:13,681 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 20:21:13,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 20:21:13,682 INFO L82 PathProgramCache]: Analyzing trace with hash -378508561, now seen corresponding path program 1 times [2020-08-18 20:21:13,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 20:21:13,682 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1349823574] [2020-08-18 20:21:13,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 20:21:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:13,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 20:21:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:13,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 20:21:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:13,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-18 20:21:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:13,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-08-18 20:21:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:13,923 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 90 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-08-18 20:21:13,924 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1349823574] [2020-08-18 20:21:13,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 20:21:13,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 20:21:13,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005269968] [2020-08-18 20:21:13,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 20:21:13,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 20:21:13,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 20:21:13,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 20:21:13,935 INFO L87 Difference]: Start difference. First operand 3749 states and 4649 transitions. Second operand 7 states. [2020-08-18 20:21:15,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 20:21:15,354 INFO L93 Difference]: Finished difference Result 8414 states and 10492 transitions. [2020-08-18 20:21:15,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-18 20:21:15,355 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 157 [2020-08-18 20:21:15,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 20:21:15,373 INFO L225 Difference]: With dead ends: 8414 [2020-08-18 20:21:15,373 INFO L226 Difference]: Without dead ends: 3747 [2020-08-18 20:21:15,387 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-08-18 20:21:15,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3747 states. [2020-08-18 20:21:15,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3747 to 3597. [2020-08-18 20:21:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3597 states. [2020-08-18 20:21:15,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 4112 transitions. [2020-08-18 20:21:15,533 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 4112 transitions. Word has length 157 [2020-08-18 20:21:15,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 20:21:15,533 INFO L479 AbstractCegarLoop]: Abstraction has 3597 states and 4112 transitions. [2020-08-18 20:21:15,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 20:21:15,533 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 4112 transitions. [2020-08-18 20:21:15,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-18 20:21:15,542 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 20:21:15,543 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-08-18 20:21:15,544 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-18 20:21:15,544 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 20:21:15,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 20:21:15,544 INFO L82 PathProgramCache]: Analyzing trace with hash 655844839, now seen corresponding path program 1 times [2020-08-18 20:21:15,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 20:21:15,545 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2002432732] [2020-08-18 20:21:15,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 20:21:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:15,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 20:21:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:15,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 20:21:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:15,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-18 20:21:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:21:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-18 20:21:15,818 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2002432732] [2020-08-18 20:21:15,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 20:21:15,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-18 20:21:15,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283183219] [2020-08-18 20:21:15,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-18 20:21:15,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 20:21:15,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-18 20:21:15,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-18 20:21:15,821 INFO L87 Difference]: Start difference. First operand 3597 states and 4112 transitions. Second operand 8 states. [2020-08-18 20:21:17,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 20:21:17,760 INFO L93 Difference]: Finished difference Result 7351 states and 8434 transitions. [2020-08-18 20:21:17,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-18 20:21:17,761 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 177 [2020-08-18 20:21:17,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 20:21:17,776 INFO L225 Difference]: With dead ends: 7351 [2020-08-18 20:21:17,777 INFO L226 Difference]: Without dead ends: 3593 [2020-08-18 20:21:17,784 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2020-08-18 20:21:17,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3593 states. [2020-08-18 20:21:17,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3593 to 3436. [2020-08-18 20:21:17,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2020-08-18 20:21:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 3803 transitions. [2020-08-18 20:21:17,863 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 3803 transitions. Word has length 177 [2020-08-18 20:21:17,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 20:21:17,863 INFO L479 AbstractCegarLoop]: Abstraction has 3436 states and 3803 transitions. [2020-08-18 20:21:17,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-18 20:21:17,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 3803 transitions. [2020-08-18 20:21:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-08-18 20:21:17,872 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 20:21:17,872 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-08-18 20:21:17,873 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-18 20:21:17,873 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 20:21:17,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 20:21:17,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1115229566, now seen corresponding path program 1 times [2020-08-18 20:21:17,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 20:21:17,874 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1310427110] [2020-08-18 20:21:17,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 20:21:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-18 20:21:17,922 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-18 20:21:17,923 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-18 20:21:17,932 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-18 20:21:17,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.08 08:21:17 BoogieIcfgContainer [2020-08-18 20:21:17,992 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-18 20:21:17,995 INFO L168 Benchmark]: Toolchain (without parser) took 17883.41 ms. Allocated memory was 138.4 MB in the beginning and 518.0 MB in the end (delta: 379.6 MB). Free memory was 100.1 MB in the beginning and 321.3 MB in the end (delta: -221.2 MB). Peak memory consumption was 158.4 MB. Max. memory is 7.1 GB. [2020-08-18 20:21:17,995 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-18 20:21:18,002 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.94 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 99.9 MB in the beginning and 170.2 MB in the end (delta: -70.3 MB). Peak memory consumption was 33.8 MB. Max. memory is 7.1 GB. [2020-08-18 20:21:18,003 INFO L168 Benchmark]: Boogie Preprocessor took 150.81 ms. Allocated memory is still 202.9 MB. Free memory was 170.2 MB in the beginning and 165.2 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. [2020-08-18 20:21:18,004 INFO L168 Benchmark]: RCFGBuilder took 1309.72 ms. Allocated memory was 202.9 MB in the beginning and 233.8 MB in the end (delta: 30.9 MB). Free memory was 165.2 MB in the beginning and 179.4 MB in the end (delta: -14.3 MB). Peak memory consumption was 85.9 MB. Max. memory is 7.1 GB. [2020-08-18 20:21:18,011 INFO L168 Benchmark]: TraceAbstraction took 15651.17 ms. Allocated memory was 233.8 MB in the beginning and 518.0 MB in the end (delta: 284.2 MB). Free memory was 179.4 MB in the beginning and 321.3 MB in the end (delta: -141.9 MB). Peak memory consumption was 142.2 MB. Max. memory is 7.1 GB. [2020-08-18 20:21:18,021 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.25 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 766.94 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 99.9 MB in the beginning and 170.2 MB in the end (delta: -70.3 MB). Peak memory consumption was 33.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 150.81 ms. Allocated memory is still 202.9 MB. Free memory was 170.2 MB in the beginning and 165.2 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1309.72 ms. Allocated memory was 202.9 MB in the beginning and 233.8 MB in the end (delta: 30.9 MB). Free memory was 165.2 MB in the beginning and 179.4 MB in the end (delta: -14.3 MB). Peak memory consumption was 85.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15651.17 ms. Allocated memory was 233.8 MB in the beginning and 518.0 MB in the end (delta: 284.2 MB). Free memory was 179.4 MB in the beginning and 321.3 MB in the end (delta: -141.9 MB). Peak memory consumption was 142.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 430]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND TRUE (((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1)) [L166] a25 = 1 [L167] a28 = 9 [L168] return 26; [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) [L368] COND TRUE ((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1))) [L369] a11 = 1 [L370] a19 = 0 [L371] a25 = 1 [L372] a17 = 7 [L373] a28 = 9 [L374] return -1; [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L420] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L423] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L426] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) [L429] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7)) [L430] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 236 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.5s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 248 SDtfs, 4448 SDslu, 391 SDs, 0 SdLazy, 6819 SolverSat, 1313 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3749occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 7 MinimizatonAttempts, 1607 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1121 NumberOfCodeBlocks, 1121 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 916 ConstructedInterpolants, 0 QuantifiedInterpolants, 353455 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 313/343 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...