java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label21.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:41:47,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:41:47,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:41:47,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:41:47,748 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:41:47,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:41:47,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:41:47,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:41:47,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:41:47,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:41:47,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:41:47,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:41:47,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:41:47,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:41:47,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:41:47,767 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:41:47,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:41:47,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:41:47,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:41:47,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:41:47,773 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:41:47,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:41:47,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:41:47,776 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:41:47,778 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:41:47,778 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:41:47,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:41:47,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:41:47,780 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:41:47,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:41:47,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:41:47,782 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:41:47,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:41:47,783 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:41:47,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:41:47,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:41:47,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:41:47,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:41:47,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:41:47,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:41:47,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:41:47,788 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:41:47,812 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:41:47,812 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:41:47,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:41:47,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:41:47,817 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:41:47,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:41:47,817 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:41:47,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:41:47,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:41:47,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:41:47,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:41:47,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:41:47,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:41:47,818 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:41:47,819 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:41:47,819 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:41:47,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:41:47,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:41:47,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:41:47,821 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:41:47,821 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:41:47,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:41:47,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:41:47,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:41:47,822 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:41:47,822 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:41:47,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:41:47,823 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:41:47,823 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 01:41:48,088 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:41:48,100 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:41:48,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:41:48,105 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:41:48,105 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:41:48,106 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label21.c [2019-10-15 01:41:48,180 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/430fe7233/a9b7687a63d6441e9adc1cba21e26b45/FLAG4a36256ba [2019-10-15 01:41:48,778 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:41:48,779 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label21.c [2019-10-15 01:41:48,789 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/430fe7233/a9b7687a63d6441e9adc1cba21e26b45/FLAG4a36256ba [2019-10-15 01:41:49,087 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/430fe7233/a9b7687a63d6441e9adc1cba21e26b45 [2019-10-15 01:41:49,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:41:49,099 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:41:49,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:41:49,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:41:49,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:41:49,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:41:49" (1/1) ... [2019-10-15 01:41:49,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60fb8ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:41:49, skipping insertion in model container [2019-10-15 01:41:49,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:41:49" (1/1) ... [2019-10-15 01:41:49,116 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:41:49,167 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:41:49,692 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:41:49,707 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:41:49,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:41:49,855 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:41:49,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:41:49 WrapperNode [2019-10-15 01:41:49,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:41:49,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:41:49,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:41:49,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:41:49,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:41:49" (1/1) ... [2019-10-15 01:41:49,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:41:49" (1/1) ... [2019-10-15 01:41:49,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:41:49" (1/1) ... [2019-10-15 01:41:49,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:41:49" (1/1) ... [2019-10-15 01:41:49,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:41:49" (1/1) ... [2019-10-15 01:41:49,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:41:49" (1/1) ... [2019-10-15 01:41:49,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:41:49" (1/1) ... [2019-10-15 01:41:49,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:41:49,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:41:49,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:41:49,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:41:49,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:41:49" (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 [2019-10-15 01:41:50,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:41:50,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:41:50,018 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-15 01:41:50,018 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:41:50,018 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-15 01:41:50,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:41:50,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:41:50,019 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:41:50,019 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:41:50,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:41:50,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:41:52,125 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:41:52,126 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:41:52,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:41:52 BoogieIcfgContainer [2019-10-15 01:41:52,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:41:52,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:41:52,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:41:52,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:41:52,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:41:49" (1/3) ... [2019-10-15 01:41:52,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b49fb9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:41:52, skipping insertion in model container [2019-10-15 01:41:52,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:41:49" (2/3) ... [2019-10-15 01:41:52,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b49fb9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:41:52, skipping insertion in model container [2019-10-15 01:41:52,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:41:52" (3/3) ... [2019-10-15 01:41:52,138 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label21.c [2019-10-15 01:41:52,150 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:41:52,162 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:41:52,175 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:41:52,212 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:41:52,213 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:41:52,215 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:41:52,215 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:41:52,215 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:41:52,216 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:41:52,216 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:41:52,216 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:41:52,256 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2019-10-15 01:41:52,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-15 01:41:52,270 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:41:52,271 INFO L380 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] [2019-10-15 01:41:52,273 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:41:52,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:41:52,279 INFO L82 PathProgramCache]: Analyzing trace with hash -219366601, now seen corresponding path program 1 times [2019-10-15 01:41:52,289 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:41:52,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738646800] [2019-10-15 01:41:52,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:41:52,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:41:52,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:41:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:41:52,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:41:52,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738646800] [2019-10-15 01:41:52,764 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:41:52,764 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:41:52,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395260472] [2019-10-15 01:41:52,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:41:52,770 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:41:52,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:41:52,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:41:52,789 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 3 states. [2019-10-15 01:41:53,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:41:53,367 INFO L93 Difference]: Finished difference Result 273 states and 508 transitions. [2019-10-15 01:41:53,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:41:53,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-10-15 01:41:53,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:41:53,394 INFO L225 Difference]: With dead ends: 273 [2019-10-15 01:41:53,394 INFO L226 Difference]: Without dead ends: 175 [2019-10-15 01:41:53,401 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:41:53,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-15 01:41:53,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-10-15 01:41:53,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-15 01:41:53,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 327 transitions. [2019-10-15 01:41:53,513 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 327 transitions. Word has length 86 [2019-10-15 01:41:53,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:41:53,515 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 327 transitions. [2019-10-15 01:41:53,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:41:53,516 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 327 transitions. [2019-10-15 01:41:53,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-15 01:41:53,531 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:41:53,531 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:41:53,531 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:41:53,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:41:53,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1874061938, now seen corresponding path program 1 times [2019-10-15 01:41:53,536 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:41:53,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551866846] [2019-10-15 01:41:53,537 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:41:53,537 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:41:53,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:41:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:41:53,757 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:41:53,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551866846] [2019-10-15 01:41:53,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:41:53,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:41:53,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998907305] [2019-10-15 01:41:53,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:41:53,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:41:53,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:41:53,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:41:53,765 INFO L87 Difference]: Start difference. First operand 175 states and 327 transitions. Second operand 6 states. [2019-10-15 01:41:54,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:41:54,132 INFO L93 Difference]: Finished difference Result 351 states and 663 transitions. [2019-10-15 01:41:54,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:41:54,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-10-15 01:41:54,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:41:54,135 INFO L225 Difference]: With dead ends: 351 [2019-10-15 01:41:54,135 INFO L226 Difference]: Without dead ends: 181 [2019-10-15 01:41:54,137 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:41:54,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-15 01:41:54,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2019-10-15 01:41:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-15 01:41:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 299 transitions. [2019-10-15 01:41:54,152 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 299 transitions. Word has length 101 [2019-10-15 01:41:54,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:41:54,153 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 299 transitions. [2019-10-15 01:41:54,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:41:54,153 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 299 transitions. [2019-10-15 01:41:54,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-15 01:41:54,155 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:41:54,155 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:41:54,156 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:41:54,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:41:54,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1307305057, now seen corresponding path program 1 times [2019-10-15 01:41:54,156 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:41:54,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155904266] [2019-10-15 01:41:54,157 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:41:54,157 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:41:54,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:41:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:41:54,269 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:41:54,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155904266] [2019-10-15 01:41:54,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:41:54,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:41:54,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492468177] [2019-10-15 01:41:54,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:41:54,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:41:54,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:41:54,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:41:54,272 INFO L87 Difference]: Start difference. First operand 177 states and 299 transitions. Second operand 6 states. [2019-10-15 01:41:54,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:41:54,856 INFO L93 Difference]: Finished difference Result 453 states and 784 transitions. [2019-10-15 01:41:54,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:41:54,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2019-10-15 01:41:54,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:41:54,861 INFO L225 Difference]: With dead ends: 453 [2019-10-15 01:41:54,861 INFO L226 Difference]: Without dead ends: 281 [2019-10-15 01:41:54,863 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:41:54,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-15 01:41:54,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 267. [2019-10-15 01:41:54,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-10-15 01:41:54,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 433 transitions. [2019-10-15 01:41:54,885 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 433 transitions. Word has length 108 [2019-10-15 01:41:54,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:41:54,885 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 433 transitions. [2019-10-15 01:41:54,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:41:54,885 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 433 transitions. [2019-10-15 01:41:54,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-15 01:41:54,887 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:41:54,888 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:41:54,888 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:41:54,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:41:54,888 INFO L82 PathProgramCache]: Analyzing trace with hash -852393689, now seen corresponding path program 1 times [2019-10-15 01:41:54,889 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:41:54,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769317042] [2019-10-15 01:41:54,889 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:41:54,889 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:41:54,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:41:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:41:55,038 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:41:55,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769317042] [2019-10-15 01:41:55,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914684479] [2019-10-15 01:41:55,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:41:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:41:55,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:41:55,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:41:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:41:55,202 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:41:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:41:55,248 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:41:55,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2019-10-15 01:41:55,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141553567] [2019-10-15 01:41:55,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:41:55,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:41:55,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:41:55,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:41:55,251 INFO L87 Difference]: Start difference. First operand 267 states and 433 transitions. Second operand 3 states. [2019-10-15 01:41:55,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:41:55,680 INFO L93 Difference]: Finished difference Result 703 states and 1154 transitions. [2019-10-15 01:41:55,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:41:55,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-10-15 01:41:55,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:41:55,689 INFO L225 Difference]: With dead ends: 703 [2019-10-15 01:41:55,689 INFO L226 Difference]: Without dead ends: 441 [2019-10-15 01:41:55,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:41:55,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-10-15 01:41:55,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2019-10-15 01:41:55,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-10-15 01:41:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 639 transitions. [2019-10-15 01:41:55,742 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 639 transitions. Word has length 112 [2019-10-15 01:41:55,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:41:55,743 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 639 transitions. [2019-10-15 01:41:55,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:41:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 639 transitions. [2019-10-15 01:41:55,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-15 01:41:55,748 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:41:55,749 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:41:55,950 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:41:55,951 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:41:55,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:41:55,952 INFO L82 PathProgramCache]: Analyzing trace with hash 5339122, now seen corresponding path program 1 times [2019-10-15 01:41:55,953 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:41:55,953 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267399607] [2019-10-15 01:41:55,953 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:41:55,953 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:41:55,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:41:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:41:56,083 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:41:56,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267399607] [2019-10-15 01:41:56,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984361091] [2019-10-15 01:41:56,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:41:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:41:56,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:41:56,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:41:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:41:56,211 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:41:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:41:56,298 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:41:56,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 10 [2019-10-15 01:41:56,298 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029111100] [2019-10-15 01:41:56,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:41:56,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:41:56,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:41:56,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:41:56,300 INFO L87 Difference]: Start difference. First operand 441 states and 639 transitions. Second operand 4 states. [2019-10-15 01:41:56,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:41:56,943 INFO L93 Difference]: Finished difference Result 1131 states and 1733 transitions. [2019-10-15 01:41:56,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:41:56,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-10-15 01:41:56,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:41:56,944 INFO L225 Difference]: With dead ends: 1131 [2019-10-15 01:41:56,944 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:41:56,947 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:41:56,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:41:56,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:41:56,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:41:56,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:41:56,948 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2019-10-15 01:41:56,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:41:56,948 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:41:56,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:41:56,948 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:41:56,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:41:57,152 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:41:57,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:41:57,372 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 22 [2019-10-15 01:41:57,535 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a17~0 |old(~a17~0)|) (= ~a28~0 |old(~a28~0)|)) [2019-10-15 01:41:57,536 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:41:57,536 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-10-15 01:41:57,536 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-10-15 01:41:57,536 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-10-15 01:41:57,536 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-10-15 01:41:57,536 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-10-15 01:41:57,537 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-10-15 01:41:57,537 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-10-15 01:41:57,537 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-10-15 01:41:57,537 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-10-15 01:41:57,537 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-10-15 01:41:57,537 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-10-15 01:41:57,538 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-10-15 01:41:57,538 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-10-15 01:41:57,538 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-10-15 01:41:57,538 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-10-15 01:41:57,538 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-10-15 01:41:57,538 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-10-15 01:41:57,538 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-10-15 01:41:57,538 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-10-15 01:41:57,539 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-10-15 01:41:57,539 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-10-15 01:41:57,539 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 460) no Hoare annotation was computed. [2019-10-15 01:41:57,539 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-10-15 01:41:57,539 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-10-15 01:41:57,539 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-10-15 01:41:57,539 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-10-15 01:41:57,540 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-10-15 01:41:57,540 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-10-15 01:41:57,540 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-10-15 01:41:57,540 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-10-15 01:41:57,540 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-10-15 01:41:57,540 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-10-15 01:41:57,540 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-10-15 01:41:57,541 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-10-15 01:41:57,541 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-10-15 01:41:57,541 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2019-10-15 01:41:57,541 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2019-10-15 01:41:57,541 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-10-15 01:41:57,541 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-10-15 01:41:57,541 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-10-15 01:41:57,541 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-10-15 01:41:57,542 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-10-15 01:41:57,542 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-10-15 01:41:57,542 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-10-15 01:41:57,542 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-10-15 01:41:57,542 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-10-15 01:41:57,542 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-10-15 01:41:57,542 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-10-15 01:41:57,543 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-10-15 01:41:57,543 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-10-15 01:41:57,543 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-10-15 01:41:57,543 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-10-15 01:41:57,543 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-10-15 01:41:57,543 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-10-15 01:41:57,543 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-10-15 01:41:57,544 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse0 (and (= ~a17~0 |old(~a17~0)|) (= ~a28~0 |old(~a28~0)|))) (.cse1 (= 9 |old(~a17~0)|))) (and (or (= 7 |old(~a17~0)|) .cse0 .cse1) (or .cse0 .cse1 (= 11 |old(~a28~0)|) (not (< 8 |old(~a28~0)|))) (or (not (<= |old(~a28~0)| 7)) .cse0 .cse1))) [2019-10-15 01:41:57,544 INFO L443 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-10-15 01:41:57,544 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-10-15 01:41:57,544 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-10-15 01:41:57,544 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-10-15 01:41:57,544 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-10-15 01:41:57,544 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-10-15 01:41:57,545 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-10-15 01:41:57,545 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-10-15 01:41:57,545 INFO L443 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-10-15 01:41:57,545 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-10-15 01:41:57,545 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-10-15 01:41:57,545 INFO L443 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-10-15 01:41:57,545 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-10-15 01:41:57,545 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-10-15 01:41:57,545 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-10-15 01:41:57,546 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-10-15 01:41:57,546 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-10-15 01:41:57,546 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-10-15 01:41:57,546 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-10-15 01:41:57,546 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-10-15 01:41:57,546 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-10-15 01:41:57,546 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-10-15 01:41:57,546 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-10-15 01:41:57,546 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-10-15 01:41:57,546 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-10-15 01:41:57,547 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-10-15 01:41:57,547 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:41:57,547 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~a28~0 7) (not (= ~a17~0 7)) (not (= ~a17~0 9))) [2019-10-15 01:41:57,547 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:41:57,547 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:41:57,547 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (<= |old(~a28~0)| 7)) (and (= ~a17~0 |old(~a17~0)|) (= ~a28~0 |old(~a28~0)|)) (= 7 |old(~a17~0)|) (= 9 |old(~a17~0)|)) [2019-10-15 01:41:57,547 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse0 (not (= ~a17~0 9)))) (or (not (<= |old(~a28~0)| 7)) (= 7 |old(~a17~0)|) (and (not (= ~a17~0 7)) .cse0) (and (< 8 ~a28~0) .cse0 (not (= ~a28~0 11))) (and (<= ~a28~0 7) .cse0) (= 9 |old(~a17~0)|))) [2019-10-15 01:41:57,548 INFO L443 ceAbstractionStarter]: For program point L606-3(lines 600 617) no Hoare annotation was computed. [2019-10-15 01:41:57,548 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2019-10-15 01:41:57,548 INFO L439 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse0 (not (= ~a17~0 9)))) (or (not (<= |old(~a28~0)| 7)) (= 7 |old(~a17~0)|) (and (not (= ~a17~0 7)) .cse0) (and (< 8 ~a28~0) .cse0 (not (= ~a28~0 11))) (and (<= ~a28~0 7) .cse0) (= 9 |old(~a17~0)|))) [2019-10-15 01:41:57,548 INFO L443 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2019-10-15 01:41:57,548 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-10-15 01:41:57,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:41:57 BoogieIcfgContainer [2019-10-15 01:41:57,564 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:41:57,566 INFO L168 Benchmark]: Toolchain (without parser) took 8467.06 ms. Allocated memory was 136.8 MB in the beginning and 354.4 MB in the end (delta: 217.6 MB). Free memory was 99.7 MB in the beginning and 217.8 MB in the end (delta: -118.2 MB). Peak memory consumption was 99.4 MB. Max. memory is 7.1 GB. [2019-10-15 01:41:57,566 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory is still 119.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-15 01:41:57,567 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.27 ms. Allocated memory was 136.8 MB in the beginning and 203.4 MB in the end (delta: 66.6 MB). Free memory was 99.2 MB in the beginning and 169.8 MB in the end (delta: -70.5 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2019-10-15 01:41:57,568 INFO L168 Benchmark]: Boogie Preprocessor took 101.94 ms. Allocated memory is still 203.4 MB. Free memory was 169.8 MB in the beginning and 164.6 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. [2019-10-15 01:41:57,569 INFO L168 Benchmark]: RCFGBuilder took 2168.93 ms. Allocated memory was 203.4 MB in the beginning and 255.3 MB in the end (delta: 51.9 MB). Free memory was 164.6 MB in the beginning and 213.0 MB in the end (delta: -48.4 MB). Peak memory consumption was 118.1 MB. Max. memory is 7.1 GB. [2019-10-15 01:41:57,570 INFO L168 Benchmark]: TraceAbstraction took 5435.14 ms. Allocated memory was 255.3 MB in the beginning and 354.4 MB in the end (delta: 99.1 MB). Free memory was 213.0 MB in the beginning and 217.8 MB in the end (delta: -4.8 MB). Peak memory consumption was 94.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:41:57,574 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory is still 119.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 756.27 ms. Allocated memory was 136.8 MB in the beginning and 203.4 MB in the end (delta: 66.6 MB). Free memory was 99.2 MB in the beginning and 169.8 MB in the end (delta: -70.5 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 101.94 ms. Allocated memory is still 203.4 MB. Free memory was 169.8 MB in the beginning and 164.6 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2168.93 ms. Allocated memory was 203.4 MB in the beginning and 255.3 MB in the end (delta: 51.9 MB). Free memory was 164.6 MB in the beginning and 213.0 MB in the end (delta: -48.4 MB). Peak memory consumption was 118.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5435.14 ms. Allocated memory was 255.3 MB in the beginning and 354.4 MB in the end (delta: 99.1 MB). Free memory was 213.0 MB in the beginning and 217.8 MB in the end (delta: -4.8 MB). Peak memory consumption was 94.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 460]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((!(\old(a28) <= 7) || 7 == \old(a17)) || (!(a17 == 7) && !(a17 == 9))) || ((8 < a28 && !(a17 == 9)) && !(a28 == 11))) || (a28 <= 7 && !(a17 == 9))) || 9 == \old(a17) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 1 error locations. Result: SAFE, OverallTime: 5.3s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 251 SDtfs, 782 SDslu, 101 SDs, 0 SdLazy, 1588 SolverSat, 379 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 508 GetRequests, 479 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=441occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 27 PreInvPairs, 43 NumberOfFragments, 166 HoareAnnotationTreeSize, 27 FomulaSimplifications, 312 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 534 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 761 NumberOfCodeBlocks, 761 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 985 ConstructedInterpolants, 0 QuantifiedInterpolants, 301015 SizeOfPredicates, 4 NumberOfNonLiveVariables, 729 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 181/226 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...