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/Problem01_label27.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:40:23,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:40:23,088 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:40:23,105 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:40:23,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:40:23,107 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:40:23,109 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:40:23,119 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:40:23,124 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:40:23,125 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:40:23,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:40:23,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:40:23,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:40:23,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:40:23,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:40:23,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:40:23,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:40:23,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:40:23,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:40:23,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:40:23,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:40:23,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:40:23,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:40:23,151 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:40:23,153 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:40:23,153 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:40:23,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:40:23,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:40:23,156 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:40:23,157 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:40:23,157 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:40:23,159 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:40:23,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:40:23,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:40:23,162 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:40:23,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:40:23,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:40:23,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:40:23,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:40:23,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:40:23,165 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:40:23,166 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-13 21:40:23,200 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:40:23,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:40:23,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:40:23,204 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:40:23,205 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:40:23,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:40:23,205 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:40:23,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:40:23,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:40:23,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:40:23,206 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:40:23,206 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:40:23,206 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:40:23,206 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:40:23,207 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:40:23,207 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:40:23,207 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:40:23,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:40:23,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:40:23,208 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:40:23,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:40:23,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:40:23,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:40:23,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:40:23,209 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:40:23,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:40:23,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:40:23,209 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:40:23,210 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-13 21:40:23,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:40:23,480 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:40:23,484 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:40:23,485 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:40:23,486 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:40:23,486 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label27.c [2019-10-13 21:40:23,554 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e12671e28/c7fbc95fdb094e7eb65df046a389ad09/FLAG9c06ed42c [2019-10-13 21:40:24,117 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:40:24,118 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label27.c [2019-10-13 21:40:24,132 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e12671e28/c7fbc95fdb094e7eb65df046a389ad09/FLAG9c06ed42c [2019-10-13 21:40:24,391 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e12671e28/c7fbc95fdb094e7eb65df046a389ad09 [2019-10-13 21:40:24,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:40:24,403 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:40:24,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:40:24,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:40:24,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:40:24,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:40:24" (1/1) ... [2019-10-13 21:40:24,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3304fef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:24, skipping insertion in model container [2019-10-13 21:40:24,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:40:24" (1/1) ... [2019-10-13 21:40:24,421 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:40:24,466 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:40:24,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:40:24,999 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:40:25,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:40:25,121 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:40:25,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:25 WrapperNode [2019-10-13 21:40:25,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:40:25,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:40:25,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:40:25,123 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:40:25,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:25" (1/1) ... [2019-10-13 21:40:25,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:25" (1/1) ... [2019-10-13 21:40:25,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:25" (1/1) ... [2019-10-13 21:40:25,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:25" (1/1) ... [2019-10-13 21:40:25,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:25" (1/1) ... [2019-10-13 21:40:25,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:25" (1/1) ... [2019-10-13 21:40:25,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:25" (1/1) ... [2019-10-13 21:40:25,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:40:25,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:40:25,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:40:25,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:40:25,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:25" (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-13 21:40:25,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:40:25,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:40:25,285 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 21:40:25,286 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:40:25,286 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 21:40:25,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:40:25,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:40:25,287 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:40:25,287 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:40:25,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:40:25,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:40:27,026 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:40:27,026 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:40:27,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:40:27 BoogieIcfgContainer [2019-10-13 21:40:27,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:40:27,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:40:27,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:40:27,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:40:27,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:40:24" (1/3) ... [2019-10-13 21:40:27,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9cc347a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:40:27, skipping insertion in model container [2019-10-13 21:40:27,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:25" (2/3) ... [2019-10-13 21:40:27,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9cc347a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:40:27, skipping insertion in model container [2019-10-13 21:40:27,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:40:27" (3/3) ... [2019-10-13 21:40:27,037 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label27.c [2019-10-13 21:40:27,048 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:40:27,056 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:40:27,067 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:40:27,092 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:40:27,092 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:40:27,092 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:40:27,092 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:40:27,093 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:40:27,093 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:40:27,093 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:40:27,093 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:40:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2019-10-13 21:40:27,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-13 21:40:27,122 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:27,123 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] [2019-10-13 21:40:27,125 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:27,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:27,131 INFO L82 PathProgramCache]: Analyzing trace with hash 826812449, now seen corresponding path program 1 times [2019-10-13 21:40:27,140 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:27,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322411642] [2019-10-13 21:40:27,141 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:27,141 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:27,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:27,586 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-13 21:40:27,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322411642] [2019-10-13 21:40:27,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:27,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:40:27,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818524656] [2019-10-13 21:40:27,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:40:27,595 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:27,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:40:27,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:40:27,612 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 4 states. [2019-10-13 21:40:28,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:28,314 INFO L93 Difference]: Finished difference Result 325 states and 606 transitions. [2019-10-13 21:40:28,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:40:28,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-10-13 21:40:28,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:28,342 INFO L225 Difference]: With dead ends: 325 [2019-10-13 21:40:28,343 INFO L226 Difference]: Without dead ends: 232 [2019-10-13 21:40:28,349 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:40:28,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-13 21:40:28,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 157. [2019-10-13 21:40:28,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-13 21:40:28,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 279 transitions. [2019-10-13 21:40:28,435 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 279 transitions. Word has length 77 [2019-10-13 21:40:28,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:28,436 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 279 transitions. [2019-10-13 21:40:28,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:40:28,436 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 279 transitions. [2019-10-13 21:40:28,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-13 21:40:28,441 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:28,441 INFO L380 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] [2019-10-13 21:40:28,441 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:28,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:28,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1195674184, now seen corresponding path program 1 times [2019-10-13 21:40:28,442 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:28,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206701488] [2019-10-13 21:40:28,443 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:28,443 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:28,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:28,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206701488] [2019-10-13 21:40:28,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:28,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:40:28,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750140836] [2019-10-13 21:40:28,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:40:28,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:28,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:40:28,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:40:28,546 INFO L87 Difference]: Start difference. First operand 157 states and 279 transitions. Second operand 6 states. [2019-10-13 21:40:29,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:29,125 INFO L93 Difference]: Finished difference Result 479 states and 882 transitions. [2019-10-13 21:40:29,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:40:29,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-10-13 21:40:29,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:29,130 INFO L225 Difference]: With dead ends: 479 [2019-10-13 21:40:29,130 INFO L226 Difference]: Without dead ends: 327 [2019-10-13 21:40:29,132 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-13 21:40:29,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-10-13 21:40:29,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 315. [2019-10-13 21:40:29,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-10-13 21:40:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 558 transitions. [2019-10-13 21:40:29,168 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 558 transitions. Word has length 87 [2019-10-13 21:40:29,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:29,168 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 558 transitions. [2019-10-13 21:40:29,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:40:29,168 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 558 transitions. [2019-10-13 21:40:29,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-13 21:40:29,173 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:29,174 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:40:29,174 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:29,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:29,174 INFO L82 PathProgramCache]: Analyzing trace with hash -2128695788, now seen corresponding path program 1 times [2019-10-13 21:40:29,175 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:29,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711845020] [2019-10-13 21:40:29,175 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:29,175 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:29,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:29,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711845020] [2019-10-13 21:40:29,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:29,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:40:29,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347119101] [2019-10-13 21:40:29,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:40:29,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:29,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:40:29,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:40:29,263 INFO L87 Difference]: Start difference. First operand 315 states and 558 transitions. Second operand 3 states. [2019-10-13 21:40:29,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:29,707 INFO L93 Difference]: Finished difference Result 852 states and 1540 transitions. [2019-10-13 21:40:29,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:40:29,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-10-13 21:40:29,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:29,714 INFO L225 Difference]: With dead ends: 852 [2019-10-13 21:40:29,715 INFO L226 Difference]: Without dead ends: 542 [2019-10-13 21:40:29,717 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-13 21:40:29,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-10-13 21:40:29,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2019-10-13 21:40:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-10-13 21:40:29,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 923 transitions. [2019-10-13 21:40:29,756 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 923 transitions. Word has length 88 [2019-10-13 21:40:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:29,756 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 923 transitions. [2019-10-13 21:40:29,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:40:29,757 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 923 transitions. [2019-10-13 21:40:29,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 21:40:29,765 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:29,765 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:40:29,765 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:29,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:29,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1641056516, now seen corresponding path program 1 times [2019-10-13 21:40:29,766 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:29,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284289567] [2019-10-13 21:40:29,767 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:29,767 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:29,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:29,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284289567] [2019-10-13 21:40:29,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:29,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:40:29,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460530841] [2019-10-13 21:40:29,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:40:29,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:29,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:40:29,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:40:29,857 INFO L87 Difference]: Start difference. First operand 542 states and 923 transitions. Second operand 6 states. [2019-10-13 21:40:30,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:30,474 INFO L93 Difference]: Finished difference Result 1421 states and 2525 transitions. [2019-10-13 21:40:30,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:40:30,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-10-13 21:40:30,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:30,481 INFO L225 Difference]: With dead ends: 1421 [2019-10-13 21:40:30,481 INFO L226 Difference]: Without dead ends: 884 [2019-10-13 21:40:30,484 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:40:30,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2019-10-13 21:40:30,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 866. [2019-10-13 21:40:30,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2019-10-13 21:40:30,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1450 transitions. [2019-10-13 21:40:30,536 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1450 transitions. Word has length 100 [2019-10-13 21:40:30,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:30,536 INFO L462 AbstractCegarLoop]: Abstraction has 866 states and 1450 transitions. [2019-10-13 21:40:30,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:40:30,537 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1450 transitions. [2019-10-13 21:40:30,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 21:40:30,544 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:30,545 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:40:30,545 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:30,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:30,546 INFO L82 PathProgramCache]: Analyzing trace with hash -498208855, now seen corresponding path program 1 times [2019-10-13 21:40:30,546 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:30,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065938723] [2019-10-13 21:40:30,546 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:30,547 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:30,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:30,640 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:30,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065938723] [2019-10-13 21:40:30,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189373586] [2019-10-13 21:40:30,641 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-13 21:40:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:30,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:40:30,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:40:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:40:30,837 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:40:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:40:30,888 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:40:30,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-13 21:40:30,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470796227] [2019-10-13 21:40:30,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:40:30,889 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:30,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:40:30,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:40:30,890 INFO L87 Difference]: Start difference. First operand 866 states and 1450 transitions. Second operand 3 states. [2019-10-13 21:40:31,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:31,305 INFO L93 Difference]: Finished difference Result 1727 states and 2913 transitions. [2019-10-13 21:40:31,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:40:31,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-10-13 21:40:31,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:31,312 INFO L225 Difference]: With dead ends: 1727 [2019-10-13 21:40:31,312 INFO L226 Difference]: Without dead ends: 866 [2019-10-13 21:40:31,314 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 220 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:40:31,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2019-10-13 21:40:31,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 791. [2019-10-13 21:40:31,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-10-13 21:40:31,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1271 transitions. [2019-10-13 21:40:31,346 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1271 transitions. Word has length 111 [2019-10-13 21:40:31,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:31,347 INFO L462 AbstractCegarLoop]: Abstraction has 791 states and 1271 transitions. [2019-10-13 21:40:31,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:40:31,347 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1271 transitions. [2019-10-13 21:40:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 21:40:31,350 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:31,351 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, 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] [2019-10-13 21:40:31,554 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:40:31,555 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:31,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:31,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1740725880, now seen corresponding path program 1 times [2019-10-13 21:40:31,556 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:31,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443255307] [2019-10-13 21:40:31,556 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:31,556 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:31,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:31,654 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:31,655 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443255307] [2019-10-13 21:40:31,655 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:31,655 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:40:31,656 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14013111] [2019-10-13 21:40:31,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:40:31,657 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:31,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:40:31,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:40:31,662 INFO L87 Difference]: Start difference. First operand 791 states and 1271 transitions. Second operand 3 states. [2019-10-13 21:40:31,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:31,983 INFO L93 Difference]: Finished difference Result 1727 states and 2795 transitions. [2019-10-13 21:40:31,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:40:31,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-10-13 21:40:31,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:31,985 INFO L225 Difference]: With dead ends: 1727 [2019-10-13 21:40:31,985 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:40:31,989 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-13 21:40:31,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:40:31,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:40:31,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:40:31,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:40:31,995 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 111 [2019-10-13 21:40:31,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:31,996 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:40:31,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:40:31,996 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:40:31,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:40:32,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:40:32,538 WARN L191 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2019-10-13 21:40:32,623 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a16~0 |old(~a16~0)|) (= ~a8~0 |old(~a8~0)|)) [2019-10-13 21:40:32,624 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:40:32,624 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-13 21:40:32,624 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-13 21:40:32,624 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-13 21:40:32,624 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-13 21:40:32,624 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-13 21:40:32,624 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-13 21:40:32,625 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-10-13 21:40:32,625 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-13 21:40:32,625 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-13 21:40:32,625 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-13 21:40:32,625 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-13 21:40:32,625 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-13 21:40:32,625 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-13 21:40:32,626 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-13 21:40:32,626 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-13 21:40:32,626 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-10-13 21:40:32,626 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-13 21:40:32,626 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-13 21:40:32,626 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-10-13 21:40:32,626 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-13 21:40:32,626 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-13 21:40:32,627 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-13 21:40:32,627 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-13 21:40:32,627 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-13 21:40:32,627 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-13 21:40:32,628 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-13 21:40:32,629 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-13 21:40:32,629 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-13 21:40:32,629 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-13 21:40:32,629 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-13 21:40:32,629 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-13 21:40:32,629 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-13 21:40:32,629 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2019-10-13 21:40:32,629 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2019-10-13 21:40:32,630 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-13 21:40:32,630 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-13 21:40:32,630 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-13 21:40:32,630 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-13 21:40:32,630 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-13 21:40:32,631 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-13 21:40:32,631 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-13 21:40:32,631 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-13 21:40:32,632 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 440) no Hoare annotation was computed. [2019-10-13 21:40:32,632 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-13 21:40:32,632 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-13 21:40:32,632 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-13 21:40:32,632 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-13 21:40:32,632 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-13 21:40:32,632 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-13 21:40:32,632 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-13 21:40:32,633 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-13 21:40:32,633 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-13 21:40:32,634 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse4 (or (not (= 1 ~a7~0)) (not (= ~a20~0 ~a7~0)))) (.cse0 (= 6 |old(~a16~0)|)) (.cse1 (= ~a17~0 1)) (.cse5 (and (= |old(~a7~0)| |old(~a20~0)|) (= 1 |old(~a20~0)|))) (.cse3 (not (= 1 |old(~a17~0)|))) (.cse6 (= ~a16~0 |old(~a16~0)|)) (.cse7 (= ~a8~0 |old(~a8~0)|)) (.cse2 (= 15 |old(~a8~0)|))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5) (or (and .cse6 .cse7 .cse4) (or (= 13 |old(~a8~0)|) .cse5)) (or (and .cse1 .cse4) .cse5 .cse2 .cse3) (or .cse0 .cse1 .cse5 .cse3) (or (and .cse6 .cse7) .cse2))) [2019-10-13 21:40:32,634 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-13 21:40:32,634 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-13 21:40:32,635 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-13 21:40:32,635 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-13 21:40:32,635 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-13 21:40:32,635 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-13 21:40:32,635 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-13 21:40:32,635 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-13 21:40:32,635 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-13 21:40:32,636 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-13 21:40:32,636 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-13 21:40:32,636 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-13 21:40:32,636 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-13 21:40:32,636 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-13 21:40:32,636 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-13 21:40:32,636 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-13 21:40:32,636 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-13 21:40:32,637 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-13 21:40:32,637 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-13 21:40:32,637 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-13 21:40:32,637 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:40:32,637 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a16~0 6)) (= ~a17~0 1) (not (= ~a20~0 ~a7~0)) (not (= ~a8~0 13))) [2019-10-13 21:40:32,637 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:40:32,638 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:40:32,638 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (= 13 |old(~a8~0)|) (and (= ~a16~0 |old(~a16~0)|) (= ~a8~0 |old(~a8~0)|) (= ~a17~0 1) (not (= ~a20~0 ~a7~0))) (= |old(~a7~0)| |old(~a20~0)|) (not (= 1 |old(~a17~0)|))) [2019-10-13 21:40:32,638 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2019-10-13 21:40:32,638 INFO L439 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (= 13 |old(~a8~0)|) (not (= 15 ~a8~0)) (= |old(~a7~0)| |old(~a20~0)|) (or (not (= 1 ~a7~0)) (not (= ~a20~0 ~a7~0))) (not (= 1 |old(~a17~0)|))) [2019-10-13 21:40:32,638 INFO L443 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2019-10-13 21:40:32,638 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-13 21:40:32,639 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (= 13 |old(~a8~0)|) (not (= 15 ~a8~0)) (= |old(~a7~0)| |old(~a20~0)|) (or (not (= 1 ~a7~0)) (not (= ~a20~0 ~a7~0))) (not (= 1 |old(~a17~0)|))) [2019-10-13 21:40:32,639 INFO L443 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2019-10-13 21:40:32,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:40:32 BoogieIcfgContainer [2019-10-13 21:40:32,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:40:32,678 INFO L168 Benchmark]: Toolchain (without parser) took 8275.13 ms. Allocated memory was 139.5 MB in the beginning and 334.0 MB in the end (delta: 194.5 MB). Free memory was 102.3 MB in the beginning and 264.0 MB in the end (delta: -161.7 MB). Peak memory consumption was 206.5 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:32,679 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 21:40:32,680 INFO L168 Benchmark]: CACSL2BoogieTranslator took 714.75 ms. Allocated memory was 139.5 MB in the beginning and 206.0 MB in the end (delta: 66.6 MB). Free memory was 102.1 MB in the beginning and 171.8 MB in the end (delta: -69.7 MB). Peak memory consumption was 35.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:32,681 INFO L168 Benchmark]: Boogie Preprocessor took 97.68 ms. Allocated memory is still 206.0 MB. Free memory was 171.8 MB in the beginning and 167.0 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:32,682 INFO L168 Benchmark]: RCFGBuilder took 1807.49 ms. Allocated memory was 206.0 MB in the beginning and 249.6 MB in the end (delta: 43.5 MB). Free memory was 167.0 MB in the beginning and 203.8 MB in the end (delta: -36.8 MB). Peak memory consumption was 114.3 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:32,684 INFO L168 Benchmark]: TraceAbstraction took 5647.12 ms. Allocated memory was 249.6 MB in the beginning and 334.0 MB in the end (delta: 84.4 MB). Free memory was 203.8 MB in the beginning and 264.0 MB in the end (delta: -60.1 MB). Peak memory consumption was 197.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:32,691 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.19 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 714.75 ms. Allocated memory was 139.5 MB in the beginning and 206.0 MB in the end (delta: 66.6 MB). Free memory was 102.1 MB in the beginning and 171.8 MB in the end (delta: -69.7 MB). Peak memory consumption was 35.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 97.68 ms. Allocated memory is still 206.0 MB. Free memory was 171.8 MB in the beginning and 167.0 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1807.49 ms. Allocated memory was 206.0 MB in the beginning and 249.6 MB in the end (delta: 43.5 MB). Free memory was 167.0 MB in the beginning and 203.8 MB in the end (delta: -36.8 MB). Peak memory consumption was 114.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5647.12 ms. Allocated memory was 249.6 MB in the beginning and 334.0 MB in the end (delta: 84.4 MB). Free memory was 203.8 MB in the beginning and 264.0 MB in the end (delta: -60.1 MB). Peak memory consumption was 197.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 440]: 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: 583]: Loop Invariant Derived loop invariant: ((((6 == \old(a16) || 13 == \old(a8)) || !(15 == a8)) || \old(a7) == \old(a20)) || !(1 == a7) || !(a20 == a7)) || !(1 == \old(a17)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 86 locations, 1 error locations. Result: SAFE, OverallTime: 5.5s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 400 SDtfs, 890 SDslu, 117 SDs, 0 SdLazy, 1756 SolverSat, 515 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 263 GetRequests, 237 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=866occurred 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.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 180 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 53 PreInvPairs, 77 NumberOfFragments, 226 HoareAnnotationTreeSize, 53 FomulaSimplifications, 1155 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 611 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 685 NumberOfCodeBlocks, 685 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 788 ConstructedInterpolants, 0 QuantifiedInterpolants, 218984 SizeOfPredicates, 2 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 181/183 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...