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_label35_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-11 17:57:28,688 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-11 17:57:28,690 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-11 17:57:28,705 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-11 17:57:28,706 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-11 17:57:28,707 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-11 17:57:28,708 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-11 17:57:28,710 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-11 17:57:28,712 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-11 17:57:28,712 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-11 17:57:28,713 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-11 17:57:28,714 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-11 17:57:28,715 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-11 17:57:28,716 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-11 17:57:28,719 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-11 17:57:28,720 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-11 17:57:28,720 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-11 17:57:28,722 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-11 17:57:28,724 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-11 17:57:28,726 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-11 17:57:28,729 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-11 17:57:28,731 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-11 17:57:28,736 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-11 17:57:28,736 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-11 17:57:28,736 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-11 17:57:28,737 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-11 17:57:28,738 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-11 17:57:28,739 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-11 17:57:28,741 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-11 17:57:28,742 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-11 17:57:28,744 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-11 17:57:28,744 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-11 17:57:28,745 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-11 17:57:28,745 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-11 17:57:28,748 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-11 17:57:28,749 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-11 17:57:28,750 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:57:28,779 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-11 17:57:28,781 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-11 17:57:28,782 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-11 17:57:28,782 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-11 17:57:28,782 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-11 17:57:28,782 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-11 17:57:28,785 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-11 17:57:28,786 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-11 17:57:28,786 INFO L133 SettingsManager]: * Abstract domain=CongruenceDomain [2018-09-11 17:57:28,786 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-11 17:57:28,786 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-11 17:57:28,786 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-11 17:57:28,787 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-11 17:57:28,788 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-11 17:57:28,789 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-11 17:57:28,789 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-11 17:57:28,789 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-11 17:57:28,789 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-11 17:57:28,790 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-11 17:57:28,791 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-11 17:57:28,791 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-11 17:57:28,791 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-11 17:57:28,791 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-11 17:57:28,791 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-11 17:57:28,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-11 17:57:28,792 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-11 17:57:28,792 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-11 17:57:28,792 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-11 17:57:28,792 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-11 17:57:28,793 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-11 17:57:28,793 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-11 17:57:28,793 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-11 17:57:28,793 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-11 17:57:28,794 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-11 17:57:28,844 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-11 17:57:28,856 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-11 17:57:28,860 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-11 17:57:28,861 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-11 17:57:28,862 INFO L276 PluginConnector]: CDTParser initialized [2018-09-11 17:57:28,863 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label35_true-unreach-call_false-termination.c [2018-09-11 17:57:29,226 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1bdd6df/7c01c384539843adbda9a20066a2836d/FLAG3ca413e74 [2018-09-11 17:57:29,510 INFO L276 CDTParser]: Found 1 translation units. [2018-09-11 17:57:29,511 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label35_true-unreach-call_false-termination.c [2018-09-11 17:57:29,535 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1bdd6df/7c01c384539843adbda9a20066a2836d/FLAG3ca413e74 [2018-09-11 17:57:29,558 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1bdd6df/7c01c384539843adbda9a20066a2836d [2018-09-11 17:57:29,571 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-11 17:57:29,574 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-11 17:57:29,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-11 17:57:29,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-11 17:57:29,584 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-11 17:57:29,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 05:57:29" (1/1) ... [2018-09-11 17:57:29,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e987693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:57:29, skipping insertion in model container [2018-09-11 17:57:29,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 05:57:29" (1/1) ... [2018-09-11 17:57:29,834 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-11 17:57:30,140 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-11 17:57:30,168 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-11 17:57:30,279 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-11 17:57:30,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:57:30 WrapperNode [2018-09-11 17:57:30,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-11 17:57:30,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-11 17:57:30,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-11 17:57:30,313 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-11 17:57:30,323 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:57:30" (1/1) ... [2018-09-11 17:57:30,341 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:57:30" (1/1) ... [2018-09-11 17:57:30,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-11 17:57:30,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-11 17:57:30,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-11 17:57:30,401 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-11 17:57:30,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:57:30" (1/1) ... [2018-09-11 17:57:30,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:57:30" (1/1) ... [2018-09-11 17:57:30,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:57:30" (1/1) ... [2018-09-11 17:57:30,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:57:30" (1/1) ... [2018-09-11 17:57:30,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:57:30" (1/1) ... [2018-09-11 17:57:30,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:57:30" (1/1) ... [2018-09-11 17:57:30,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:57:30" (1/1) ... [2018-09-11 17:57:30,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-11 17:57:30,589 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-11 17:57:30,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-11 17:57:30,589 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-11 17:57:30,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:57:30" (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:57:30,676 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:57:30,676 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:57:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-11 17:57:30,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-11 17:57:30,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-11 17:57:30,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-11 17:57:30,677 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-11 17:57:30,677 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-11 17:57:34,101 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-11 17:57:34,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 05:57:34 BoogieIcfgContainer [2018-09-11 17:57:34,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-11 17:57:34,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-11 17:57:34,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-11 17:57:34,111 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-11 17:57:34,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 05:57:29" (1/3) ... [2018-09-11 17:57:34,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37bda7ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 05:57:34, skipping insertion in model container [2018-09-11 17:57:34,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:57:30" (2/3) ... [2018-09-11 17:57:34,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37bda7ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 05:57:34, skipping insertion in model container [2018-09-11 17:57:34,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 05:57:34" (3/3) ... [2018-09-11 17:57:34,118 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label35_true-unreach-call_false-termination.c [2018-09-11 17:57:34,128 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-11 17:57:34,139 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-11 17:57:34,194 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-11 17:57:34,194 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-11 17:57:34,195 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-11 17:57:34,195 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-11 17:57:34,195 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-11 17:57:34,195 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-11 17:57:34,196 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-11 17:57:34,196 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-11 17:57:34,196 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-11 17:57:34,222 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-09-11 17:57:34,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-11 17:57:34,237 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:57:34,239 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] [2018-09-11 17:57:34,240 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:57:34,245 INFO L82 PathProgramCache]: Analyzing trace with hash -429057259, now seen corresponding path program 1 times [2018-09-11 17:57:34,247 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:57:34,248 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2018-09-11 17:57:34,251 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], [477], [479], [862], [863], [867], [871], [877], [881], [888], [889], [890], [892] [2018-09-11 17:57:34,284 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:57:34,285 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:57:34,526 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 17:57:34,529 INFO L272 AbstractInterpreter]: Visited 100 different actions 100 times. Never merged. Never widened. Never found a fixpoint. Largest state had 37 variables. [2018-09-11 17:57:34,559 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 17:57:34,802 INFO L232 lantSequenceWeakener]: Weakened 98 states. On average, predicates are now at 80.55% of their original sizes. [2018-09-11 17:57:34,803 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 17:57:35,082 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 17:57:35,084 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 17:57:35,084 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-11 17:57:35,084 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 17:57:35,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-11 17:57:35,098 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-11 17:57:35,099 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-11 17:57:35,101 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 6 states. [2018-09-11 17:57:38,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 17:57:38,893 INFO L93 Difference]: Finished difference Result 622 states and 1061 transitions. [2018-09-11 17:57:38,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-11 17:57:38,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-09-11 17:57:38,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 17:57:38,913 INFO L225 Difference]: With dead ends: 622 [2018-09-11 17:57:38,913 INFO L226 Difference]: Without dead ends: 383 [2018-09-11 17:57:38,920 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 101 GetRequests, 96 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:57:38,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-09-11 17:57:38,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 380. [2018-09-11 17:57:38,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-09-11 17:57:38,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 531 transitions. [2018-09-11 17:57:38,992 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 531 transitions. Word has length 101 [2018-09-11 17:57:38,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 17:57:38,993 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 531 transitions. [2018-09-11 17:57:38,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-11 17:57:38,994 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 531 transitions. [2018-09-11 17:57:39,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-11 17:57:39,007 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:57:39,007 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] [2018-09-11 17:57:39,008 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:57:39,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1156587948, now seen corresponding path program 1 times [2018-09-11 17:57:39,008 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:57:39,012 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2018-09-11 17:57:39,013 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], [477], [479], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-11 17:57:39,019 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:57:39,019 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:57:39,179 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 17:57:39,180 INFO L272 AbstractInterpreter]: Visited 104 different actions 202 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:57:39,220 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 17:57:39,422 INFO L232 lantSequenceWeakener]: Weakened 108 states. On average, predicates are now at 80.64% of their original sizes. [2018-09-11 17:57:39,423 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 17:57:39,649 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 17:57:39,649 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 17:57:39,649 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 17:57:39,649 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 17:57:39,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 17:57:39,651 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 17:57:39,651 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 17:57:39,652 INFO L87 Difference]: Start difference. First operand 380 states and 531 transitions. Second operand 9 states. [2018-09-11 17:57:44,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 17:57:44,052 INFO L93 Difference]: Finished difference Result 905 states and 1347 transitions. [2018-09-11 17:57:44,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-11 17:57:44,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2018-09-11 17:57:44,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 17:57:44,058 INFO L225 Difference]: With dead ends: 905 [2018-09-11 17:57:44,058 INFO L226 Difference]: Without dead ends: 531 [2018-09-11 17:57:44,061 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 117 GetRequests, 103 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:57:44,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-09-11 17:57:44,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 527. [2018-09-11 17:57:44,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-09-11 17:57:44,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 690 transitions. [2018-09-11 17:57:44,094 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 690 transitions. Word has length 111 [2018-09-11 17:57:44,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 17:57:44,095 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 690 transitions. [2018-09-11 17:57:44,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 17:57:44,095 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 690 transitions. [2018-09-11 17:57:44,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-11 17:57:44,098 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:57:44,098 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] [2018-09-11 17:57:44,099 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:57:44,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1987616036, now seen corresponding path program 1 times [2018-09-11 17:57:44,099 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:57:44,100 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2018-09-11 17:57:44,100 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], [477], [479], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-11 17:57:44,103 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:57:44,103 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:57:44,160 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 17:57:44,160 INFO L272 AbstractInterpreter]: Visited 104 different actions 202 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:57:44,201 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 17:57:44,316 INFO L232 lantSequenceWeakener]: Weakened 112 states. On average, predicates are now at 80.64% of their original sizes. [2018-09-11 17:57:44,316 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 17:57:44,936 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 17:57:44,937 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 17:57:44,937 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 17:57:44,937 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 17:57:44,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 17:57:44,938 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 17:57:44,938 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 17:57:44,939 INFO L87 Difference]: Start difference. First operand 527 states and 690 transitions. Second operand 9 states. [2018-09-11 17:57:48,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 17:57:48,283 INFO L93 Difference]: Finished difference Result 1199 states and 1665 transitions. [2018-09-11 17:57:48,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-11 17:57:48,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2018-09-11 17:57:48,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 17:57:48,290 INFO L225 Difference]: With dead ends: 1199 [2018-09-11 17:57:48,290 INFO L226 Difference]: Without dead ends: 678 [2018-09-11 17:57:48,293 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 121 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-11 17:57:48,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2018-09-11 17:57:48,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 674. [2018-09-11 17:57:48,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-09-11 17:57:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 849 transitions. [2018-09-11 17:57:48,337 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 849 transitions. Word has length 115 [2018-09-11 17:57:48,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 17:57:48,338 INFO L480 AbstractCegarLoop]: Abstraction has 674 states and 849 transitions. [2018-09-11 17:57:48,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 17:57:48,338 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 849 transitions. [2018-09-11 17:57:48,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-09-11 17:57:48,348 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:57:48,348 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] [2018-09-11 17:57:48,349 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:57:48,350 INFO L82 PathProgramCache]: Analyzing trace with hash -644346917, now seen corresponding path program 1 times [2018-09-11 17:57:48,350 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:57:48,350 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2018-09-11 17:57:48,351 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], [477], [479], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-11 17:57:48,355 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:57:48,355 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:57:48,481 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 17:57:48,482 INFO L272 AbstractInterpreter]: Visited 105 different actions 410 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:57:48,522 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 17:57:48,661 INFO L232 lantSequenceWeakener]: Weakened 122 states. On average, predicates are now at 82.22% of their original sizes. [2018-09-11 17:57:48,661 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 17:57:48,816 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 17:57:48,816 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 17:57:48,816 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 17:57:48,816 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 17:57:48,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 17:57:48,817 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 17:57:48,817 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 17:57:48,818 INFO L87 Difference]: Start difference. First operand 674 states and 849 transitions. Second operand 9 states. [2018-09-11 17:57:52,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 17:57:52,030 INFO L93 Difference]: Finished difference Result 1505 states and 1999 transitions. [2018-09-11 17:57:52,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-11 17:57:52,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 125 [2018-09-11 17:57:52,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 17:57:52,036 INFO L225 Difference]: With dead ends: 1505 [2018-09-11 17:57:52,036 INFO L226 Difference]: Without dead ends: 837 [2018-09-11 17:57:52,038 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 131 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-11 17:57:52,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2018-09-11 17:57:52,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 828. [2018-09-11 17:57:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-09-11 17:57:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1043 transitions. [2018-09-11 17:57:52,065 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1043 transitions. Word has length 125 [2018-09-11 17:57:52,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 17:57:52,066 INFO L480 AbstractCegarLoop]: Abstraction has 828 states and 1043 transitions. [2018-09-11 17:57:52,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 17:57:52,066 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1043 transitions. [2018-09-11 17:57:52,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-11 17:57:52,069 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:57:52,069 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] [2018-09-11 17:57:52,069 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:57:52,070 INFO L82 PathProgramCache]: Analyzing trace with hash -25625052, now seen corresponding path program 1 times [2018-09-11 17:57:52,070 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:57:52,070 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2018-09-11 17:57:52,071 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], [477], [479], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-11 17:57:52,073 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:57:52,073 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:57:52,251 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 17:57:52,251 INFO L272 AbstractInterpreter]: Visited 106 different actions 625 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:57:52,290 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 17:57:52,433 INFO L232 lantSequenceWeakener]: Weakened 131 states. On average, predicates are now at 84.51% of their original sizes. [2018-09-11 17:57:52,433 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 17:57:52,578 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 17:57:52,579 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 17:57:52,579 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 17:57:52,579 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 17:57:52,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 17:57:52,580 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 17:57:52,580 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 17:57:52,580 INFO L87 Difference]: Start difference. First operand 828 states and 1043 transitions. Second operand 9 states. [2018-09-11 17:57:54,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 17:57:54,711 INFO L93 Difference]: Finished difference Result 1885 states and 2519 transitions. [2018-09-11 17:57:54,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-11 17:57:54,711 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2018-09-11 17:57:54,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 17:57:54,717 INFO L225 Difference]: With dead ends: 1885 [2018-09-11 17:57:54,717 INFO L226 Difference]: Without dead ends: 1063 [2018-09-11 17:57:54,720 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 144 GetRequests, 126 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:57:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2018-09-11 17:57:54,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1052. [2018-09-11 17:57:54,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2018-09-11 17:57:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1328 transitions. [2018-09-11 17:57:54,754 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1328 transitions. Word has length 134 [2018-09-11 17:57:54,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 17:57:54,754 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 1328 transitions. [2018-09-11 17:57:54,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 17:57:54,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1328 transitions. [2018-09-11 17:57:54,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-11 17:57:54,758 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:57:54,758 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] [2018-09-11 17:57:54,759 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:57:54,759 INFO L82 PathProgramCache]: Analyzing trace with hash 2015384742, now seen corresponding path program 1 times [2018-09-11 17:57:54,759 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:57:54,759 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 139 with the following transitions: [2018-09-11 17:57:54,760 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], [477], [479], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-11 17:57:54,762 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:57:54,762 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:57:54,857 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 17:57:54,857 INFO L272 AbstractInterpreter]: Visited 105 different actions 307 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:57:54,883 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 17:57:55,088 INFO L232 lantSequenceWeakener]: Weakened 135 states. On average, predicates are now at 80.78% of their original sizes. [2018-09-11 17:57:55,088 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 17:57:55,495 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 17:57:55,495 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 17:57:55,495 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-11 17:57:55,496 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 17:57:55,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-11 17:57:55,497 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-11 17:57:55,497 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-11 17:57:55,498 INFO L87 Difference]: Start difference. First operand 1052 states and 1328 transitions. Second operand 10 states. [2018-09-11 17:57:59,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 17:57:59,299 INFO L93 Difference]: Finished difference Result 2628 states and 3535 transitions. [2018-09-11 17:57:59,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-11 17:57:59,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 138 [2018-09-11 17:57:59,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 17:57:59,308 INFO L225 Difference]: With dead ends: 2628 [2018-09-11 17:57:59,308 INFO L226 Difference]: Without dead ends: 1582 [2018-09-11 17:57:59,312 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 151 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2018-09-11 17:57:59,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-09-11 17:57:59,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1565. [2018-09-11 17:57:59,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2018-09-11 17:57:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 1963 transitions. [2018-09-11 17:57:59,363 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 1963 transitions. Word has length 138 [2018-09-11 17:57:59,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 17:57:59,364 INFO L480 AbstractCegarLoop]: Abstraction has 1565 states and 1963 transitions. [2018-09-11 17:57:59,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-11 17:57:59,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1963 transitions. [2018-09-11 17:57:59,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-11 17:57:59,368 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:57:59,369 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] [2018-09-11 17:57:59,369 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:57:59,369 INFO L82 PathProgramCache]: Analyzing trace with hash 372668947, now seen corresponding path program 1 times [2018-09-11 17:57:59,369 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:57:59,369 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 155 with the following transitions: [2018-09-11 17:57:59,370 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], [477], [479], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-11 17:57:59,371 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:57:59,372 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:57:59,492 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 17:57:59,493 INFO L272 AbstractInterpreter]: Visited 106 different actions 522 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:57:59,530 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 17:57:59,649 INFO L232 lantSequenceWeakener]: Weakened 151 states. On average, predicates are now at 86.3% of their original sizes. [2018-09-11 17:57:59,650 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 17:57:59,762 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 17:57:59,762 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 17:57:59,762 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 17:57:59,762 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 17:57:59,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 17:57:59,763 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 17:57:59,763 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 17:57:59,763 INFO L87 Difference]: Start difference. First operand 1565 states and 1963 transitions. Second operand 9 states. [2018-09-11 17:58:02,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 17:58:02,444 INFO L93 Difference]: Finished difference Result 3474 states and 4505 transitions. [2018-09-11 17:58:02,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-11 17:58:02,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 154 [2018-09-11 17:58:02,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 17:58:02,458 INFO L225 Difference]: With dead ends: 3474 [2018-09-11 17:58:02,459 INFO L226 Difference]: Without dead ends: 1915 [2018-09-11 17:58:02,463 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 163 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2018-09-11 17:58:02,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2018-09-11 17:58:02,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1874. [2018-09-11 17:58:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2018-09-11 17:58:02,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2394 transitions. [2018-09-11 17:58:02,524 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2394 transitions. Word has length 154 [2018-09-11 17:58:02,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 17:58:02,524 INFO L480 AbstractCegarLoop]: Abstraction has 1874 states and 2394 transitions. [2018-09-11 17:58:02,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 17:58:02,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2394 transitions. [2018-09-11 17:58:02,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-09-11 17:58:02,529 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:58:02,530 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] [2018-09-11 17:58:02,530 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:58:02,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1421963083, now seen corresponding path program 1 times [2018-09-11 17:58:02,530 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:58:02,531 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 162 with the following transitions: [2018-09-11 17:58:02,531 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], [477], [479], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-11 17:58:02,532 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:58:02,532 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:58:02,660 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 17:58:02,660 INFO L272 AbstractInterpreter]: Visited 106 different actions 522 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:58:02,703 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 17:58:02,829 INFO L232 lantSequenceWeakener]: Weakened 158 states. On average, predicates are now at 84.17% of their original sizes. [2018-09-11 17:58:02,830 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 17:58:03,007 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 17:58:03,007 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 17:58:03,007 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 17:58:03,007 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 17:58:03,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 17:58:03,008 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 17:58:03,008 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 17:58:03,009 INFO L87 Difference]: Start difference. First operand 1874 states and 2394 transitions. Second operand 9 states. [2018-09-11 17:58:06,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 17:58:06,743 INFO L93 Difference]: Finished difference Result 4106 states and 5378 transitions. [2018-09-11 17:58:06,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-11 17:58:06,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 161 [2018-09-11 17:58:06,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 17:58:06,763 INFO L225 Difference]: With dead ends: 4106 [2018-09-11 17:58:06,763 INFO L226 Difference]: Without dead ends: 2238 [2018-09-11 17:58:06,769 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 170 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2018-09-11 17:58:06,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2018-09-11 17:58:06,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 2194. [2018-09-11 17:58:06,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2194 states. [2018-09-11 17:58:06,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 2194 states and 2847 transitions. [2018-09-11 17:58:06,833 INFO L78 Accepts]: Start accepts. Automaton has 2194 states and 2847 transitions. Word has length 161 [2018-09-11 17:58:06,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 17:58:06,834 INFO L480 AbstractCegarLoop]: Abstraction has 2194 states and 2847 transitions. [2018-09-11 17:58:06,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 17:58:06,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2194 states and 2847 transitions. [2018-09-11 17:58:06,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-09-11 17:58:06,841 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:58:06,841 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-11 17:58:06,841 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__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:58:06,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1348677279, now seen corresponding path program 1 times [2018-09-11 17:58:06,842 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:58:06,842 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 186 with the following transitions: [2018-09-11 17:58:06,842 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], [105], [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], [477], [479], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-11 17:58:06,844 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:58:06,844 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:58:07,001 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-11 17:58:07,001 INFO L272 AbstractInterpreter]: Visited 108 different actions 637 times. Merged at 9 different actions 49 times. Widened at 1 different actions 1 times. Found 13 fixpoints after 2 different actions. Largest state had 38 variables. [2018-09-11 17:58:07,029 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-11 17:58:07,074 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-11 17:58:07,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 05:58:07 BoogieIcfgContainer [2018-09-11 17:58:07,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-11 17:58:07,076 INFO L168 Benchmark]: Toolchain (without parser) took 37504.57 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 1.8 GB in the end (delta: -371.1 MB). Peak memory consumption was 804.3 MB. Max. memory is 7.1 GB. [2018-09-11 17:58:07,078 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:58:07,079 INFO L168 Benchmark]: CACSL2BoogieTranslator took 736.13 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-11 17:58:07,080 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.69 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:58:07,080 INFO L168 Benchmark]: Boogie Preprocessor took 187.07 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 763.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -847.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2018-09-11 17:58:07,081 INFO L168 Benchmark]: RCFGBuilder took 3515.92 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: 132.4 MB). Peak memory consumption was 132.4 MB. Max. memory is 7.1 GB. [2018-09-11 17:58:07,082 INFO L168 Benchmark]: TraceAbstraction took 32969.71 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 411.6 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 312.1 MB). Peak memory consumption was 723.6 MB. Max. memory is 7.1 GB. [2018-09-11 17:58:07,090 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 736.13 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 87.69 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 187.07 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 763.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -847.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3515.92 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: 132.4 MB). Peak memory consumption was 132.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32969.71 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 411.6 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 312.1 MB). Peak memory consumption was 723.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 454]: 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 TRUE (!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11))) [L135] a28 = 7 [L136] a19 = 0 [L137] a11 = 1 [L138] 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, 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 TRUE ((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8)) [L144] a17 = 7 [L145] a11 = 1 [L146] a25 = 1 [L147] 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 TRUE ((((((a25==1)&&!(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7)) [L454] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. UNKNOWN Result, 32.8s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 27.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1684 SDtfs, 6156 SDslu, 3295 SDs, 0 SdLazy, 15081 SolverSat, 2033 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.5s Time, PredicateUnifierStatistics: 16 DeclaredPredicates, 1098 GetRequests, 977 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2194occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.6s AbstIntTime, 9 AbstIntIterations, 8 AbstIntStrong, 0.996534043125532 AbsIntWeakeningRatio, 0.2502424830261882 AbsIntAvgWeakeningVarsNumRemoved, 16.533462657613967 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 133 StatesRemovedByMinimization, 8 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_label35_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-11_17-58-07-115.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label35_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-11_17-58-07-115.csv Received shutdown request...