/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --rcfgbuilder.size.of.a.code.block SingleStatement --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/Problem02_label43.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c90d42b [2020-09-24 15:01:59,267 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-24 15:01:59,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-24 15:01:59,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-24 15:01:59,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-24 15:01:59,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-24 15:01:59,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-24 15:01:59,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-24 15:01:59,304 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-24 15:01:59,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-24 15:01:59,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-24 15:01:59,307 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-24 15:01:59,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-24 15:01:59,309 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-24 15:01:59,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-24 15:01:59,311 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-24 15:01:59,312 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-24 15:01:59,313 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-24 15:01:59,315 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-24 15:01:59,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-24 15:01:59,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-24 15:01:59,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-24 15:01:59,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-24 15:01:59,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-24 15:01:59,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-24 15:01:59,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-24 15:01:59,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-24 15:01:59,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-24 15:01:59,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-24 15:01:59,333 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-24 15:01:59,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-24 15:01:59,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-24 15:01:59,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-24 15:01:59,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-24 15:01:59,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-24 15:01:59,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-24 15:01:59,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-24 15:01:59,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-24 15:01:59,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-24 15:01:59,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-24 15:01:59,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-24 15:01:59,348 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-24 15:01:59,406 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-24 15:01:59,406 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-24 15:01:59,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-24 15:01:59,410 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-24 15:01:59,410 INFO L138 SettingsManager]: * Use SBE=true [2020-09-24 15:01:59,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-24 15:01:59,410 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-24 15:01:59,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-24 15:01:59,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-24 15:01:59,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-24 15:01:59,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-24 15:01:59,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-24 15:01:59,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-24 15:01:59,413 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-24 15:01:59,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-24 15:01:59,413 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-24 15:01:59,413 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-24 15:01:59,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-24 15:01:59,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-24 15:01:59,414 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-24 15:01:59,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-24 15:01:59,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-24 15:01:59,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-24 15:01:59,415 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-24 15:01:59,415 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-24 15:01:59,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-24 15:01:59,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-24 15:01:59,416 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-24 15:01:59,416 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-24 15:01:59,416 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-09-24 15:01:59,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-24 15:01:59,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-24 15:01:59,926 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-24 15:01:59,928 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-24 15:01:59,928 INFO L275 PluginConnector]: CDTParser initialized [2020-09-24 15:01:59,929 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label43.c [2020-09-24 15:02:00,008 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/45bb91041/c157884f1dd9459a80d2ded054851252/FLAG59354d81d [2020-09-24 15:02:00,641 INFO L306 CDTParser]: Found 1 translation units. [2020-09-24 15:02:00,642 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem02_label43.c [2020-09-24 15:02:00,663 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/45bb91041/c157884f1dd9459a80d2ded054851252/FLAG59354d81d [2020-09-24 15:02:00,843 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/45bb91041/c157884f1dd9459a80d2ded054851252 [2020-09-24 15:02:00,858 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-24 15:02:00,864 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-24 15:02:00,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-24 15:02:00,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-24 15:02:00,870 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-24 15:02:00,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 03:02:00" (1/1) ... [2020-09-24 15:02:00,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5783693b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:00, skipping insertion in model container [2020-09-24 15:02:00,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 03:02:00" (1/1) ... [2020-09-24 15:02:00,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-24 15:02:00,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-24 15:02:01,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-24 15:02:01,376 INFO L203 MainTranslator]: Completed pre-run [2020-09-24 15:02:01,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-24 15:02:01,644 INFO L208 MainTranslator]: Completed translation [2020-09-24 15:02:01,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:01 WrapperNode [2020-09-24 15:02:01,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-24 15:02:01,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-24 15:02:01,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-24 15:02:01,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-24 15:02:01,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:01" (1/1) ... [2020-09-24 15:02:01,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:01" (1/1) ... [2020-09-24 15:02:01,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:01" (1/1) ... [2020-09-24 15:02:01,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:01" (1/1) ... [2020-09-24 15:02:01,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:01" (1/1) ... [2020-09-24 15:02:01,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:01" (1/1) ... [2020-09-24 15:02:01,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:01" (1/1) ... [2020-09-24 15:02:01,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-24 15:02:01,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-24 15:02:01,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-24 15:02:01,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-24 15:02:01,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:01" (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-24 15:02:01,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-24 15:02:01,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-24 15:02:01,888 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-24 15:02:01,888 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-24 15:02:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-24 15:02:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-24 15:02:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-24 15:02:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-24 15:02:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-24 15:02:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-24 15:02:01,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-24 15:02:03,254 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-24 15:02:03,254 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-24 15:02:03,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 03:02:03 BoogieIcfgContainer [2020-09-24 15:02:03,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-24 15:02:03,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-24 15:02:03,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-24 15:02:03,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-24 15:02:03,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 03:02:00" (1/3) ... [2020-09-24 15:02:03,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786d3a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 03:02:03, skipping insertion in model container [2020-09-24 15:02:03,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:01" (2/3) ... [2020-09-24 15:02:03,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786d3a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 03:02:03, skipping insertion in model container [2020-09-24 15:02:03,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 03:02:03" (3/3) ... [2020-09-24 15:02:03,276 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label43.c [2020-09-24 15:02:03,287 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-24 15:02:03,299 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-24 15:02:03,321 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-24 15:02:03,357 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-24 15:02:03,358 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-24 15:02:03,358 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-24 15:02:03,358 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-24 15:02:03,358 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-24 15:02:03,358 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-24 15:02:03,359 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-24 15:02:03,359 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-24 15:02:03,392 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states. [2020-09-24 15:02:03,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-09-24 15:02:03,412 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:03,413 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:02:03,414 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:03,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:03,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1883432242, now seen corresponding path program 1 times [2020-09-24 15:02:03,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:03,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2106040551] [2020-09-24 15:02:03,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:03,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:02:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:04,025 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-24 15:02:04,026 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2106040551] [2020-09-24 15:02:04,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 15:02:04,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-24 15:02:04,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263170881] [2020-09-24 15:02:04,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 15:02:04,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:02:04,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 15:02:04,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-24 15:02:04,081 INFO L87 Difference]: Start difference. First operand 527 states. Second operand 5 states. [2020-09-24 15:02:08,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:02:08,427 INFO L93 Difference]: Finished difference Result 1892 states and 2645 transitions. [2020-09-24 15:02:08,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-24 15:02:08,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2020-09-24 15:02:08,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:02:08,466 INFO L225 Difference]: With dead ends: 1892 [2020-09-24 15:02:08,466 INFO L226 Difference]: Without dead ends: 1244 [2020-09-24 15:02:08,477 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-09-24 15:02:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2020-09-24 15:02:08,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 816. [2020-09-24 15:02:08,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2020-09-24 15:02:08,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1032 transitions. [2020-09-24 15:02:08,614 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1032 transitions. Word has length 111 [2020-09-24 15:02:08,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:02:08,615 INFO L479 AbstractCegarLoop]: Abstraction has 816 states and 1032 transitions. [2020-09-24 15:02:08,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 15:02:08,615 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1032 transitions. [2020-09-24 15:02:08,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-09-24 15:02:08,630 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:08,630 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-24 15:02:08,631 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-24 15:02:08,631 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:08,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:08,632 INFO L82 PathProgramCache]: Analyzing trace with hash -184227746, now seen corresponding path program 1 times [2020-09-24 15:02:08,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:08,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [992696991] [2020-09-24 15:02:08,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:08,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:02:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:08,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-24 15:02:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:09,005 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 15:02:09,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [992696991] [2020-09-24 15:02:09,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 15:02:09,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-24 15:02:09,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038681470] [2020-09-24 15:02:09,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-24 15:02:09,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:02:09,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-24 15:02:09,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-09-24 15:02:09,010 INFO L87 Difference]: Start difference. First operand 816 states and 1032 transitions. Second operand 10 states. [2020-09-24 15:02:15,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:02:15,654 INFO L93 Difference]: Finished difference Result 2463 states and 3197 transitions. [2020-09-24 15:02:15,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-09-24 15:02:15,655 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 129 [2020-09-24 15:02:15,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:02:15,670 INFO L225 Difference]: With dead ends: 2463 [2020-09-24 15:02:15,670 INFO L226 Difference]: Without dead ends: 1669 [2020-09-24 15:02:15,676 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=202, Invalid=790, Unknown=0, NotChecked=0, Total=992 [2020-09-24 15:02:15,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2020-09-24 15:02:15,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1483. [2020-09-24 15:02:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1483 states. [2020-09-24 15:02:15,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 1850 transitions. [2020-09-24 15:02:15,769 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 1850 transitions. Word has length 129 [2020-09-24 15:02:15,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:02:15,772 INFO L479 AbstractCegarLoop]: Abstraction has 1483 states and 1850 transitions. [2020-09-24 15:02:15,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-24 15:02:15,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1850 transitions. [2020-09-24 15:02:15,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-09-24 15:02:15,787 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:15,788 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-24 15:02:15,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-24 15:02:15,789 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:15,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:15,790 INFO L82 PathProgramCache]: Analyzing trace with hash 980037392, now seen corresponding path program 1 times [2020-09-24 15:02:15,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:15,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [142211737] [2020-09-24 15:02:15,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:16,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:02:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:16,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-24 15:02:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 15:02:16,168 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [142211737] [2020-09-24 15:02:16,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:02:16,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-24 15:02:16,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246560763] [2020-09-24 15:02:16,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-24 15:02:16,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:02:16,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-24 15:02:16,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-24 15:02:16,174 INFO L87 Difference]: Start difference. First operand 1483 states and 1850 transitions. Second operand 6 states. [2020-09-24 15:02:18,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:02:18,918 INFO L93 Difference]: Finished difference Result 4529 states and 6071 transitions. [2020-09-24 15:02:18,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-24 15:02:18,922 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2020-09-24 15:02:18,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:02:18,944 INFO L225 Difference]: With dead ends: 4529 [2020-09-24 15:02:18,945 INFO L226 Difference]: Without dead ends: 3068 [2020-09-24 15:02:18,952 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-09-24 15:02:18,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2020-09-24 15:02:19,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3006. [2020-09-24 15:02:19,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3006 states. [2020-09-24 15:02:19,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3006 states to 3006 states and 3801 transitions. [2020-09-24 15:02:19,073 INFO L78 Accepts]: Start accepts. Automaton has 3006 states and 3801 transitions. Word has length 133 [2020-09-24 15:02:19,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:02:19,075 INFO L479 AbstractCegarLoop]: Abstraction has 3006 states and 3801 transitions. [2020-09-24 15:02:19,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-24 15:02:19,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3006 states and 3801 transitions. [2020-09-24 15:02:19,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-09-24 15:02:19,087 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:19,087 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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-24 15:02:19,087 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-24 15:02:19,087 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:19,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:19,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1044088891, now seen corresponding path program 1 times [2020-09-24 15:02:19,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:19,088 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1838231188] [2020-09-24 15:02:19,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:19,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:02:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:19,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-24 15:02:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:19,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-24 15:02:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:19,398 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-24 15:02:19,399 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1838231188] [2020-09-24 15:02:19,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:02:19,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-24 15:02:19,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541926478] [2020-09-24 15:02:19,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-24 15:02:19,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:02:19,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-24 15:02:19,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-24 15:02:19,404 INFO L87 Difference]: Start difference. First operand 3006 states and 3801 transitions. Second operand 10 states. [2020-09-24 15:02:23,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:02:23,424 INFO L93 Difference]: Finished difference Result 6897 states and 9179 transitions. [2020-09-24 15:02:23,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-24 15:02:23,424 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 146 [2020-09-24 15:02:23,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:02:23,445 INFO L225 Difference]: With dead ends: 6897 [2020-09-24 15:02:23,445 INFO L226 Difference]: Without dead ends: 3913 [2020-09-24 15:02:23,458 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2020-09-24 15:02:23,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3913 states. [2020-09-24 15:02:23,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3913 to 3401. [2020-09-24 15:02:23,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3401 states. [2020-09-24 15:02:23,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 4201 transitions. [2020-09-24 15:02:23,587 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 4201 transitions. Word has length 146 [2020-09-24 15:02:23,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:02:23,588 INFO L479 AbstractCegarLoop]: Abstraction has 3401 states and 4201 transitions. [2020-09-24 15:02:23,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-24 15:02:23,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4201 transitions. [2020-09-24 15:02:23,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-09-24 15:02:23,598 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:23,598 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:02:23,599 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-24 15:02:23,599 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:23,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:23,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2005749092, now seen corresponding path program 1 times [2020-09-24 15:02:23,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:23,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1248934615] [2020-09-24 15:02:23,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:23,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:02:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:23,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-24 15:02:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 15:02:23,840 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1248934615] [2020-09-24 15:02:23,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:02:23,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-24 15:02:23,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587441366] [2020-09-24 15:02:23,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 15:02:23,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:02:23,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 15:02:23,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 15:02:23,843 INFO L87 Difference]: Start difference. First operand 3401 states and 4201 transitions. Second operand 5 states. [2020-09-24 15:02:25,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:02:25,343 INFO L93 Difference]: Finished difference Result 7682 states and 9614 transitions. [2020-09-24 15:02:25,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-24 15:02:25,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2020-09-24 15:02:25,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:02:25,366 INFO L225 Difference]: With dead ends: 7682 [2020-09-24 15:02:25,366 INFO L226 Difference]: Without dead ends: 4303 [2020-09-24 15:02:25,376 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-24 15:02:25,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4303 states. [2020-09-24 15:02:25,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4303 to 3401. [2020-09-24 15:02:25,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3401 states. [2020-09-24 15:02:25,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 4253 transitions. [2020-09-24 15:02:25,476 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 4253 transitions. Word has length 154 [2020-09-24 15:02:25,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:02:25,477 INFO L479 AbstractCegarLoop]: Abstraction has 3401 states and 4253 transitions. [2020-09-24 15:02:25,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 15:02:25,477 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4253 transitions. [2020-09-24 15:02:25,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-09-24 15:02:25,487 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:25,487 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 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-24 15:02:25,487 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-24 15:02:25,488 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:25,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:25,488 INFO L82 PathProgramCache]: Analyzing trace with hash -584227059, now seen corresponding path program 1 times [2020-09-24 15:02:25,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:25,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [363414212] [2020-09-24 15:02:25,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:25,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:02:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:25,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-24 15:02:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:25,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-24 15:02:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:25,703 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-24 15:02:25,704 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [363414212] [2020-09-24 15:02:25,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:02:25,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-24 15:02:25,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197623235] [2020-09-24 15:02:25,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-24 15:02:25,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:02:25,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-24 15:02:25,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-24 15:02:25,716 INFO L87 Difference]: Start difference. First operand 3401 states and 4253 transitions. Second operand 7 states. [2020-09-24 15:02:28,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:02:28,581 INFO L93 Difference]: Finished difference Result 10519 states and 14148 transitions. [2020-09-24 15:02:28,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-24 15:02:28,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 158 [2020-09-24 15:02:28,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:02:28,629 INFO L225 Difference]: With dead ends: 10519 [2020-09-24 15:02:28,629 INFO L226 Difference]: Without dead ends: 7140 [2020-09-24 15:02:28,647 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 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-09-24 15:02:28,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7140 states. [2020-09-24 15:02:28,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7140 to 7046. [2020-09-24 15:02:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7046 states. [2020-09-24 15:02:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7046 states to 7046 states and 8797 transitions. [2020-09-24 15:02:28,889 INFO L78 Accepts]: Start accepts. Automaton has 7046 states and 8797 transitions. Word has length 158 [2020-09-24 15:02:28,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:02:28,890 INFO L479 AbstractCegarLoop]: Abstraction has 7046 states and 8797 transitions. [2020-09-24 15:02:28,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-24 15:02:28,893 INFO L276 IsEmpty]: Start isEmpty. Operand 7046 states and 8797 transitions. [2020-09-24 15:02:28,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2020-09-24 15:02:28,920 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:28,920 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:02:28,921 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-24 15:02:28,921 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:28,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:28,921 INFO L82 PathProgramCache]: Analyzing trace with hash 667558422, now seen corresponding path program 1 times [2020-09-24 15:02:28,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:28,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [889663315] [2020-09-24 15:02:28,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:29,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:02:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:29,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-24 15:02:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:29,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-09-24 15:02:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:29,190 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-24 15:02:29,191 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [889663315] [2020-09-24 15:02:29,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:02:29,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-24 15:02:29,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510182927] [2020-09-24 15:02:29,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-24 15:02:29,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:02:29,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-24 15:02:29,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-24 15:02:29,193 INFO L87 Difference]: Start difference. First operand 7046 states and 8797 transitions. Second operand 7 states. [2020-09-24 15:02:31,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:02:31,688 INFO L93 Difference]: Finished difference Result 15016 states and 18898 transitions. [2020-09-24 15:02:31,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-24 15:02:31,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 167 [2020-09-24 15:02:31,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:02:31,724 INFO L225 Difference]: With dead ends: 15016 [2020-09-24 15:02:31,724 INFO L226 Difference]: Without dead ends: 5935 [2020-09-24 15:02:31,752 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-09-24 15:02:31,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5935 states. [2020-09-24 15:02:31,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5935 to 5773. [2020-09-24 15:02:31,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5773 states. [2020-09-24 15:02:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5773 states to 5773 states and 6751 transitions. [2020-09-24 15:02:31,903 INFO L78 Accepts]: Start accepts. Automaton has 5773 states and 6751 transitions. Word has length 167 [2020-09-24 15:02:31,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:02:31,903 INFO L479 AbstractCegarLoop]: Abstraction has 5773 states and 6751 transitions. [2020-09-24 15:02:31,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-24 15:02:31,904 INFO L276 IsEmpty]: Start isEmpty. Operand 5773 states and 6751 transitions. [2020-09-24 15:02:31,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-09-24 15:02:31,915 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:31,915 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:02:31,915 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-24 15:02:31,915 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:31,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:31,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1762466321, now seen corresponding path program 1 times [2020-09-24 15:02:31,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:31,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [954742663] [2020-09-24 15:02:31,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:32,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:02:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:32,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-24 15:02:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:32,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-09-24 15:02:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:32,141 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-24 15:02:32,141 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [954742663] [2020-09-24 15:02:32,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:02:32,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-24 15:02:32,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452625061] [2020-09-24 15:02:32,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-24 15:02:32,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:02:32,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-24 15:02:32,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-24 15:02:32,144 INFO L87 Difference]: Start difference. First operand 5773 states and 6751 transitions. Second operand 8 states. [2020-09-24 15:02:34,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:02:34,923 INFO L93 Difference]: Finished difference Result 9914 states and 11759 transitions. [2020-09-24 15:02:34,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-24 15:02:34,924 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 171 [2020-09-24 15:02:34,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:02:34,938 INFO L225 Difference]: With dead ends: 9914 [2020-09-24 15:02:34,939 INFO L226 Difference]: Without dead ends: 4312 [2020-09-24 15:02:34,951 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2020-09-24 15:02:34,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4312 states. [2020-09-24 15:02:35,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4312 to 3821. [2020-09-24 15:02:35,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3821 states. [2020-09-24 15:02:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3821 states to 3821 states and 4413 transitions. [2020-09-24 15:02:35,058 INFO L78 Accepts]: Start accepts. Automaton has 3821 states and 4413 transitions. Word has length 171 [2020-09-24 15:02:35,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:02:35,058 INFO L479 AbstractCegarLoop]: Abstraction has 3821 states and 4413 transitions. [2020-09-24 15:02:35,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-24 15:02:35,058 INFO L276 IsEmpty]: Start isEmpty. Operand 3821 states and 4413 transitions. [2020-09-24 15:02:35,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2020-09-24 15:02:35,069 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:35,069 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:02:35,069 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-24 15:02:35,070 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:35,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:35,070 INFO L82 PathProgramCache]: Analyzing trace with hash -523474928, now seen corresponding path program 1 times [2020-09-24 15:02:35,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:35,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1645955871] [2020-09-24 15:02:35,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-24 15:02:35,133 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-24 15:02:35,134 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-24 15:02:35,142 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-24 15:02:35,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.09 03:02:35 BoogieIcfgContainer [2020-09-24 15:02:35,199 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-24 15:02:35,212 INFO L168 Benchmark]: Toolchain (without parser) took 34341.79 ms. Allocated memory was 143.1 MB in the beginning and 546.3 MB in the end (delta: 403.2 MB). Free memory was 104.8 MB in the beginning and 276.3 MB in the end (delta: -171.5 MB). Peak memory consumption was 231.6 MB. Max. memory is 7.1 GB. [2020-09-24 15:02:35,213 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 143.1 MB. Free memory was 124.7 MB in the beginning and 124.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-24 15:02:35,217 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.16 ms. Allocated memory was 143.1 MB in the beginning and 206.6 MB in the end (delta: 63.4 MB). Free memory was 104.2 MB in the beginning and 173.7 MB in the end (delta: -69.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 7.1 GB. [2020-09-24 15:02:35,217 INFO L168 Benchmark]: Boogie Preprocessor took 155.71 ms. Allocated memory is still 206.6 MB. Free memory was 173.7 MB in the beginning and 169.0 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 7.1 GB. [2020-09-24 15:02:35,218 INFO L168 Benchmark]: RCFGBuilder took 1464.60 ms. Allocated memory was 206.6 MB in the beginning and 233.8 MB in the end (delta: 27.3 MB). Free memory was 169.0 MB in the beginning and 152.8 MB in the end (delta: 16.3 MB). Peak memory consumption was 77.1 MB. Max. memory is 7.1 GB. [2020-09-24 15:02:35,220 INFO L168 Benchmark]: TraceAbstraction took 31931.52 ms. Allocated memory was 233.8 MB in the beginning and 546.3 MB in the end (delta: 312.5 MB). Free memory was 152.8 MB in the beginning and 276.3 MB in the end (delta: -123.6 MB). Peak memory consumption was 188.9 MB. Max. memory is 7.1 GB. [2020-09-24 15:02:35,228 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.57 ms. Allocated memory is still 143.1 MB. Free memory was 124.7 MB in the beginning and 124.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 780.16 ms. Allocated memory was 143.1 MB in the beginning and 206.6 MB in the end (delta: 63.4 MB). Free memory was 104.2 MB in the beginning and 173.7 MB in the end (delta: -69.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 155.71 ms. Allocated memory is still 206.6 MB. Free memory was 173.7 MB in the beginning and 169.0 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1464.60 ms. Allocated memory was 206.6 MB in the beginning and 233.8 MB in the end (delta: 27.3 MB). Free memory was 169.0 MB in the beginning and 152.8 MB in the end (delta: 16.3 MB). Peak memory consumption was 77.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31931.52 ms. Allocated memory was 233.8 MB in the beginning and 546.3 MB in the end (delta: 312.5 MB). Free memory was 152.8 MB in the beginning and 276.3 MB in the end (delta: -123.6 MB). Peak memory consumption was 188.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 427]: 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 TRUE (((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)) [L31] a28 = 9 [L32] a11 = 1 [L33] a25 = 1 [L34] 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 TRUE ((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8)) [L427] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 527 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 31.7s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 27.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2329 SDtfs, 10835 SDslu, 3158 SDs, 0 SdLazy, 15090 SolverSat, 1710 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7046occurred 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: 1.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 2837 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1341 NumberOfCodeBlocks, 1341 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1161 ConstructedInterpolants, 0 QuantifiedInterpolants, 453803 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 223/240 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...