java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label12.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:41:33,295 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:41:33,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:41:33,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:41:33,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:41:33,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:41:33,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:41:33,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:41:33,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:41:33,340 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:41:33,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:41:33,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:41:33,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:41:33,346 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:41:33,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:41:33,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:41:33,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:41:33,353 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:41:33,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:41:33,360 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:41:33,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:41:33,368 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:41:33,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:41:33,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:41:33,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:41:33,374 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:41:33,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:41:33,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:41:33,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:41:33,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:41:33,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:41:33,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:41:33,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:41:33,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:41:33,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:41:33,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:41:33,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:41:33,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:41:33,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:41:33,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:41:33,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:41:33,389 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:41:33,419 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:41:33,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:41:33,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:41:33,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:41:33,421 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:41:33,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:41:33,421 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:41:33,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:41:33,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:41:33,422 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:41:33,422 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:41:33,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:41:33,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:41:33,423 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:41:33,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:41:33,423 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:41:33,423 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:41:33,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:41:33,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:41:33,424 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:41:33,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:41:33,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:41:33,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:41:33,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:41:33,425 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:41:33,425 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:41:33,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:41:33,425 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:41:33,425 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 01:41:33,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:41:33,747 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:41:33,751 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:41:33,753 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:41:33,753 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:41:33,754 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label12.c [2019-10-15 01:41:33,816 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab5487ea5/34df475cae204252ab48a3cef3eace40/FLAG7e911d221 [2019-10-15 01:41:34,349 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:41:34,350 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label12.c [2019-10-15 01:41:34,365 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab5487ea5/34df475cae204252ab48a3cef3eace40/FLAG7e911d221 [2019-10-15 01:41:34,645 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab5487ea5/34df475cae204252ab48a3cef3eace40 [2019-10-15 01:41:34,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:41:34,657 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:41:34,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:41:34,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:41:34,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:41:34,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:41:34" (1/1) ... [2019-10-15 01:41:34,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d281660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:41:34, skipping insertion in model container [2019-10-15 01:41:34,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:41:34" (1/1) ... [2019-10-15 01:41:34,673 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:41:34,716 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:41:35,345 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:41:35,358 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:41:35,455 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:41:35,477 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:41:35,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:41:35 WrapperNode [2019-10-15 01:41:35,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:41:35,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:41:35,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:41:35,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:41:35,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:41:35" (1/1) ... [2019-10-15 01:41:35,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:41:35" (1/1) ... [2019-10-15 01:41:35,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:41:35" (1/1) ... [2019-10-15 01:41:35,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:41:35" (1/1) ... [2019-10-15 01:41:35,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:41:35" (1/1) ... [2019-10-15 01:41:35,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:41:35" (1/1) ... [2019-10-15 01:41:35,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:41:35" (1/1) ... [2019-10-15 01:41:35,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:41:35,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:41:35,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:41:35,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:41:35,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:41:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:41:35,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:41:35,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:41:35,665 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-15 01:41:35,665 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:41:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-15 01:41:35,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:41:35,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:41:35,667 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:41:35,667 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:41:35,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:41:35,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:41:37,802 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:41:37,803 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:41:37,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:41:37 BoogieIcfgContainer [2019-10-15 01:41:37,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:41:37,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:41:37,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:41:37,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:41:37,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:41:34" (1/3) ... [2019-10-15 01:41:37,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7fddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:41:37, skipping insertion in model container [2019-10-15 01:41:37,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:41:35" (2/3) ... [2019-10-15 01:41:37,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7fddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:41:37, skipping insertion in model container [2019-10-15 01:41:37,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:41:37" (3/3) ... [2019-10-15 01:41:37,814 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label12.c [2019-10-15 01:41:37,825 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:41:37,834 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:41:37,846 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:41:37,873 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:41:37,873 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:41:37,873 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:41:37,873 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:41:37,874 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:41:37,874 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:41:37,874 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:41:37,874 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:41:37,896 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2019-10-15 01:41:37,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-15 01:41:37,906 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:41:37,907 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:41:37,909 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:41:37,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:41:37,916 INFO L82 PathProgramCache]: Analyzing trace with hash -219360969, now seen corresponding path program 1 times [2019-10-15 01:41:37,924 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:41:37,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573175133] [2019-10-15 01:41:37,925 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:41:37,925 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:41:37,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:41:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:41:38,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:41:38,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573175133] [2019-10-15 01:41:38,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:41:38,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:41:38,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612017409] [2019-10-15 01:41:38,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:41:38,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:41:38,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:41:38,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:41:38,411 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 3 states. [2019-10-15 01:41:38,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:41:38,994 INFO L93 Difference]: Finished difference Result 273 states and 508 transitions. [2019-10-15 01:41:38,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:41:38,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-10-15 01:41:38,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:41:39,018 INFO L225 Difference]: With dead ends: 273 [2019-10-15 01:41:39,018 INFO L226 Difference]: Without dead ends: 175 [2019-10-15 01:41:39,024 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:41:39,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-15 01:41:39,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-10-15 01:41:39,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-15 01:41:39,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 312 transitions. [2019-10-15 01:41:39,150 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 312 transitions. Word has length 86 [2019-10-15 01:41:39,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:41:39,151 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 312 transitions. [2019-10-15 01:41:39,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:41:39,151 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 312 transitions. [2019-10-15 01:41:39,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-15 01:41:39,156 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:41:39,157 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:41:39,157 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:41:39,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:41:39,158 INFO L82 PathProgramCache]: Analyzing trace with hash -701895748, now seen corresponding path program 1 times [2019-10-15 01:41:39,158 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:41:39,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119211668] [2019-10-15 01:41:39,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:41:39,159 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:41:39,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:41:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:41:39,317 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:41:39,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119211668] [2019-10-15 01:41:39,318 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:41:39,318 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:41:39,319 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055037317] [2019-10-15 01:41:39,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:41:39,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:41:39,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:41:39,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:41:39,321 INFO L87 Difference]: Start difference. First operand 175 states and 312 transitions. Second operand 3 states. [2019-10-15 01:41:39,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:41:39,754 INFO L93 Difference]: Finished difference Result 513 states and 937 transitions. [2019-10-15 01:41:39,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:41:39,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-15 01:41:39,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:41:39,763 INFO L225 Difference]: With dead ends: 513 [2019-10-15 01:41:39,763 INFO L226 Difference]: Without dead ends: 343 [2019-10-15 01:41:39,766 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:41:39,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-10-15 01:41:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2019-10-15 01:41:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-10-15 01:41:39,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 575 transitions. [2019-10-15 01:41:39,805 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 575 transitions. Word has length 94 [2019-10-15 01:41:39,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:41:39,809 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 575 transitions. [2019-10-15 01:41:39,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:41:39,809 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 575 transitions. [2019-10-15 01:41:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-15 01:41:39,815 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:41:39,815 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:41:39,815 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:41:39,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:41:39,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1307299425, now seen corresponding path program 1 times [2019-10-15 01:41:39,816 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:41:39,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290846310] [2019-10-15 01:41:39,817 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:41:39,817 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:41:39,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:41:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:41:39,958 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:41:39,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290846310] [2019-10-15 01:41:39,959 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:41:39,959 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:41:39,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321883857] [2019-10-15 01:41:39,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:41:39,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:41:39,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:41:39,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:41:39,961 INFO L87 Difference]: Start difference. First operand 343 states and 575 transitions. Second operand 6 states. [2019-10-15 01:41:40,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:41:40,666 INFO L93 Difference]: Finished difference Result 1059 states and 1887 transitions. [2019-10-15 01:41:40,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:41:40,668 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2019-10-15 01:41:40,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:41:40,677 INFO L225 Difference]: With dead ends: 1059 [2019-10-15 01:41:40,677 INFO L226 Difference]: Without dead ends: 721 [2019-10-15 01:41:40,681 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:41:40,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-10-15 01:41:40,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 703. [2019-10-15 01:41:40,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-10-15 01:41:40,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1170 transitions. [2019-10-15 01:41:40,769 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1170 transitions. Word has length 108 [2019-10-15 01:41:40,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:41:40,770 INFO L462 AbstractCegarLoop]: Abstraction has 703 states and 1170 transitions. [2019-10-15 01:41:40,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:41:40,770 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1170 transitions. [2019-10-15 01:41:40,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:41:40,779 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:41:40,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:41:40,784 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:41:40,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:41:40,784 INFO L82 PathProgramCache]: Analyzing trace with hash 2071206379, now seen corresponding path program 1 times [2019-10-15 01:41:40,784 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:41:40,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983094071] [2019-10-15 01:41:40,785 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:41:40,785 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:41:40,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:41:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:41:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:41:40,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983094071] [2019-10-15 01:41:40,950 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:41:40,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:41:40,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689118005] [2019-10-15 01:41:40,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:41:40,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:41:40,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:41:40,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:41:40,952 INFO L87 Difference]: Start difference. First operand 703 states and 1170 transitions. Second operand 6 states. [2019-10-15 01:41:41,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:41:41,698 INFO L93 Difference]: Finished difference Result 1783 states and 3030 transitions. [2019-10-15 01:41:41,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:41:41,699 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-10-15 01:41:41,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:41:41,707 INFO L225 Difference]: With dead ends: 1783 [2019-10-15 01:41:41,707 INFO L226 Difference]: Without dead ends: 1085 [2019-10-15 01:41:41,711 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:41:41,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2019-10-15 01:41:41,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1069. [2019-10-15 01:41:41,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2019-10-15 01:41:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1682 transitions. [2019-10-15 01:41:41,778 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1682 transitions. Word has length 114 [2019-10-15 01:41:41,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:41:41,779 INFO L462 AbstractCegarLoop]: Abstraction has 1069 states and 1682 transitions. [2019-10-15 01:41:41,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:41:41,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1682 transitions. [2019-10-15 01:41:41,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-15 01:41:41,784 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:41:41,784 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:41:41,784 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:41:41,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:41:41,785 INFO L82 PathProgramCache]: Analyzing trace with hash 5344754, now seen corresponding path program 1 times [2019-10-15 01:41:41,785 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:41:41,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374803792] [2019-10-15 01:41:41,786 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:41:41,786 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:41:41,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:41:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:41:41,944 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:41:41,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374803792] [2019-10-15 01:41:41,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196391939] [2019-10-15 01:41:41,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:41:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:41:42,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:41:42,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:41:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:41:42,146 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:41:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:41:42,239 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:41:42,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 10 [2019-10-15 01:41:42,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661404906] [2019-10-15 01:41:42,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:41:42,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:41:42,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:41:42,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:41:42,241 INFO L87 Difference]: Start difference. First operand 1069 states and 1682 transitions. Second operand 4 states. [2019-10-15 01:41:42,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:41:42,931 INFO L93 Difference]: Finished difference Result 3159 states and 5117 transitions. [2019-10-15 01:41:42,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:41:42,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-10-15 01:41:42,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:41:42,943 INFO L225 Difference]: With dead ends: 3159 [2019-10-15 01:41:42,944 INFO L226 Difference]: Without dead ends: 1741 [2019-10-15 01:41:42,948 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:41:42,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states. [2019-10-15 01:41:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 1573. [2019-10-15 01:41:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2019-10-15 01:41:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2099 transitions. [2019-10-15 01:41:42,998 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2099 transitions. Word has length 121 [2019-10-15 01:41:42,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:41:42,999 INFO L462 AbstractCegarLoop]: Abstraction has 1573 states and 2099 transitions. [2019-10-15 01:41:42,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:41:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2099 transitions. [2019-10-15 01:41:43,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-15 01:41:43,004 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:41:43,004 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 01:41:43,209 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:41:43,210 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:41:43,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:41:43,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1273080830, now seen corresponding path program 1 times [2019-10-15 01:41:43,212 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:41:43,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845763256] [2019-10-15 01:41:43,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:41:43,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:41:43,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:41:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:41:43,302 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 46 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:41:43,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845763256] [2019-10-15 01:41:43,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540184503] [2019-10-15 01:41:43,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:41:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:41:43,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:41:43,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:41:43,484 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:41:43,485 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:41:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:41:43,544 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:41:43,544 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-15 01:41:43,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803292382] [2019-10-15 01:41:43,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:41:43,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:41:43,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:41:43,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:41:43,546 INFO L87 Difference]: Start difference. First operand 1573 states and 2099 transitions. Second operand 3 states. [2019-10-15 01:41:43,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:41:43,904 INFO L93 Difference]: Finished difference Result 2083 states and 2795 transitions. [2019-10-15 01:41:43,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:41:43,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-15 01:41:43,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:41:43,911 INFO L225 Difference]: With dead ends: 2083 [2019-10-15 01:41:43,912 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:41:43,917 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 252 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-15 01:41:43,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:41:43,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:41:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:41:43,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:41:43,918 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2019-10-15 01:41:43,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:41:43,918 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:41:43,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:41:43,918 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:41:43,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:41:44,128 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:41:44,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:41:44,902 WARN L191 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 49 [2019-10-15 01:41:45,081 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-10-15 01:41:45,247 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-10-15 01:41:45,250 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2019-10-15 01:41:45,250 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:41:45,250 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-10-15 01:41:45,251 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-10-15 01:41:45,251 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-10-15 01:41:45,251 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-10-15 01:41:45,251 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-10-15 01:41:45,251 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-10-15 01:41:45,251 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-10-15 01:41:45,251 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-10-15 01:41:45,252 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-10-15 01:41:45,252 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-10-15 01:41:45,252 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-10-15 01:41:45,252 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 526) no Hoare annotation was computed. [2019-10-15 01:41:45,252 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-10-15 01:41:45,252 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-10-15 01:41:45,253 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-10-15 01:41:45,253 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-10-15 01:41:45,253 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-10-15 01:41:45,253 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-10-15 01:41:45,253 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-10-15 01:41:45,253 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-10-15 01:41:45,253 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-10-15 01:41:45,253 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-10-15 01:41:45,253 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-10-15 01:41:45,254 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-10-15 01:41:45,254 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-10-15 01:41:45,254 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-10-15 01:41:45,254 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-10-15 01:41:45,254 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-10-15 01:41:45,254 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-10-15 01:41:45,254 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-10-15 01:41:45,255 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-10-15 01:41:45,255 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-10-15 01:41:45,255 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-10-15 01:41:45,255 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-10-15 01:41:45,255 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-10-15 01:41:45,255 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2019-10-15 01:41:45,255 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2019-10-15 01:41:45,255 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-10-15 01:41:45,256 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-10-15 01:41:45,256 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-10-15 01:41:45,256 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-10-15 01:41:45,256 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-10-15 01:41:45,256 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-10-15 01:41:45,256 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-10-15 01:41:45,256 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-10-15 01:41:45,256 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-10-15 01:41:45,257 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-10-15 01:41:45,257 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-10-15 01:41:45,257 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-10-15 01:41:45,257 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-10-15 01:41:45,257 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-10-15 01:41:45,257 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-10-15 01:41:45,257 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-10-15 01:41:45,257 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-10-15 01:41:45,258 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-10-15 01:41:45,258 INFO L443 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-10-15 01:41:45,258 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse1 (not (= 1 |old(~a19~0)|))) (.cse2 (not (<= 10 |old(~a28~0)|))) (.cse11 (= 1 |old(~a25~0)|)) (.cse4 (= ~a19~0 1)) (.cse5 (= ~a28~0 |old(~a28~0)|)) (.cse6 (= ~a25~0 |old(~a25~0)|))) (let ((.cse10 (not (< 8 |old(~a28~0)|))) (.cse9 (= 11 |old(~a28~0)|)) (.cse7 (not (<= 8 |old(~a17~0)|))) (.cse8 (<= 8 ~a17~0)) (.cse12 (and .cse4 .cse5 .cse6)) (.cse13 (or .cse1 .cse2 .cse11)) (.cse0 (= 1 |old(~a11~0)|)) (.cse3 (not (= 1 ~a11~0)))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6)) (or .cse0 .cse7 .cse1 .cse8) (or (and .cse5 .cse6) .cse9 .cse10) (or .cse0 .cse7 (and .cse3 .cse8 .cse5 .cse6) .cse11) (or (and .cse8 .cse5 .cse6) .cse7 .cse9) (or .cse12 .cse1 .cse9) (or .cse0 .cse9 .cse11 .cse3 .cse10) (or .cse0 .cse7 .cse9 .cse3) (or .cse7 .cse13 .cse8) (or .cse12 .cse13) (or .cse0 .cse1 .cse11 .cse3)))) [2019-10-15 01:41:45,258 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-10-15 01:41:45,258 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-10-15 01:41:45,259 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-10-15 01:41:45,259 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-10-15 01:41:45,259 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-10-15 01:41:45,259 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-10-15 01:41:45,259 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-10-15 01:41:45,259 INFO L443 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-10-15 01:41:45,259 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-10-15 01:41:45,259 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-10-15 01:41:45,259 INFO L443 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-10-15 01:41:45,260 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-10-15 01:41:45,260 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-10-15 01:41:45,260 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-10-15 01:41:45,260 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-10-15 01:41:45,260 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-10-15 01:41:45,260 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-10-15 01:41:45,260 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-10-15 01:41:45,260 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-10-15 01:41:45,261 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-10-15 01:41:45,261 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-10-15 01:41:45,261 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-10-15 01:41:45,261 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-10-15 01:41:45,261 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-10-15 01:41:45,261 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-10-15 01:41:45,261 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:41:45,261 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= 1 ~a11~0)) (<= 8 ~a17~0) (not (= ~a25~0 1)) (= ~a19~0 1) (not (= ~a28~0 11))) [2019-10-15 01:41:45,262 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:41:45,262 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:41:45,262 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (and (not (= 1 ~a11~0)) (<= 8 ~a17~0) (= ~a19~0 1) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (= 1 |old(~a11~0)|) (not (<= 8 |old(~a17~0)|)) (not (= 1 |old(~a19~0)|)) (= 11 |old(~a28~0)|) (= 1 |old(~a25~0)|)) [2019-10-15 01:41:45,262 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse3 (<= 8 ~a17~0)) (.cse1 (not (= ~a28~0 11))) (.cse2 (not (= 1 ~a11~0))) (.cse4 (not (= ~a25~0 1))) (.cse0 (= ~a19~0 1))) (or (and .cse0 .cse1) (not (<= 8 |old(~a17~0)|)) (and .cse2 .cse3 .cse4) (and .cse3 .cse1) (= 11 |old(~a28~0)|) (= 1 |old(~a25~0)|) (and (< 8 ~a28~0) .cse1) (= 1 |old(~a11~0)|) (and .cse2 .cse0) (not (= 1 |old(~a19~0)|)) (and .cse4 .cse0))) [2019-10-15 01:41:45,262 INFO L443 ceAbstractionStarter]: For program point L606-3(lines 600 617) no Hoare annotation was computed. [2019-10-15 01:41:45,263 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2019-10-15 01:41:45,263 INFO L439 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse3 (<= 8 ~a17~0)) (.cse1 (not (= ~a28~0 11))) (.cse2 (not (= 1 ~a11~0))) (.cse4 (not (= ~a25~0 1))) (.cse0 (= ~a19~0 1))) (or (and .cse0 .cse1) (not (<= 8 |old(~a17~0)|)) (and .cse2 .cse3 .cse4) (and .cse3 .cse1) (= 11 |old(~a28~0)|) (= 1 |old(~a25~0)|) (and (< 8 ~a28~0) .cse1) (= 1 |old(~a11~0)|) (and .cse2 .cse0) (not (= 1 |old(~a19~0)|)) (and .cse4 .cse0))) [2019-10-15 01:41:45,263 INFO L443 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2019-10-15 01:41:45,263 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-10-15 01:41:45,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:41:45 BoogieIcfgContainer [2019-10-15 01:41:45,281 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:41:45,283 INFO L168 Benchmark]: Toolchain (without parser) took 10626.14 ms. Allocated memory was 138.9 MB in the beginning and 377.5 MB in the end (delta: 238.6 MB). Free memory was 101.2 MB in the beginning and 277.3 MB in the end (delta: -176.1 MB). Peak memory consumption was 212.7 MB. Max. memory is 7.1 GB. [2019-10-15 01:41:45,285 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 01:41:45,286 INFO L168 Benchmark]: CACSL2BoogieTranslator took 819.27 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.0 MB in the beginning and 165.4 MB in the end (delta: -64.4 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2019-10-15 01:41:45,286 INFO L168 Benchmark]: Boogie Preprocessor took 101.00 ms. Allocated memory is still 202.9 MB. Free memory was 165.4 MB in the beginning and 160.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. [2019-10-15 01:41:45,287 INFO L168 Benchmark]: RCFGBuilder took 2225.30 ms. Allocated memory was 202.9 MB in the beginning and 247.5 MB in the end (delta: 44.6 MB). Free memory was 160.0 MB in the beginning and 195.9 MB in the end (delta: -35.9 MB). Peak memory consumption was 114.0 MB. Max. memory is 7.1 GB. [2019-10-15 01:41:45,288 INFO L168 Benchmark]: TraceAbstraction took 7475.52 ms. Allocated memory was 247.5 MB in the beginning and 377.5 MB in the end (delta: 130.0 MB). Free memory was 194.1 MB in the beginning and 277.3 MB in the end (delta: -83.2 MB). Peak memory consumption was 197.0 MB. Max. memory is 7.1 GB. [2019-10-15 01:41:45,293 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.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 819.27 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.0 MB in the beginning and 165.4 MB in the end (delta: -64.4 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 101.00 ms. Allocated memory is still 202.9 MB. Free memory was 165.4 MB in the beginning and 160.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2225.30 ms. Allocated memory was 202.9 MB in the beginning and 247.5 MB in the end (delta: 44.6 MB). Free memory was 160.0 MB in the beginning and 195.9 MB in the end (delta: -35.9 MB). Peak memory consumption was 114.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7475.52 ms. Allocated memory was 247.5 MB in the beginning and 377.5 MB in the end (delta: 130.0 MB). Free memory was 194.1 MB in the beginning and 277.3 MB in the end (delta: -83.2 MB). Peak memory consumption was 197.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 526]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((a19 == 1 && !(a28 == 11)) || !(8 <= \old(a17))) || ((!(1 == a11) && 8 <= a17) && !(a25 == 1))) || (8 <= a17 && !(a28 == 11))) || 11 == \old(a28)) || 1 == \old(a25)) || (8 < a28 && !(a28 == 11))) || 1 == \old(a11)) || (!(1 == a11) && a19 == 1)) || !(1 == \old(a19))) || (!(a25 == 1) && a19 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 1 error locations. Result: SAFE, OverallTime: 7.3s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, HoareTripleCheckerStatistics: 318 SDtfs, 736 SDslu, 157 SDs, 0 SdLazy, 2175 SolverSat, 550 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 542 GetRequests, 509 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1573occurred 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.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 202 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 61 PreInvPairs, 117 NumberOfFragments, 411 HoareAnnotationTreeSize, 61 FomulaSimplifications, 1504 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1000 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 898 NumberOfCodeBlocks, 898 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1136 ConstructedInterpolants, 0 QuantifiedInterpolants, 329293 SizeOfPredicates, 4 NumberOfNonLiveVariables, 831 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 295/319 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...