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_label23.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:55:54,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:55:54,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:55:54,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:55:54,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:55:54,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:55:54,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:55:54,858 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:55:54,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:55:54,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:55:54,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:55:54,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:55:54,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:55:54,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:55:54,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:55:54,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:55:54,876 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:55:54,879 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:55:54,880 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:55:54,882 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:55:54,884 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:55:54,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:55:54,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:55:54,887 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:55:54,889 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:55:54,889 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:55:54,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:55:54,890 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:55:54,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:55:54,891 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:55:54,891 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:55:54,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:55:54,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:55:54,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:55:54,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:55:54,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:55:54,895 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:55:54,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:55:54,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:55:54,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:55:54,897 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:55:54,898 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-07 00:55:54,913 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:55:54,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:55:54,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:55:54,915 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:55:54,918 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:55:54,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:55:54,919 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:55:54,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:55:54,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:55:54,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:55:54,920 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:55:54,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:55:54,920 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:55:54,920 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:55:54,920 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:55:54,921 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:55:54,921 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:55:54,921 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:55:54,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:55:54,923 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:55:54,924 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:55:54,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:55:54,924 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:55:54,924 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:55:54,925 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:55:54,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:55:54,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:55:54,925 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:55:54,925 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-07 00:55:55,223 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:55:55,239 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:55:55,245 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:55:55,246 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:55:55,247 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:55:55,247 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label23.c [2019-10-07 00:55:55,323 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6191b272e/687d5e85a0374ac29bb3811707451a08/FLAG0fdd8234d [2019-10-07 00:55:55,938 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:55:55,939 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label23.c [2019-10-07 00:55:55,960 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6191b272e/687d5e85a0374ac29bb3811707451a08/FLAG0fdd8234d [2019-10-07 00:55:56,171 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6191b272e/687d5e85a0374ac29bb3811707451a08 [2019-10-07 00:55:56,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:55:56,184 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:55:56,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:55:56,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:55:56,189 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:55:56,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:55:56" (1/1) ... [2019-10-07 00:55:56,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27e14b79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:55:56, skipping insertion in model container [2019-10-07 00:55:56,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:55:56" (1/1) ... [2019-10-07 00:55:56,202 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:55:56,265 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:55:56,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:55:56,856 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:55:56,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:55:56,994 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:55:56,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:55:56 WrapperNode [2019-10-07 00:55:56,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:55:56,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:55:56,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:55:56,996 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:55:57,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:55:56" (1/1) ... [2019-10-07 00:55:57,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:55:56" (1/1) ... [2019-10-07 00:55:57,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:55:56" (1/1) ... [2019-10-07 00:55:57,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:55:56" (1/1) ... [2019-10-07 00:55:57,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:55:56" (1/1) ... [2019-10-07 00:55:57,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:55:56" (1/1) ... [2019-10-07 00:55:57,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:55:56" (1/1) ... [2019-10-07 00:55:57,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:55:57,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:55:57,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:55:57,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:55:57,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:55:56" (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-07 00:55:57,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:55:57,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:55:57,204 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 00:55:57,205 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:55:57,205 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 00:55:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:55:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:55:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 00:55:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:55:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:55:57,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:55:59,142 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:55:59,142 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 00:55:59,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:55:59 BoogieIcfgContainer [2019-10-07 00:55:59,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:55:59,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:55:59,149 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:55:59,156 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:55:59,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:55:56" (1/3) ... [2019-10-07 00:55:59,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471b150c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:55:59, skipping insertion in model container [2019-10-07 00:55:59,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:55:56" (2/3) ... [2019-10-07 00:55:59,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471b150c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:55:59, skipping insertion in model container [2019-10-07 00:55:59,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:55:59" (3/3) ... [2019-10-07 00:55:59,163 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label23.c [2019-10-07 00:55:59,174 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:55:59,187 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:55:59,200 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:55:59,237 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:55:59,238 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:55:59,238 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:55:59,238 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:55:59,238 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:55:59,238 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:55:59,238 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:55:59,239 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:55:59,270 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2019-10-07 00:55:59,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-07 00:55:59,283 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:55:59,284 INFO L385 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-07 00:55:59,288 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:55:59,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:55:59,295 INFO L82 PathProgramCache]: Analyzing trace with hash 826817124, now seen corresponding path program 1 times [2019-10-07 00:55:59,305 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:55:59,305 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:55:59,306 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:55:59,306 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:55:59,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:55:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:55:59,701 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-07 00:55:59,702 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:55:59,703 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:55:59,704 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:55:59,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:55:59,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:55:59,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:55:59,728 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2019-10-07 00:56:00,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:56:00,255 INFO L93 Difference]: Finished difference Result 246 states and 454 transitions. [2019-10-07 00:56:00,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:56:00,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-07 00:56:00,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:56:00,275 INFO L225 Difference]: With dead ends: 246 [2019-10-07 00:56:00,275 INFO L226 Difference]: Without dead ends: 157 [2019-10-07 00:56:00,279 INFO L606 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-07 00:56:00,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-07 00:56:00,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-10-07 00:56:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-07 00:56:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 279 transitions. [2019-10-07 00:56:00,344 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 279 transitions. Word has length 77 [2019-10-07 00:56:00,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:56:00,345 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 279 transitions. [2019-10-07 00:56:00,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:56:00,346 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 279 transitions. [2019-10-07 00:56:00,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-07 00:56:00,351 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:56:00,351 INFO L385 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-07 00:56:00,351 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:56:00,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:56:00,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1195669509, now seen corresponding path program 1 times [2019-10-07 00:56:00,352 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:56:00,352 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:00,352 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:00,353 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:00,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:56:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:56:00,464 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-07 00:56:00,465 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:00,465 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:56:00,465 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:56:00,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:56:00,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:56:00,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:56:00,470 INFO L87 Difference]: Start difference. First operand 157 states and 279 transitions. Second operand 6 states. [2019-10-07 00:56:01,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:56:01,093 INFO L93 Difference]: Finished difference Result 402 states and 725 transitions. [2019-10-07 00:56:01,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 00:56:01,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-10-07 00:56:01,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:56:01,100 INFO L225 Difference]: With dead ends: 402 [2019-10-07 00:56:01,100 INFO L226 Difference]: Without dead ends: 250 [2019-10-07 00:56:01,102 INFO L606 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-07 00:56:01,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-07 00:56:01,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2019-10-07 00:56:01,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-10-07 00:56:01,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 407 transitions. [2019-10-07 00:56:01,146 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 407 transitions. Word has length 87 [2019-10-07 00:56:01,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:56:01,147 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 407 transitions. [2019-10-07 00:56:01,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:56:01,147 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 407 transitions. [2019-10-07 00:56:01,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-07 00:56:01,150 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:56:01,150 INFO L385 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-07 00:56:01,151 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:56:01,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:56:01,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2128691113, now seen corresponding path program 1 times [2019-10-07 00:56:01,152 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:56:01,152 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:01,152 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:01,152 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:01,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:56:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:56:01,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:56:01,406 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:01,406 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:56:01,406 INFO L95 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-07 00:56:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:56:01,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 00:56:01,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:56:01,661 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-07 00:56:01,662 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:56:01,736 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-07 00:56:01,737 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 00:56:01,737 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-10-07 00:56:01,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 00:56:01,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 00:56:01,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-07 00:56:01,741 INFO L87 Difference]: Start difference. First operand 238 states and 407 transitions. Second operand 4 states. [2019-10-07 00:56:02,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:56:02,474 INFO L93 Difference]: Finished difference Result 852 states and 1540 transitions. [2019-10-07 00:56:02,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 00:56:02,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-07 00:56:02,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:56:02,482 INFO L225 Difference]: With dead ends: 852 [2019-10-07 00:56:02,482 INFO L226 Difference]: Without dead ends: 619 [2019-10-07 00:56:02,485 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-07 00:56:02,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-10-07 00:56:02,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 467. [2019-10-07 00:56:02,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2019-10-07 00:56:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 734 transitions. [2019-10-07 00:56:02,534 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 734 transitions. Word has length 88 [2019-10-07 00:56:02,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:56:02,535 INFO L462 AbstractCegarLoop]: Abstraction has 467 states and 734 transitions. [2019-10-07 00:56:02,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 00:56:02,535 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 734 transitions. [2019-10-07 00:56:02,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-07 00:56:02,540 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:56:02,540 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 00:56:02,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:56:02,747 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:56:02,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:56:02,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1130433861, now seen corresponding path program 1 times [2019-10-07 00:56:02,748 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:56:02,748 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:02,749 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:02,749 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:02,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:56:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:56:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:56:02,898 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:02,898 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:56:02,898 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:56:02,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:56:02,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:56:02,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:56:02,900 INFO L87 Difference]: Start difference. First operand 467 states and 734 transitions. Second operand 6 states. [2019-10-07 00:56:03,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:56:03,494 INFO L93 Difference]: Finished difference Result 1117 states and 1796 transitions. [2019-10-07 00:56:03,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 00:56:03,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-10-07 00:56:03,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:56:03,502 INFO L225 Difference]: With dead ends: 1117 [2019-10-07 00:56:03,503 INFO L226 Difference]: Without dead ends: 655 [2019-10-07 00:56:03,505 INFO L606 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-07 00:56:03,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-10-07 00:56:03,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 489. [2019-10-07 00:56:03,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-10-07 00:56:03,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 683 transitions. [2019-10-07 00:56:03,541 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 683 transitions. Word has length 102 [2019-10-07 00:56:03,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:56:03,541 INFO L462 AbstractCegarLoop]: Abstraction has 489 states and 683 transitions. [2019-10-07 00:56:03,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:56:03,542 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 683 transitions. [2019-10-07 00:56:03,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-07 00:56:03,545 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:56:03,546 INFO L385 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] [2019-10-07 00:56:03,546 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:56:03,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:56:03,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1998016475, now seen corresponding path program 1 times [2019-10-07 00:56:03,547 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:56:03,547 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:03,547 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:03,547 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:03,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:56:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:56:03,671 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-07 00:56:03,672 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:03,672 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:56:03,672 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:56:03,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:56:03,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:56:03,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:56:03,676 INFO L87 Difference]: Start difference. First operand 489 states and 683 transitions. Second operand 3 states. [2019-10-07 00:56:04,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:56:04,104 INFO L93 Difference]: Finished difference Result 1360 states and 1968 transitions. [2019-10-07 00:56:04,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:56:04,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-10-07 00:56:04,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:56:04,114 INFO L225 Difference]: With dead ends: 1360 [2019-10-07 00:56:04,114 INFO L226 Difference]: Without dead ends: 876 [2019-10-07 00:56:04,116 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-07 00:56:04,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2019-10-07 00:56:04,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 797. [2019-10-07 00:56:04,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-10-07 00:56:04,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1134 transitions. [2019-10-07 00:56:04,182 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1134 transitions. Word has length 103 [2019-10-07 00:56:04,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:56:04,183 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1134 transitions. [2019-10-07 00:56:04,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:56:04,183 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1134 transitions. [2019-10-07 00:56:04,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-07 00:56:04,188 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:56:04,188 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-07 00:56:04,189 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:56:04,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:56:04,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1517676271, now seen corresponding path program 1 times [2019-10-07 00:56:04,190 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:56:04,190 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:04,190 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:04,190 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:04,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:56:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:56:04,397 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 55 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:56:04,397 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:04,398 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:56:04,398 INFO L95 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-07 00:56:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:56:04,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 00:56:04,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:56:04,532 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:56:04,533 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:56:04,591 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:56:04,592 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 00:56:04,592 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2019-10-07 00:56:04,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:56:04,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:56:04,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-07 00:56:04,593 INFO L87 Difference]: Start difference. First operand 797 states and 1134 transitions. Second operand 3 states. [2019-10-07 00:56:05,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:56:05,044 INFO L93 Difference]: Finished difference Result 2280 states and 3327 transitions. [2019-10-07 00:56:05,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:56:05,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-10-07 00:56:05,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:56:05,045 INFO L225 Difference]: With dead ends: 2280 [2019-10-07 00:56:05,045 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 00:56:05,051 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 281 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-07 00:56:05,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 00:56:05,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 00:56:05,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 00:56:05,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 00:56:05,052 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 140 [2019-10-07 00:56:05,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:56:05,053 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 00:56:05,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:56:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 00:56:05,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 00:56:05,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:56:05,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 00:56:05,949 WARN L191 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 38 [2019-10-07 00:56:06,047 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-07 00:56:06,048 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 00:56:06,048 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-07 00:56:06,048 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-07 00:56:06,048 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-07 00:56:06,048 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-07 00:56:06,048 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-07 00:56:06,049 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-07 00:56:06,049 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-07 00:56:06,049 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-07 00:56:06,049 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-07 00:56:06,049 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-07 00:56:06,049 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-07 00:56:06,049 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-07 00:56:06,049 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-07 00:56:06,050 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-07 00:56:06,050 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-07 00:56:06,050 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-07 00:56:06,050 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-07 00:56:06,050 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-07 00:56:06,050 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-07 00:56:06,050 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-07 00:56:06,051 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-07 00:56:06,051 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-07 00:56:06,051 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-07 00:56:06,051 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-07 00:56:06,051 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-07 00:56:06,051 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-07 00:56:06,051 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-07 00:56:06,052 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-07 00:56:06,052 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-07 00:56:06,052 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:56:06,052 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:56:06,052 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-07 00:56:06,052 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-07 00:56:06,052 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-07 00:56:06,052 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-07 00:56:06,053 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-07 00:56:06,053 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-07 00:56:06,053 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-07 00:56:06,053 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-07 00:56:06,053 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-07 00:56:06,053 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-07 00:56:06,053 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-07 00:56:06,054 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-07 00:56:06,054 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-07 00:56:06,054 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-07 00:56:06,054 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-07 00:56:06,054 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-07 00:56:06,054 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-07 00:56:06,055 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 461) no Hoare annotation was computed. [2019-10-07 00:56:06,055 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse4 (= ~a16~0 |old(~a16~0)|)) (.cse3 (= ~a8~0 |old(~a8~0)|))) (let ((.cse5 (and .cse4 .cse3)) (.cse2 (or (= 6 |old(~a16~0)|) (not (< |old(~a8~0)| 15)))) (.cse1 (= 1 |old(~a20~0)|)) (.cse0 (not (= ~a20~0 1)))) (and (or .cse0 (= 13 |old(~a8~0)|) .cse1) (or .cse2 (and .cse3 .cse4)) (or .cse5 .cse1) (or (and .cse4 .cse3 (<= ~a17~0 0)) (not (<= |old(~a17~0)| 0))) (or (= 4 |old(~a16~0)|) .cse5) (or .cse2 .cse1 .cse0)))) [2019-10-07 00:56:06,055 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-07 00:56:06,055 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:56:06,055 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-07 00:56:06,056 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-07 00:56:06,056 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-07 00:56:06,056 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-07 00:56:06,056 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-07 00:56:06,056 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-07 00:56:06,056 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:56:06,056 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-07 00:56:06,056 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-07 00:56:06,056 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-07 00:56:06,057 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-10-07 00:56:06,057 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-07 00:56:06,057 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-07 00:56:06,057 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-07 00:56:06,057 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-07 00:56:06,057 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-07 00:56:06,057 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-07 00:56:06,057 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-07 00:56:06,058 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-07 00:56:06,058 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-07 00:56:06,058 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-07 00:56:06,058 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 00:56:06,058 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a16~0 6)) (not (= ~a8~0 13)) (not (= ~a16~0 4))) [2019-10-07 00:56:06,058 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 00:56:06,058 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 00:56:06,059 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (= 4 |old(~a16~0)|) (= 13 |old(~a8~0)|) (and (= ~a16~0 |old(~a16~0)|) (= ~a8~0 |old(~a8~0)|))) [2019-10-07 00:56:06,059 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2019-10-07 00:56:06,059 INFO L439 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (not (= ~a16~0 4)) (<= ~a17~0 0) (= 4 |old(~a16~0)|) (< ~a8~0 15) (= 13 |old(~a8~0)|) (not (= ~a20~0 1))) [2019-10-07 00:56:06,059 INFO L443 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2019-10-07 00:56:06,059 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-07 00:56:06,059 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (not (= ~a16~0 4)) (<= ~a17~0 0) (= 4 |old(~a16~0)|) (< ~a8~0 15) (= 13 |old(~a8~0)|) (not (= ~a20~0 1))) [2019-10-07 00:56:06,059 INFO L443 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2019-10-07 00:56:06,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 12:56:06 BoogieIcfgContainer [2019-10-07 00:56:06,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 00:56:06,086 INFO L168 Benchmark]: Toolchain (without parser) took 9897.66 ms. Allocated memory was 144.7 MB in the beginning and 329.8 MB in the end (delta: 185.1 MB). Free memory was 100.9 MB in the beginning and 169.7 MB in the end (delta: -68.7 MB). Peak memory consumption was 116.3 MB. Max. memory is 7.1 GB. [2019-10-07 00:56:06,089 INFO L168 Benchmark]: CDTParser took 1.31 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 00:56:06,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 810.43 ms. Allocated memory was 144.7 MB in the beginning and 205.0 MB in the end (delta: 60.3 MB). Free memory was 100.7 MB in the beginning and 170.7 MB in the end (delta: -69.9 MB). Peak memory consumption was 32.1 MB. Max. memory is 7.1 GB. [2019-10-07 00:56:06,093 INFO L168 Benchmark]: Boogie Preprocessor took 120.88 ms. Allocated memory is still 205.0 MB. Free memory was 170.7 MB in the beginning and 165.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2019-10-07 00:56:06,096 INFO L168 Benchmark]: RCFGBuilder took 2030.12 ms. Allocated memory was 205.0 MB in the beginning and 251.7 MB in the end (delta: 46.7 MB). Free memory was 165.7 MB in the beginning and 216.2 MB in the end (delta: -50.5 MB). Peak memory consumption was 117.9 MB. Max. memory is 7.1 GB. [2019-10-07 00:56:06,103 INFO L168 Benchmark]: TraceAbstraction took 6931.46 ms. Allocated memory was 251.7 MB in the beginning and 329.8 MB in the end (delta: 78.1 MB). Free memory was 216.2 MB in the beginning and 169.7 MB in the end (delta: 46.5 MB). Peak memory consumption was 124.6 MB. Max. memory is 7.1 GB. [2019-10-07 00:56:06,111 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.31 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 810.43 ms. Allocated memory was 144.7 MB in the beginning and 205.0 MB in the end (delta: 60.3 MB). Free memory was 100.7 MB in the beginning and 170.7 MB in the end (delta: -69.9 MB). Peak memory consumption was 32.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 120.88 ms. Allocated memory is still 205.0 MB. Free memory was 170.7 MB in the beginning and 165.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2030.12 ms. Allocated memory was 205.0 MB in the beginning and 251.7 MB in the end (delta: 46.7 MB). Free memory was 165.7 MB in the beginning and 216.2 MB in the end (delta: -50.5 MB). Peak memory consumption was 117.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6931.46 ms. Allocated memory was 251.7 MB in the beginning and 329.8 MB in the end (delta: 78.1 MB). Free memory was 216.2 MB in the beginning and 169.7 MB in the end (delta: 46.5 MB). Peak memory consumption was 124.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 461]: 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) || !(a16 == 4)) || a17 <= 0) || 4 == \old(a16)) || a8 < 15) || 13 == \old(a8)) || !(a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 86 locations, 1 error locations. Result: SAFE, OverallTime: 6.8s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 520 SDtfs, 578 SDslu, 143 SDs, 0 SdLazy, 1913 SolverSat, 433 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 502 GetRequests, 469 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=797occurred in iteration=5, 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, 409 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 53 PreInvPairs, 91 NumberOfFragments, 167 HoareAnnotationTreeSize, 53 FomulaSimplifications, 2476 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1304 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 825 NumberOfCodeBlocks, 825 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1043 ConstructedInterpolants, 0 QuantifiedInterpolants, 349447 SizeOfPredicates, 4 NumberOfNonLiveVariables, 744 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 246/256 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...