java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label07_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-11 17:56:16,349 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-11 17:56:16,351 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-11 17:56:16,364 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-11 17:56:16,364 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-11 17:56:16,365 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-11 17:56:16,367 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-11 17:56:16,368 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-11 17:56:16,370 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-11 17:56:16,371 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-11 17:56:16,372 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-11 17:56:16,372 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-11 17:56:16,373 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-11 17:56:16,374 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-11 17:56:16,375 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-11 17:56:16,376 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-11 17:56:16,377 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-11 17:56:16,379 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-11 17:56:16,381 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-11 17:56:16,382 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-11 17:56:16,384 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-11 17:56:16,388 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-11 17:56:16,390 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-11 17:56:16,393 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-11 17:56:16,393 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-11 17:56:16,394 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-11 17:56:16,394 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-11 17:56:16,395 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-11 17:56:16,396 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-11 17:56:16,397 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-11 17:56:16,397 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-11 17:56:16,400 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-11 17:56:16,400 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-11 17:56:16,400 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-11 17:56:16,401 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-11 17:56:16,403 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-11 17:56:16,403 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf [2018-09-11 17:56:16,429 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-11 17:56:16,429 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-11 17:56:16,433 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-11 17:56:16,434 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-11 17:56:16,434 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-11 17:56:16,434 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-11 17:56:16,434 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-11 17:56:16,434 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-11 17:56:16,435 INFO L133 SettingsManager]: * Abstract domain=CongruenceDomain [2018-09-11 17:56:16,435 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-11 17:56:16,435 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-11 17:56:16,436 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-11 17:56:16,437 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-11 17:56:16,437 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-11 17:56:16,437 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-11 17:56:16,437 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-11 17:56:16,438 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-11 17:56:16,438 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-11 17:56:16,438 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-11 17:56:16,438 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-11 17:56:16,438 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-11 17:56:16,439 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-11 17:56:16,439 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-11 17:56:16,439 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-11 17:56:16,439 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-11 17:56:16,439 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-11 17:56:16,440 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-11 17:56:16,440 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-11 17:56:16,440 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-11 17:56:16,440 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-11 17:56:16,442 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-11 17:56:16,442 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-11 17:56:16,442 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-11 17:56:16,443 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-11 17:56:16,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-11 17:56:16,535 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-11 17:56:16,541 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-11 17:56:16,543 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-11 17:56:16,543 INFO L276 PluginConnector]: CDTParser initialized [2018-09-11 17:56:16,544 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label07_true-unreach-call_false-termination.c [2018-09-11 17:56:16,926 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3b514535/cc9912d625214f4fa0e257a0b071dbc0/FLAGcd6f12d2a [2018-09-11 17:56:17,215 INFO L276 CDTParser]: Found 1 translation units. [2018-09-11 17:56:17,219 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label07_true-unreach-call_false-termination.c [2018-09-11 17:56:17,244 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3b514535/cc9912d625214f4fa0e257a0b071dbc0/FLAGcd6f12d2a [2018-09-11 17:56:17,268 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3b514535/cc9912d625214f4fa0e257a0b071dbc0 [2018-09-11 17:56:17,281 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-11 17:56:17,287 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-11 17:56:17,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-11 17:56:17,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-11 17:56:17,298 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-11 17:56:17,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 05:56:17" (1/1) ... [2018-09-11 17:56:17,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b0699e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:17, skipping insertion in model container [2018-09-11 17:56:17,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 05:56:17" (1/1) ... [2018-09-11 17:56:17,520 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-11 17:56:17,802 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-11 17:56:17,821 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-11 17:56:17,976 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-11 17:56:18,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:18 WrapperNode [2018-09-11 17:56:18,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-11 17:56:18,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-11 17:56:18,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-11 17:56:18,016 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-11 17:56:18,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:18" (1/1) ... [2018-09-11 17:56:18,048 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:18" (1/1) ... [2018-09-11 17:56:18,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-11 17:56:18,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-11 17:56:18,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-11 17:56:18,128 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-11 17:56:18,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:18" (1/1) ... [2018-09-11 17:56:18,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:18" (1/1) ... [2018-09-11 17:56:18,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:18" (1/1) ... [2018-09-11 17:56:18,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:18" (1/1) ... [2018-09-11 17:56:18,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:18" (1/1) ... [2018-09-11 17:56:18,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:18" (1/1) ... [2018-09-11 17:56:18,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:18" (1/1) ... [2018-09-11 17:56:18,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-11 17:56:18,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-11 17:56:18,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-11 17:56:18,416 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-11 17:56:18,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2018-09-11 17:56:18,494 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-09-11 17:56:18,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-09-11 17:56:18,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-11 17:56:18,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-11 17:56:18,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-11 17:56:18,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-11 17:56:18,496 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-11 17:56:18,496 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-11 17:56:21,791 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-11 17:56:21,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 05:56:21 BoogieIcfgContainer [2018-09-11 17:56:21,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-11 17:56:21,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-11 17:56:21,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-11 17:56:21,801 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-11 17:56:21,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 05:56:17" (1/3) ... [2018-09-11 17:56:21,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f400f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 05:56:21, skipping insertion in model container [2018-09-11 17:56:21,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:18" (2/3) ... [2018-09-11 17:56:21,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f400f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 05:56:21, skipping insertion in model container [2018-09-11 17:56:21,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 05:56:21" (3/3) ... [2018-09-11 17:56:21,806 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label07_true-unreach-call_false-termination.c [2018-09-11 17:56:21,817 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-11 17:56:21,828 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-11 17:56:21,890 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-11 17:56:21,891 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-11 17:56:21,891 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-11 17:56:21,891 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-11 17:56:21,891 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-11 17:56:21,891 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-11 17:56:21,892 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-11 17:56:21,892 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-11 17:56:21,892 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-11 17:56:21,919 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-09-11 17:56:21,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-11 17:56:21,943 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:56:21,944 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-11 17:56:21,946 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 17:56:21,952 INFO L82 PathProgramCache]: Analyzing trace with hash 587429280, now seen corresponding path program 1 times [2018-09-11 17:56:21,954 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:56:21,956 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 147 with the following transitions: [2018-09-11 17:56:21,958 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [20], [24], [28], [32], [36], [40], [51], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [169], [173], [177], [181], [185], [189], [193], [197], [208], [212], [216], [220], [231], [235], [239], [243], [247], [251], [255], [266], [270], [281], [285], [296], [307], [311], [315], [319], [323], [327], [331], [342], [346], [350], [354], [358], [362], [366], [370], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [837], [839], [862], [863], [867], [871], [877], [881], [888], [889], [890], [892] [2018-09-11 17:56:21,997 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:56:21,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:56:22,238 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 17:56:22,240 INFO L272 AbstractInterpreter]: Visited 145 different actions 145 times. Never merged. Never widened. Never found a fixpoint. Largest state had 37 variables. [2018-09-11 17:56:22,292 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 17:56:22,605 INFO L232 lantSequenceWeakener]: Weakened 143 states. On average, predicates are now at 81.43% of their original sizes. [2018-09-11 17:56:22,606 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 17:56:22,899 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 17:56:22,900 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 17:56:22,901 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-11 17:56:22,901 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 17:56:22,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-11 17:56:22,919 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-11 17:56:22,920 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-11 17:56:22,925 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 6 states. [2018-09-11 17:56:25,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 17:56:25,564 INFO L93 Difference]: Finished difference Result 622 states and 1061 transitions. [2018-09-11 17:56:25,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-11 17:56:25,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2018-09-11 17:56:25,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 17:56:25,583 INFO L225 Difference]: With dead ends: 622 [2018-09-11 17:56:25,584 INFO L226 Difference]: Without dead ends: 383 [2018-09-11 17:56:25,590 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-11 17:56:25,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-09-11 17:56:25,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 380. [2018-09-11 17:56:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-09-11 17:56:25,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 531 transitions. [2018-09-11 17:56:25,672 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 531 transitions. Word has length 146 [2018-09-11 17:56:25,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 17:56:25,674 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 531 transitions. [2018-09-11 17:56:25,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-11 17:56:25,674 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 531 transitions. [2018-09-11 17:56:25,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-11 17:56:25,680 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:56:25,681 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-11 17:56:25,681 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 17:56:25,682 INFO L82 PathProgramCache]: Analyzing trace with hash 585985217, now seen corresponding path program 1 times [2018-09-11 17:56:25,682 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:56:25,682 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2018-09-11 17:56:25,683 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [8], [12], [16], [20], [24], [28], [32], [36], [40], [51], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [169], [173], [177], [181], [185], [189], [193], [197], [208], [212], [216], [220], [231], [235], [239], [243], [247], [251], [255], [266], [270], [281], [285], [296], [307], [311], [315], [319], [323], [327], [331], [342], [346], [350], [354], [358], [362], [366], [370], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [837], [839], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-11 17:56:25,689 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:56:25,689 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:56:25,871 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 17:56:25,872 INFO L272 AbstractInterpreter]: Visited 149 different actions 292 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-09-11 17:56:25,912 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 17:56:26,143 INFO L232 lantSequenceWeakener]: Weakened 153 states. On average, predicates are now at 81.43% of their original sizes. [2018-09-11 17:56:26,144 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 17:56:26,337 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 17:56:26,338 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 17:56:26,338 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 17:56:26,338 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 17:56:26,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 17:56:26,340 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 17:56:26,340 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 17:56:26,341 INFO L87 Difference]: Start difference. First operand 380 states and 531 transitions. Second operand 9 states. [2018-09-11 17:56:30,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 17:56:30,816 INFO L93 Difference]: Finished difference Result 905 states and 1347 transitions. [2018-09-11 17:56:30,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-11 17:56:30,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 156 [2018-09-11 17:56:30,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 17:56:30,824 INFO L225 Difference]: With dead ends: 905 [2018-09-11 17:56:30,824 INFO L226 Difference]: Without dead ends: 531 [2018-09-11 17:56:30,828 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 162 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-11 17:56:30,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-09-11 17:56:30,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 527. [2018-09-11 17:56:30,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-09-11 17:56:30,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 690 transitions. [2018-09-11 17:56:30,866 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 690 transitions. Word has length 156 [2018-09-11 17:56:30,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 17:56:30,867 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 690 transitions. [2018-09-11 17:56:30,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 17:56:30,867 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 690 transitions. [2018-09-11 17:56:30,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-11 17:56:30,871 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:56:30,872 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-11 17:56:30,872 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 17:56:30,873 INFO L82 PathProgramCache]: Analyzing trace with hash 375366969, now seen corresponding path program 1 times [2018-09-11 17:56:30,873 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:56:30,873 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 161 with the following transitions: [2018-09-11 17:56:30,874 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [20], [23], [24], [28], [32], [36], [40], [51], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [169], [173], [177], [181], [185], [189], [193], [197], [208], [212], [216], [220], [231], [235], [239], [243], [247], [251], [255], [266], [270], [281], [285], [296], [307], [311], [315], [319], [323], [327], [331], [342], [346], [350], [354], [358], [362], [366], [370], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [837], [839], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-11 17:56:30,877 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:56:30,878 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:56:30,948 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 17:56:30,949 INFO L272 AbstractInterpreter]: Visited 149 different actions 292 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-09-11 17:56:30,988 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 17:56:31,175 INFO L232 lantSequenceWeakener]: Weakened 157 states. On average, predicates are now at 81.41% of their original sizes. [2018-09-11 17:56:31,176 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 17:56:31,667 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 17:56:31,667 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 17:56:31,668 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 17:56:31,668 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 17:56:31,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 17:56:31,669 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 17:56:31,669 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 17:56:31,669 INFO L87 Difference]: Start difference. First operand 527 states and 690 transitions. Second operand 9 states. [2018-09-11 17:56:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 17:56:33,969 INFO L93 Difference]: Finished difference Result 1199 states and 1665 transitions. [2018-09-11 17:56:33,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-11 17:56:33,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 160 [2018-09-11 17:56:33,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 17:56:33,978 INFO L225 Difference]: With dead ends: 1199 [2018-09-11 17:56:33,978 INFO L226 Difference]: Without dead ends: 678 [2018-09-11 17:56:33,980 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 166 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-11 17:56:33,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2018-09-11 17:56:34,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 674. [2018-09-11 17:56:34,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-09-11 17:56:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 849 transitions. [2018-09-11 17:56:34,026 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 849 transitions. Word has length 160 [2018-09-11 17:56:34,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 17:56:34,028 INFO L480 AbstractCegarLoop]: Abstraction has 674 states and 849 transitions. [2018-09-11 17:56:34,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 17:56:34,028 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 849 transitions. [2018-09-11 17:56:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-11 17:56:34,032 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:56:34,032 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-11 17:56:34,033 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 17:56:34,033 INFO L82 PathProgramCache]: Analyzing trace with hash -749334886, now seen corresponding path program 1 times [2018-09-11 17:56:34,033 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:56:34,036 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-09-11 17:56:34,037 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [8], [12], [16], [20], [23], [24], [28], [32], [36], [40], [51], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [169], [173], [177], [181], [185], [189], [193], [197], [208], [212], [216], [220], [231], [235], [239], [243], [247], [251], [255], [266], [270], [281], [285], [296], [307], [311], [315], [319], [323], [327], [331], [342], [346], [350], [354], [358], [362], [366], [370], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [837], [839], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-11 17:56:34,047 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:56:34,047 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:56:34,187 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 17:56:34,187 INFO L272 AbstractInterpreter]: Visited 150 different actions 590 times. Merged at 7 different actions 23 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 38 variables. [2018-09-11 17:56:34,226 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 17:56:34,401 INFO L232 lantSequenceWeakener]: Weakened 167 states. On average, predicates are now at 83.05% of their original sizes. [2018-09-11 17:56:34,401 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 17:56:34,751 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 17:56:34,752 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 17:56:34,752 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 17:56:34,752 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 17:56:34,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 17:56:34,753 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 17:56:34,753 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 17:56:34,754 INFO L87 Difference]: Start difference. First operand 674 states and 849 transitions. Second operand 9 states. [2018-09-11 17:56:37,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 17:56:37,757 INFO L93 Difference]: Finished difference Result 1505 states and 1999 transitions. [2018-09-11 17:56:37,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-11 17:56:37,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 170 [2018-09-11 17:56:37,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 17:56:37,765 INFO L225 Difference]: With dead ends: 1505 [2018-09-11 17:56:37,766 INFO L226 Difference]: Without dead ends: 837 [2018-09-11 17:56:37,767 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 176 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-11 17:56:37,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2018-09-11 17:56:37,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 828. [2018-09-11 17:56:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-09-11 17:56:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1043 transitions. [2018-09-11 17:56:37,794 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1043 transitions. Word has length 170 [2018-09-11 17:56:37,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 17:56:37,795 INFO L480 AbstractCegarLoop]: Abstraction has 828 states and 1043 transitions. [2018-09-11 17:56:37,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 17:56:37,795 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1043 transitions. [2018-09-11 17:56:37,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-09-11 17:56:37,799 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:56:37,799 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-11 17:56:37,799 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 17:56:37,800 INFO L82 PathProgramCache]: Analyzing trace with hash 23969521, now seen corresponding path program 1 times [2018-09-11 17:56:37,800 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:56:37,800 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 180 with the following transitions: [2018-09-11 17:56:37,801 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [12], [16], [20], [23], [24], [28], [32], [36], [40], [51], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [169], [173], [177], [181], [185], [189], [193], [197], [208], [212], [216], [220], [231], [235], [239], [243], [247], [251], [255], [266], [270], [281], [285], [296], [307], [311], [315], [319], [323], [327], [331], [342], [346], [350], [354], [358], [362], [366], [370], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [837], [839], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-11 17:56:37,803 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:56:37,803 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:56:37,997 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 17:56:37,998 INFO L272 AbstractInterpreter]: Visited 151 different actions 895 times. Merged at 8 different actions 44 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 1 different actions. Largest state had 38 variables. [2018-09-11 17:56:38,036 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 17:56:38,165 INFO L232 lantSequenceWeakener]: Weakened 176 states. On average, predicates are now at 85.28% of their original sizes. [2018-09-11 17:56:38,166 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 17:56:38,247 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 17:56:38,248 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 17:56:38,248 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 17:56:38,248 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 17:56:38,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 17:56:38,249 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 17:56:38,249 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 17:56:38,249 INFO L87 Difference]: Start difference. First operand 828 states and 1043 transitions. Second operand 9 states. [2018-09-11 17:56:40,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 17:56:40,693 INFO L93 Difference]: Finished difference Result 1885 states and 2519 transitions. [2018-09-11 17:56:40,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-11 17:56:40,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 179 [2018-09-11 17:56:40,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 17:56:40,699 INFO L225 Difference]: With dead ends: 1885 [2018-09-11 17:56:40,699 INFO L226 Difference]: Without dead ends: 1063 [2018-09-11 17:56:40,702 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 189 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2018-09-11 17:56:40,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2018-09-11 17:56:40,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1052. [2018-09-11 17:56:40,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2018-09-11 17:56:40,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1328 transitions. [2018-09-11 17:56:40,733 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1328 transitions. Word has length 179 [2018-09-11 17:56:40,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 17:56:40,734 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 1328 transitions. [2018-09-11 17:56:40,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 17:56:40,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1328 transitions. [2018-09-11 17:56:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-09-11 17:56:40,738 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:56:40,739 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-11 17:56:40,739 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 17:56:40,739 INFO L82 PathProgramCache]: Analyzing trace with hash -479194193, now seen corresponding path program 1 times [2018-09-11 17:56:40,739 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:56:40,740 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2018-09-11 17:56:40,740 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [20], [23], [24], [28], [32], [36], [40], [51], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [169], [173], [177], [181], [185], [189], [193], [197], [208], [212], [216], [220], [231], [235], [239], [243], [247], [251], [255], [266], [270], [281], [285], [296], [307], [311], [315], [319], [323], [327], [331], [342], [346], [350], [354], [358], [362], [366], [370], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [837], [839], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-11 17:56:40,742 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:56:40,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:56:40,825 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 17:56:40,825 INFO L272 AbstractInterpreter]: Visited 150 different actions 442 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-09-11 17:56:40,867 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 17:56:41,028 INFO L232 lantSequenceWeakener]: Weakened 180 states. On average, predicates are now at 81.91% of their original sizes. [2018-09-11 17:56:41,029 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 17:56:41,140 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 17:56:41,140 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 17:56:41,141 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-11 17:56:41,141 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 17:56:41,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-11 17:56:41,142 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-11 17:56:41,142 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-11 17:56:41,142 INFO L87 Difference]: Start difference. First operand 1052 states and 1328 transitions. Second operand 10 states. [2018-09-11 17:56:45,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 17:56:45,023 INFO L93 Difference]: Finished difference Result 2628 states and 3535 transitions. [2018-09-11 17:56:45,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-11 17:56:45,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 183 [2018-09-11 17:56:45,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 17:56:45,031 INFO L225 Difference]: With dead ends: 2628 [2018-09-11 17:56:45,032 INFO L226 Difference]: Without dead ends: 1582 [2018-09-11 17:56:45,035 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 196 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2018-09-11 17:56:45,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-09-11 17:56:45,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1565. [2018-09-11 17:56:45,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2018-09-11 17:56:45,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 1963 transitions. [2018-09-11 17:56:45,084 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 1963 transitions. Word has length 183 [2018-09-11 17:56:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 17:56:45,085 INFO L480 AbstractCegarLoop]: Abstraction has 1565 states and 1963 transitions. [2018-09-11 17:56:45,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-11 17:56:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1963 transitions. [2018-09-11 17:56:45,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-09-11 17:56:45,090 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:56:45,091 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-11 17:56:45,091 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 17:56:45,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1887001442, now seen corresponding path program 1 times [2018-09-11 17:56:45,091 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:56:45,092 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-09-11 17:56:45,092 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [8], [12], [16], [20], [23], [24], [28], [32], [36], [40], [51], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [169], [173], [177], [181], [185], [189], [193], [197], [208], [212], [216], [220], [231], [235], [239], [243], [247], [251], [255], [266], [270], [281], [285], [296], [307], [311], [315], [319], [323], [327], [331], [342], [346], [350], [354], [358], [362], [366], [370], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [837], [839], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-11 17:56:45,094 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:56:45,094 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:56:45,244 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 17:56:45,244 INFO L272 AbstractInterpreter]: Visited 151 different actions 747 times. Merged at 8 different actions 36 times. Never widened. Found 9 fixpoints after 2 different actions. Largest state had 38 variables. [2018-09-11 17:56:45,271 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 17:56:45,410 INFO L232 lantSequenceWeakener]: Weakened 196 states. On average, predicates are now at 87.15% of their original sizes. [2018-09-11 17:56:45,410 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 17:56:45,558 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 17:56:45,558 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 17:56:45,558 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 17:56:45,558 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 17:56:45,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 17:56:45,559 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 17:56:45,559 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 17:56:45,560 INFO L87 Difference]: Start difference. First operand 1565 states and 1963 transitions. Second operand 9 states. [2018-09-11 17:56:48,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 17:56:48,505 INFO L93 Difference]: Finished difference Result 3474 states and 4505 transitions. [2018-09-11 17:56:48,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-11 17:56:48,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 199 [2018-09-11 17:56:48,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 17:56:48,516 INFO L225 Difference]: With dead ends: 3474 [2018-09-11 17:56:48,516 INFO L226 Difference]: Without dead ends: 1915 [2018-09-11 17:56:48,520 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 208 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2018-09-11 17:56:48,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2018-09-11 17:56:48,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1874. [2018-09-11 17:56:48,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2018-09-11 17:56:48,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2394 transitions. [2018-09-11 17:56:48,574 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2394 transitions. Word has length 199 [2018-09-11 17:56:48,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 17:56:48,575 INFO L480 AbstractCegarLoop]: Abstraction has 1874 states and 2394 transitions. [2018-09-11 17:56:48,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 17:56:48,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2394 transitions. [2018-09-11 17:56:48,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-11 17:56:48,581 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:56:48,582 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-11 17:56:48,582 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 17:56:48,582 INFO L82 PathProgramCache]: Analyzing trace with hash 205825024, now seen corresponding path program 1 times [2018-09-11 17:56:48,582 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:56:48,583 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 207 with the following transitions: [2018-09-11 17:56:48,583 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [8], [12], [16], [20], [23], [24], [28], [32], [36], [40], [51], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [125], [126], [130], [134], [138], [142], [146], [150], [154], [158], [169], [173], [177], [181], [185], [189], [193], [197], [208], [212], [216], [220], [231], [235], [239], [243], [247], [251], [255], [266], [270], [281], [285], [296], [307], [311], [315], [319], [323], [327], [331], [342], [346], [350], [354], [358], [362], [366], [370], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [837], [839], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-11 17:56:48,584 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:56:48,585 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:56:48,723 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-11 17:56:48,723 INFO L272 AbstractInterpreter]: Visited 152 different actions 748 times. Merged at 8 different actions 36 times. Never widened. Found 9 fixpoints after 2 different actions. Largest state had 38 variables. [2018-09-11 17:56:48,762 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-11 17:56:48,801 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-11 17:56:48,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 05:56:48 BoogieIcfgContainer [2018-09-11 17:56:48,801 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-11 17:56:48,802 INFO L168 Benchmark]: Toolchain (without parser) took 31520.93 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 93.4 MB. Max. memory is 7.1 GB. [2018-09-11 17:56:48,804 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-11 17:56:48,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2018-09-11 17:56:48,806 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-11 17:56:48,806 INFO L168 Benchmark]: Boogie Preprocessor took 287.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -844.0 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. [2018-09-11 17:56:48,807 INFO L168 Benchmark]: RCFGBuilder took 3376.66 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 111.6 MB). Peak memory consumption was 111.6 MB. Max. memory is 7.1 GB. [2018-09-11 17:56:48,808 INFO L168 Benchmark]: TraceAbstraction took 27008.02 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 405.8 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -381.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2018-09-11 17:56:48,813 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 726.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 111.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 287.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -844.0 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3376.66 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 111.6 MB). Peak memory consumption was 111.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27008.02 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 405.8 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -381.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 589]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible 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 TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] RET return 22; [L614] 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 TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L51] a28 = 11 [L52] a25 = 1 [L53] RET return 26; [L614] 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 TRUE ((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1))) [L170] a17 = 7 [L171] a11 = 1 [L172] a28 = 7 [L173] a25 = 1 [L174] RET return -1; [L614] 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 FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) [L432] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) [L435] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) [L438] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L441] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==8))) [L444] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==11))&&!(a19==1))&&(a21==1))&&(a17==8))) [L447] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L450] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==7))) [L453] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) [L456] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==11))&&(a19==1))&&(a21==1))&&(a17==7))) [L459] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==7))) [L462] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==7))) [L465] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) [L468] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L471] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==8))) [L474] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==8))) [L477] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==7))) [L480] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==11))&&!(a19==1))&&(a21==1))&&(a17==8))) [L483] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==8))&&!(a19==1))&&(a21==1))&&(a17==8))) [L486] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==8))) [L489] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==7))) [L492] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==11))&&(a19==1))&&(a21==1))&&(a17==8))) [L495] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==8))&&!(a19==1))&&(a21==1))&&(a17==7))) [L498] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==8))&&!(a19==1))&&(a21==1))&&(a17==7))) [L501] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==8))&&!(a19==1))&&(a21==1))&&(a17==8))) [L504] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L507] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L510] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==7))) [L513] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==7))) [L516] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L519] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==8))&&!(a19==1))&&(a21==1))&&(a17==7))) [L522] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) [L525] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==8))&&!(a19==1))&&(a21==1))&&(a17==7))) [L528] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==11))&&!(a19==1))&&(a21==1))&&(a17==7))) [L531] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==11))&&!(a19==1))&&(a21==1))&&(a17==7))) [L534] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==7))) [L537] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==11))&&(a19==1))&&(a21==1))&&(a17==7))) [L540] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==8))) [L543] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==11))&&(a19==1))&&(a21==1))&&(a17==7))) [L546] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L549] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==7))) [L552] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==11))&&!(a19==1))&&(a21==1))&&(a17==7))) [L555] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==7))) [L558] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==7))) [L561] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) [L564] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==11))&&!(a19==1))&&(a21==1))&&(a17==7))) [L567] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) [L570] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==7))) [L573] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==7))) [L576] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==7))) [L579] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==7))) [L582] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==11))&&(a19==1))&&(a21==1))&&(a17==8))) [L585] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==8))) [L588] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==11))&&(a19==1))&&(a21==1))&&(a17==7)) [L589] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. UNKNOWN Result, 26.9s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 21.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1518 SDtfs, 4879 SDslu, 2421 SDs, 0 SdLazy, 11596 SolverSat, 1671 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.8s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 1243 GetRequests, 1139 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1874occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.5s AbstIntTime, 8 AbstIntIterations, 7 AbstIntStrong, 0.9975370819785471 AbsIntWeakeningRatio, 0.18465430016863407 AbsIntAvgWeakeningVarsNumRemoved, 16.53035413153457 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 89 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label07_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-11_17-56-48-830.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label07_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-11_17-56-48-830.csv Received shutdown request...