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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/psyco/psyco_security.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:23:08,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:23:08,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:23:08,363 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:23:08,363 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:23:08,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:23:08,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:23:08,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:23:08,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:23:08,370 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:23:08,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:23:08,372 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:23:08,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:23:08,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:23:08,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:23:08,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:23:08,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:23:08,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:23:08,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:23:08,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:23:08,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:23:08,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:23:08,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:23:08,385 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:23:08,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:23:08,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:23:08,388 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:23:08,389 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:23:08,389 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:23:08,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:23:08,391 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:23:08,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:23:08,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:23:08,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:23:08,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:23:08,394 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:23:08,395 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:23:08,395 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:23:08,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:23:08,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:23:08,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:23:08,398 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:23:08,413 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:23:08,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:23:08,414 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:23:08,414 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:23:08,415 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:23:08,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:23:08,415 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:23:08,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:23:08,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:23:08,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:23:08,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:23:08,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:23:08,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:23:08,416 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:23:08,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:23:08,417 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:23:08,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:23:08,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:23:08,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:23:08,418 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:23:08,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:23:08,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:23:08,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:23:08,419 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:23:08,419 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:23:08,419 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:23:08,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:23:08,419 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:23:08,419 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:23:08,719 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:23:08,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:23:08,741 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:23:08,742 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:23:08,743 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:23:08,743 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_security.c [2019-10-13 21:23:08,817 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77508a54e/13a56145d2d94f57a5dd234c890d85b6/FLAG50eb5210c [2019-10-13 21:23:09,293 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:23:09,294 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_security.c [2019-10-13 21:23:09,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77508a54e/13a56145d2d94f57a5dd234c890d85b6/FLAG50eb5210c [2019-10-13 21:23:09,694 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77508a54e/13a56145d2d94f57a5dd234c890d85b6 [2019-10-13 21:23:09,706 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:23:09,708 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:23:09,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:09,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:23:09,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:23:09,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:09" (1/1) ... [2019-10-13 21:23:09,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2730cc86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:09, skipping insertion in model container [2019-10-13 21:23:09,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:09" (1/1) ... [2019-10-13 21:23:09,727 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:23:09,767 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:23:09,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:09,990 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:23:10,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:10,132 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:23:10,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:10 WrapperNode [2019-10-13 21:23:10,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:10,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:23:10,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:23:10,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:23:10,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:10" (1/1) ... [2019-10-13 21:23:10,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:10" (1/1) ... [2019-10-13 21:23:10,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:10" (1/1) ... [2019-10-13 21:23:10,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:10" (1/1) ... [2019-10-13 21:23:10,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:10" (1/1) ... [2019-10-13 21:23:10,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:10" (1/1) ... [2019-10-13 21:23:10,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:10" (1/1) ... [2019-10-13 21:23:10,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:23:10,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:23:10,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:23:10,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:23:10,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:23:10,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:23:10,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:23:10,236 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:23:10,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:23:10,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:23:10,236 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:23:10,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:23:10,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:23:10,694 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:23:10,694 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-10-13 21:23:10,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:10 BoogieIcfgContainer [2019-10-13 21:23:10,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:23:10,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:23:10,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:23:10,700 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:23:10,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:23:09" (1/3) ... [2019-10-13 21:23:10,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15bed767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:10, skipping insertion in model container [2019-10-13 21:23:10,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:10" (2/3) ... [2019-10-13 21:23:10,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15bed767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:10, skipping insertion in model container [2019-10-13 21:23:10,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:10" (3/3) ... [2019-10-13 21:23:10,704 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_security.c [2019-10-13 21:23:10,715 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:23:10,726 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:23:10,737 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:23:10,761 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:23:10,761 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:23:10,761 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:23:10,761 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:23:10,761 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:23:10,761 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:23:10,762 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:23:10,762 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:23:10,782 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2019-10-13 21:23:10,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:23:10,787 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:10,788 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:10,790 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:10,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:10,795 INFO L82 PathProgramCache]: Analyzing trace with hash -105811556, now seen corresponding path program 1 times [2019-10-13 21:23:10,803 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:10,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683019977] [2019-10-13 21:23:10,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:10,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:10,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:10,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:10,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683019977] [2019-10-13 21:23:10,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:10,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 21:23:10,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386338802] [2019-10-13 21:23:10,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 21:23:10,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:10,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 21:23:10,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 21:23:10,942 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 2 states. [2019-10-13 21:23:10,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:10,974 INFO L93 Difference]: Finished difference Result 160 states and 298 transitions. [2019-10-13 21:23:10,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 21:23:10,976 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-10-13 21:23:10,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:10,988 INFO L225 Difference]: With dead ends: 160 [2019-10-13 21:23:10,989 INFO L226 Difference]: Without dead ends: 78 [2019-10-13 21:23:10,992 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 21:23:11,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-13 21:23:11,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-10-13 21:23:11,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-13 21:23:11,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 113 transitions. [2019-10-13 21:23:11,037 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 113 transitions. Word has length 13 [2019-10-13 21:23:11,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:11,038 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 113 transitions. [2019-10-13 21:23:11,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 21:23:11,038 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2019-10-13 21:23:11,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:23:11,039 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:11,039 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:11,040 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:11,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:11,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1547300989, now seen corresponding path program 1 times [2019-10-13 21:23:11,041 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:11,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908017209] [2019-10-13 21:23:11,041 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:11,041 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:11,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:11,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:11,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908017209] [2019-10-13 21:23:11,087 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:11,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:11,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206657931] [2019-10-13 21:23:11,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:11,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:11,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:11,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:11,090 INFO L87 Difference]: Start difference. First operand 78 states and 113 transitions. Second operand 3 states. [2019-10-13 21:23:11,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:11,181 INFO L93 Difference]: Finished difference Result 153 states and 224 transitions. [2019-10-13 21:23:11,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:11,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 21:23:11,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:11,184 INFO L225 Difference]: With dead ends: 153 [2019-10-13 21:23:11,184 INFO L226 Difference]: Without dead ends: 81 [2019-10-13 21:23:11,185 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:11,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-13 21:23:11,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-10-13 21:23:11,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-13 21:23:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 116 transitions. [2019-10-13 21:23:11,196 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 116 transitions. Word has length 14 [2019-10-13 21:23:11,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:11,196 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 116 transitions. [2019-10-13 21:23:11,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:11,197 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2019-10-13 21:23:11,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:23:11,198 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:11,198 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:11,198 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:11,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:11,199 INFO L82 PathProgramCache]: Analyzing trace with hash 555004895, now seen corresponding path program 1 times [2019-10-13 21:23:11,199 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:11,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459249504] [2019-10-13 21:23:11,200 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:11,200 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:11,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:11,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459249504] [2019-10-13 21:23:11,242 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:11,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:11,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135749375] [2019-10-13 21:23:11,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:11,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:11,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:11,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:11,245 INFO L87 Difference]: Start difference. First operand 81 states and 116 transitions. Second operand 3 states. [2019-10-13 21:23:11,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:11,305 INFO L93 Difference]: Finished difference Result 146 states and 213 transitions. [2019-10-13 21:23:11,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:11,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 21:23:11,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:11,308 INFO L225 Difference]: With dead ends: 146 [2019-10-13 21:23:11,308 INFO L226 Difference]: Without dead ends: 72 [2019-10-13 21:23:11,309 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:11,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-13 21:23:11,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-10-13 21:23:11,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-13 21:23:11,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2019-10-13 21:23:11,317 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 19 [2019-10-13 21:23:11,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:11,317 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2019-10-13 21:23:11,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:11,318 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2019-10-13 21:23:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:23:11,319 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:11,319 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:11,319 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:11,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:11,320 INFO L82 PathProgramCache]: Analyzing trace with hash -624681896, now seen corresponding path program 1 times [2019-10-13 21:23:11,320 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:11,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687338182] [2019-10-13 21:23:11,321 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:11,321 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:11,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:11,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687338182] [2019-10-13 21:23:11,380 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:11,380 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:11,380 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666399063] [2019-10-13 21:23:11,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:11,381 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:11,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:11,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:11,383 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. Second operand 3 states. [2019-10-13 21:23:11,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:11,507 INFO L93 Difference]: Finished difference Result 192 states and 280 transitions. [2019-10-13 21:23:11,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:11,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 21:23:11,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:11,509 INFO L225 Difference]: With dead ends: 192 [2019-10-13 21:23:11,509 INFO L226 Difference]: Without dead ends: 122 [2019-10-13 21:23:11,510 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:11,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-13 21:23:11,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2019-10-13 21:23:11,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-13 21:23:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2019-10-13 21:23:11,536 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 22 [2019-10-13 21:23:11,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:11,536 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2019-10-13 21:23:11,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2019-10-13 21:23:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:23:11,540 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:11,540 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:11,542 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:11,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:11,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1531598883, now seen corresponding path program 1 times [2019-10-13 21:23:11,543 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:11,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617265111] [2019-10-13 21:23:11,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:11,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:11,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:11,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617265111] [2019-10-13 21:23:11,593 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:11,593 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:11,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695476147] [2019-10-13 21:23:11,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:11,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:11,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:11,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:11,606 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 3 states. [2019-10-13 21:23:11,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:11,646 INFO L93 Difference]: Finished difference Result 183 states and 260 transitions. [2019-10-13 21:23:11,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:11,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 21:23:11,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:11,648 INFO L225 Difference]: With dead ends: 183 [2019-10-13 21:23:11,648 INFO L226 Difference]: Without dead ends: 87 [2019-10-13 21:23:11,649 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:11,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-13 21:23:11,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-10-13 21:23:11,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-13 21:23:11,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2019-10-13 21:23:11,657 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 23 [2019-10-13 21:23:11,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:11,657 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2019-10-13 21:23:11,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:11,658 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2019-10-13 21:23:11,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 21:23:11,659 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:11,659 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:11,659 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:11,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:11,660 INFO L82 PathProgramCache]: Analyzing trace with hash -576284788, now seen corresponding path program 1 times [2019-10-13 21:23:11,660 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:11,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262534219] [2019-10-13 21:23:11,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:11,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:11,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:11,724 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:23:11,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262534219] [2019-10-13 21:23:11,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:11,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:11,725 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442928977] [2019-10-13 21:23:11,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:11,725 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:11,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:11,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:11,726 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand 3 states. [2019-10-13 21:23:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:11,768 INFO L93 Difference]: Finished difference Result 134 states and 190 transitions. [2019-10-13 21:23:11,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:11,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 21:23:11,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:11,769 INFO L225 Difference]: With dead ends: 134 [2019-10-13 21:23:11,770 INFO L226 Difference]: Without dead ends: 70 [2019-10-13 21:23:11,770 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:11,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-13 21:23:11,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-10-13 21:23:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-13 21:23:11,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2019-10-13 21:23:11,781 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 29 [2019-10-13 21:23:11,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:11,782 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2019-10-13 21:23:11,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:11,786 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2019-10-13 21:23:11,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 21:23:11,787 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:11,788 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:11,788 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:11,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:11,788 INFO L82 PathProgramCache]: Analyzing trace with hash -31288535, now seen corresponding path program 1 times [2019-10-13 21:23:11,788 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:11,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125923985] [2019-10-13 21:23:11,789 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:11,789 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:11,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:11,841 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:23:11,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125923985] [2019-10-13 21:23:11,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:11,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:11,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67435698] [2019-10-13 21:23:11,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:11,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:11,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:11,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:11,843 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand 3 states. [2019-10-13 21:23:11,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:11,921 INFO L93 Difference]: Finished difference Result 158 states and 228 transitions. [2019-10-13 21:23:11,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:11,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 21:23:11,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:11,924 INFO L225 Difference]: With dead ends: 158 [2019-10-13 21:23:11,924 INFO L226 Difference]: Without dead ends: 111 [2019-10-13 21:23:11,924 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:11,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-13 21:23:11,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2019-10-13 21:23:11,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-13 21:23:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2019-10-13 21:23:11,945 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 30 [2019-10-13 21:23:11,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:11,948 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2019-10-13 21:23:11,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:11,949 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2019-10-13 21:23:11,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 21:23:11,950 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:11,950 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:11,950 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:11,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:11,950 INFO L82 PathProgramCache]: Analyzing trace with hash 180888733, now seen corresponding path program 1 times [2019-10-13 21:23:11,951 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:11,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763186306] [2019-10-13 21:23:11,951 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:11,951 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:11,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:11,998 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:23:11,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763186306] [2019-10-13 21:23:11,999 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:11,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:11,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342625858] [2019-10-13 21:23:12,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:12,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:12,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:12,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:12,001 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand 3 states. [2019-10-13 21:23:12,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:12,036 INFO L93 Difference]: Finished difference Result 166 states and 232 transitions. [2019-10-13 21:23:12,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:12,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-13 21:23:12,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:12,038 INFO L225 Difference]: With dead ends: 166 [2019-10-13 21:23:12,038 INFO L226 Difference]: Without dead ends: 92 [2019-10-13 21:23:12,039 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:12,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-13 21:23:12,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-10-13 21:23:12,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-13 21:23:12,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 120 transitions. [2019-10-13 21:23:12,048 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 120 transitions. Word has length 31 [2019-10-13 21:23:12,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:12,049 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 120 transitions. [2019-10-13 21:23:12,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2019-10-13 21:23:12,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 21:23:12,050 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:12,050 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:12,050 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:12,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:12,051 INFO L82 PathProgramCache]: Analyzing trace with hash 317242888, now seen corresponding path program 1 times [2019-10-13 21:23:12,051 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:12,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382874760] [2019-10-13 21:23:12,051 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:12,051 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:12,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:12,109 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:23:12,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382874760] [2019-10-13 21:23:12,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:12,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:12,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092108338] [2019-10-13 21:23:12,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:12,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:12,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:12,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:12,112 INFO L87 Difference]: Start difference. First operand 92 states and 120 transitions. Second operand 3 states. [2019-10-13 21:23:12,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:12,150 INFO L93 Difference]: Finished difference Result 139 states and 184 transitions. [2019-10-13 21:23:12,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:12,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-13 21:23:12,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:12,152 INFO L225 Difference]: With dead ends: 139 [2019-10-13 21:23:12,152 INFO L226 Difference]: Without dead ends: 72 [2019-10-13 21:23:12,154 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:12,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-13 21:23:12,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-10-13 21:23:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-13 21:23:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2019-10-13 21:23:12,163 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 31 [2019-10-13 21:23:12,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:12,164 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2019-10-13 21:23:12,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:12,164 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2019-10-13 21:23:12,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 21:23:12,165 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:12,166 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:12,166 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:12,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:12,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1695196396, now seen corresponding path program 1 times [2019-10-13 21:23:12,172 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:12,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202157093] [2019-10-13 21:23:12,172 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:12,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:12,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:12,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:23:12,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202157093] [2019-10-13 21:23:12,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:12,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:12,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735797035] [2019-10-13 21:23:12,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:12,233 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:12,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:12,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:12,235 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand 3 states. [2019-10-13 21:23:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:12,275 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2019-10-13 21:23:12,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:12,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-13 21:23:12,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:12,277 INFO L225 Difference]: With dead ends: 74 [2019-10-13 21:23:12,278 INFO L226 Difference]: Without dead ends: 70 [2019-10-13 21:23:12,278 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:12,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-13 21:23:12,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-10-13 21:23:12,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-13 21:23:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2019-10-13 21:23:12,288 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 32 [2019-10-13 21:23:12,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:12,288 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2019-10-13 21:23:12,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:12,291 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2019-10-13 21:23:12,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 21:23:12,292 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:12,292 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:12,292 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:12,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:12,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1000030502, now seen corresponding path program 1 times [2019-10-13 21:23:12,293 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:12,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179606369] [2019-10-13 21:23:12,294 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:12,294 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:12,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:12,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:23:12,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179606369] [2019-10-13 21:23:12,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:12,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:12,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959221088] [2019-10-13 21:23:12,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:12,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:12,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:12,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:12,347 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 3 states. [2019-10-13 21:23:12,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:12,374 INFO L93 Difference]: Finished difference Result 111 states and 143 transitions. [2019-10-13 21:23:12,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:12,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-13 21:23:12,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:12,376 INFO L225 Difference]: With dead ends: 111 [2019-10-13 21:23:12,376 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:23:12,376 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:12,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:23:12,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:23:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:23:12,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:23:12,377 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-10-13 21:23:12,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:12,377 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:23:12,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:12,378 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:23:12,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:23:12,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:23:12,485 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:23:12,486 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:23:12,486 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:23:12,486 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:23:12,486 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 21:23:12,486 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:23:12,487 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:23:12,487 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 331) no Hoare annotation was computed. [2019-10-13 21:23:12,487 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 382) no Hoare annotation was computed. [2019-10-13 21:23:12,487 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 261) no Hoare annotation was computed. [2019-10-13 21:23:12,487 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 13 390) no Hoare annotation was computed. [2019-10-13 21:23:12,487 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 199) no Hoare annotation was computed. [2019-10-13 21:23:12,488 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 129) no Hoare annotation was computed. [2019-10-13 21:23:12,488 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 377) no Hoare annotation was computed. [2019-10-13 21:23:12,488 INFO L443 ceAbstractionStarter]: For program point L300(lines 300 315) no Hoare annotation was computed. [2019-10-13 21:23:12,488 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 245) no Hoare annotation was computed. [2019-10-13 21:23:12,488 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 113) no Hoare annotation was computed. [2019-10-13 21:23:12,488 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 361) no Hoare annotation was computed. [2019-10-13 21:23:12,488 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 299) no Hoare annotation was computed. [2019-10-13 21:23:12,488 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 229) no Hoare annotation was computed. [2019-10-13 21:23:12,490 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2019-10-13 21:23:12,490 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 345) no Hoare annotation was computed. [2019-10-13 21:23:12,490 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 213) no Hoare annotation was computed. [2019-10-13 21:23:12,490 INFO L443 ceAbstractionStarter]: For program point L70(lines 70 72) no Hoare annotation was computed. [2019-10-13 21:23:12,490 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 329) no Hoare annotation was computed. [2019-10-13 21:23:12,490 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 197) no Hoare annotation was computed. [2019-10-13 21:23:12,490 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 56) no Hoare annotation was computed. [2019-10-13 21:23:12,490 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 313) no Hoare annotation was computed. [2019-10-13 21:23:12,491 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 13 390) no Hoare annotation was computed. [2019-10-13 21:23:12,492 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 172) no Hoare annotation was computed. [2019-10-13 21:23:12,492 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 297) no Hoare annotation was computed. [2019-10-13 21:23:12,492 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 156) no Hoare annotation was computed. [2019-10-13 21:23:12,493 INFO L439 ceAbstractionStarter]: At program point L22-2(lines 22 385) the Hoare annotation is: (or (and (<= main_~this_state~0 0) (= main_~q~0 0)) (and (= main_~this_state~0 3) (<= 4 main_~q~0))) [2019-10-13 21:23:12,493 INFO L443 ceAbstractionStarter]: For program point L22-3(lines 22 385) no Hoare annotation was computed. [2019-10-13 21:23:12,493 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2019-10-13 21:23:12,493 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 140) no Hoare annotation was computed. [2019-10-13 21:23:12,494 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 389) no Hoare annotation was computed. [2019-10-13 21:23:12,494 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2019-10-13 21:23:12,495 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 124) no Hoare annotation was computed. [2019-10-13 21:23:12,495 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 372) no Hoare annotation was computed. [2019-10-13 21:23:12,495 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 240) no Hoare annotation was computed. [2019-10-13 21:23:12,495 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 108) no Hoare annotation was computed. [2019-10-13 21:23:12,496 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 356) no Hoare annotation was computed. [2019-10-13 21:23:12,496 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 224) no Hoare annotation was computed. [2019-10-13 21:23:12,496 INFO L439 ceAbstractionStarter]: At program point L371(lines 13 390) the Hoare annotation is: false [2019-10-13 21:23:12,496 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 340) no Hoare annotation was computed. [2019-10-13 21:23:12,497 INFO L443 ceAbstractionStarter]: For program point L206(lines 206 208) no Hoare annotation was computed. [2019-10-13 21:23:12,497 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 324) no Hoare annotation was computed. [2019-10-13 21:23:12,497 INFO L443 ceAbstractionStarter]: For program point L190(lines 190 192) no Hoare annotation was computed. [2019-10-13 21:23:12,497 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 308) no Hoare annotation was computed. [2019-10-13 21:23:12,498 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2019-10-13 21:23:12,498 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 46) no Hoare annotation was computed. [2019-10-13 21:23:12,498 INFO L443 ceAbstractionStarter]: For program point L28(lines 28 43) no Hoare annotation was computed. [2019-10-13 21:23:12,498 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 41) no Hoare annotation was computed. [2019-10-13 21:23:12,498 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 13 390) the Hoare annotation is: true [2019-10-13 21:23:12,499 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 95) no Hoare annotation was computed. [2019-10-13 21:23:12,499 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 98) no Hoare annotation was computed. [2019-10-13 21:23:12,501 INFO L443 ceAbstractionStarter]: For program point L64(lines 64 79) no Hoare annotation was computed. [2019-10-13 21:23:12,502 INFO L443 ceAbstractionStarter]: For program point L48(lines 48 63) no Hoare annotation was computed. [2019-10-13 21:23:12,502 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 179) no Hoare annotation was computed. [2019-10-13 21:23:12,503 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 163) no Hoare annotation was computed. [2019-10-13 21:23:12,503 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 93) no Hoare annotation was computed. [2019-10-13 21:23:12,503 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 279) no Hoare annotation was computed. [2019-10-13 21:23:12,503 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 147) no Hoare annotation was computed. [2019-10-13 21:23:12,506 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 182) no Hoare annotation was computed. [2019-10-13 21:23:12,506 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 77) no Hoare annotation was computed. [2019-10-13 21:23:12,506 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 263) no Hoare annotation was computed. [2019-10-13 21:23:12,507 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 131) no Hoare annotation was computed. [2019-10-13 21:23:12,507 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 61) no Hoare annotation was computed. [2019-10-13 21:23:12,507 INFO L443 ceAbstractionStarter]: For program point L364(lines 364 379) no Hoare annotation was computed. [2019-10-13 21:23:12,507 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 247) no Hoare annotation was computed. [2019-10-13 21:23:12,508 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 177) no Hoare annotation was computed. [2019-10-13 21:23:12,508 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 115) no Hoare annotation was computed. [2019-10-13 21:23:12,508 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2019-10-13 21:23:12,508 INFO L439 ceAbstractionStarter]: At program point L381(lines 22 385) the Hoare annotation is: (let ((.cse0 (<= main_~this_state~0 0))) (or (and .cse0 (= 2 main_~q~0)) (and (= 3 main_~q~0) (= 2 main_~this_state~0)) (and .cse0 (= main_~q~0 0)) (and (= main_~this_state~0 3) (<= 4 main_~q~0)))) [2019-10-13 21:23:12,508 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 363) no Hoare annotation was computed. [2019-10-13 21:23:12,508 INFO L443 ceAbstractionStarter]: For program point L216(lines 216 231) no Hoare annotation was computed. [2019-10-13 21:23:12,509 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 282) no Hoare annotation was computed. [2019-10-13 21:23:12,509 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 161) no Hoare annotation was computed. [2019-10-13 21:23:12,509 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 347) no Hoare annotation was computed. [2019-10-13 21:23:12,509 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 277) no Hoare annotation was computed. [2019-10-13 21:23:12,509 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 215) no Hoare annotation was computed. [2019-10-13 21:23:12,509 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 145) no Hoare annotation was computed. [2019-10-13 21:23:12,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:23:12 BoogieIcfgContainer [2019-10-13 21:23:12,532 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:23:12,534 INFO L168 Benchmark]: Toolchain (without parser) took 2825.88 ms. Allocated memory was 144.2 MB in the beginning and 231.7 MB in the end (delta: 87.6 MB). Free memory was 101.7 MB in the beginning and 105.0 MB in the end (delta: -3.3 MB). Peak memory consumption was 84.2 MB. Max. memory is 7.1 GB. [2019-10-13 21:23:12,537 INFO L168 Benchmark]: CDTParser took 1.19 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-10-13 21:23:12,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 421.59 ms. Allocated memory was 144.2 MB in the beginning and 199.8 MB in the end (delta: 55.6 MB). Free memory was 101.4 MB in the beginning and 177.8 MB in the end (delta: -76.4 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2019-10-13 21:23:12,544 INFO L168 Benchmark]: Boogie Preprocessor took 44.53 ms. Allocated memory is still 199.8 MB. Free memory was 177.8 MB in the beginning and 175.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:23:12,545 INFO L168 Benchmark]: RCFGBuilder took 518.12 ms. Allocated memory is still 199.8 MB. Free memory was 175.8 MB in the beginning and 147.9 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:23:12,546 INFO L168 Benchmark]: TraceAbstraction took 1834.83 ms. Allocated memory was 199.8 MB in the beginning and 231.7 MB in the end (delta: 32.0 MB). Free memory was 147.2 MB in the beginning and 105.0 MB in the end (delta: 42.2 MB). Peak memory consumption was 74.2 MB. Max. memory is 7.1 GB. [2019-10-13 21:23:12,558 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.19 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 421.59 ms. Allocated memory was 144.2 MB in the beginning and 199.8 MB in the end (delta: 55.6 MB). Free memory was 101.4 MB in the beginning and 177.8 MB in the end (delta: -76.4 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.53 ms. Allocated memory is still 199.8 MB. Free memory was 177.8 MB in the beginning and 175.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 518.12 ms. Allocated memory is still 199.8 MB. Free memory was 175.8 MB in the beginning and 147.9 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1834.83 ms. Allocated memory was 199.8 MB in the beginning and 231.7 MB in the end (delta: 32.0 MB). Free memory was 147.2 MB in the beginning and 105.0 MB in the end (delta: 42.2 MB). Peak memory consumption was 74.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 389]: 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: 22]: Loop Invariant Derived loop invariant: (((this_state <= 0 && 2 == q) || (3 == q && 2 == this_state)) || (this_state <= 0 && q == 0)) || (this_state == 3 && 4 <= q) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (this_state <= 0 && q == 0) || (this_state == 3 && 4 <= q) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 83 locations, 1 error locations. Result: SAFE, OverallTime: 1.7s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 1008 SDtfs, 337 SDslu, 455 SDs, 0 SdLazy, 217 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 28 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 13 NumberOfFragments, 49 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 27 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 10566 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 55/55 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...