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/psyco/psyco_io_1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:19:35,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:19:35,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:19:35,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:19:35,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:19:35,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:19:35,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:19:35,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:19:35,626 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:19:35,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:19:35,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:19:35,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:19:35,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:19:35,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:19:35,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:19:35,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:19:35,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:19:35,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:19:35,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:19:35,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:19:35,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:19:35,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:19:35,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:19:35,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:19:35,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:19:35,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:19:35,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:19:35,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:19:35,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:19:35,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:19:35,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:19:35,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:19:35,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:19:35,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:19:35,664 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:19:35,665 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:19:35,666 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:19:35,666 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:19:35,666 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:19:35,667 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:19:35,670 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:19:35,671 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 23:19:35,705 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:19:35,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:19:35,707 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:19:35,707 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:19:35,708 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:19:35,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:19:35,710 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:19:35,710 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:19:35,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:19:35,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:19:35,711 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:19:35,711 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:19:35,711 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:19:35,711 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:19:35,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:19:35,712 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:19:35,715 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:19:35,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:19:35,716 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:19:35,716 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:19:35,716 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:19:35,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:19:35,716 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:19:35,717 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:19:35,717 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:19:35,717 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:19:35,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:19:35,717 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:19:35,718 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 23:19:36,030 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:19:36,048 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:19:36,053 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:19:36,055 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:19:36,055 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:19:36,056 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_io_1.c [2019-10-13 23:19:36,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed98e84e/6c3d195b00944dbdacccd33f742a790c/FLAGe15261994 [2019-10-13 23:19:36,624 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:19:36,625 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_io_1.c [2019-10-13 23:19:36,637 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed98e84e/6c3d195b00944dbdacccd33f742a790c/FLAGe15261994 [2019-10-13 23:19:36,982 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed98e84e/6c3d195b00944dbdacccd33f742a790c [2019-10-13 23:19:36,992 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:19:36,994 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:19:36,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:19:36,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:19:36,998 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:19:36,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:19:36" (1/1) ... [2019-10-13 23:19:37,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac258e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:19:37, skipping insertion in model container [2019-10-13 23:19:37,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:19:36" (1/1) ... [2019-10-13 23:19:37,008 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:19:37,042 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:19:37,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:19:37,232 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:19:37,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:19:37,365 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:19:37,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:19:37 WrapperNode [2019-10-13 23:19:37,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:19:37,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:19:37,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:19:37,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:19:37,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:19:37" (1/1) ... [2019-10-13 23:19:37,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:19:37" (1/1) ... [2019-10-13 23:19:37,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:19:37" (1/1) ... [2019-10-13 23:19:37,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:19:37" (1/1) ... [2019-10-13 23:19:37,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:19:37" (1/1) ... [2019-10-13 23:19:37,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:19:37" (1/1) ... [2019-10-13 23:19:37,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:19:37" (1/1) ... [2019-10-13 23:19:37,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:19:37,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:19:37,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:19:37,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:19:37,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:19:37" (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 23:19:37,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:19:37,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:19:37,484 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:19:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 23:19:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:19:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:19:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:19:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:19:37,951 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:19:37,951 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-13 23:19:37,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:19:37 BoogieIcfgContainer [2019-10-13 23:19:37,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:19:37,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:19:37,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:19:37,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:19:37,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:19:36" (1/3) ... [2019-10-13 23:19:37,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1b7565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:19:37, skipping insertion in model container [2019-10-13 23:19:37,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:19:37" (2/3) ... [2019-10-13 23:19:37,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1b7565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:19:37, skipping insertion in model container [2019-10-13 23:19:37,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:19:37" (3/3) ... [2019-10-13 23:19:37,961 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_io_1.c [2019-10-13 23:19:37,971 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:19:37,980 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:19:37,991 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:19:38,013 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:19:38,013 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:19:38,013 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:19:38,014 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:19:38,014 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:19:38,014 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:19:38,014 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:19:38,014 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:19:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2019-10-13 23:19:38,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 23:19:38,037 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:19:38,038 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:19:38,039 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:19:38,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:19:38,043 INFO L82 PathProgramCache]: Analyzing trace with hash 938862966, now seen corresponding path program 1 times [2019-10-13 23:19:38,050 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:19:38,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983306687] [2019-10-13 23:19:38,051 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:19:38,051 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:19:38,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:19:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:19:38,200 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 23:19:38,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983306687] [2019-10-13 23:19:38,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:19:38,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 23:19:38,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768513745] [2019-10-13 23:19:38,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 23:19:38,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:19:38,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 23:19:38,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 23:19:38,225 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 2 states. [2019-10-13 23:19:38,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:19:38,257 INFO L93 Difference]: Finished difference Result 135 states and 249 transitions. [2019-10-13 23:19:38,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 23:19:38,259 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-10-13 23:19:38,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:19:38,272 INFO L225 Difference]: With dead ends: 135 [2019-10-13 23:19:38,272 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 23:19:38,276 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 23:19:38,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 23:19:38,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-10-13 23:19:38,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-13 23:19:38,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2019-10-13 23:19:38,324 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 90 transitions. Word has length 12 [2019-10-13 23:19:38,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:19:38,324 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 90 transitions. [2019-10-13 23:19:38,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 23:19:38,325 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2019-10-13 23:19:38,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 23:19:38,326 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:19:38,326 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:19:38,326 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:19:38,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:19:38,327 INFO L82 PathProgramCache]: Analyzing trace with hash -427525637, now seen corresponding path program 1 times [2019-10-13 23:19:38,327 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:19:38,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449256527] [2019-10-13 23:19:38,328 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:19:38,328 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:19:38,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:19:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:19:38,389 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 23:19:38,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449256527] [2019-10-13 23:19:38,389 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:19:38,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:19:38,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039745287] [2019-10-13 23:19:38,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:19:38,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:19:38,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:19:38,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:19:38,393 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. Second operand 3 states. [2019-10-13 23:19:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:19:38,482 INFO L93 Difference]: Finished difference Result 118 states and 179 transitions. [2019-10-13 23:19:38,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:19:38,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 23:19:38,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:19:38,484 INFO L225 Difference]: With dead ends: 118 [2019-10-13 23:19:38,484 INFO L226 Difference]: Without dead ends: 63 [2019-10-13 23:19:38,486 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 23:19:38,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-13 23:19:38,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-10-13 23:19:38,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-13 23:19:38,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 93 transitions. [2019-10-13 23:19:38,508 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 93 transitions. Word has length 13 [2019-10-13 23:19:38,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:19:38,509 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 93 transitions. [2019-10-13 23:19:38,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:19:38,509 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 93 transitions. [2019-10-13 23:19:38,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 23:19:38,510 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:19:38,510 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:19:38,511 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:19:38,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:19:38,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1823893817, now seen corresponding path program 1 times [2019-10-13 23:19:38,511 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:19:38,512 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886228328] [2019-10-13 23:19:38,512 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:19:38,513 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:19:38,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:19:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:19:38,617 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 23:19:38,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886228328] [2019-10-13 23:19:38,619 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:19:38,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:19:38,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555199820] [2019-10-13 23:19:38,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:19:38,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:19:38,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:19:38,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:19:38,622 INFO L87 Difference]: Start difference. First operand 63 states and 93 transitions. Second operand 3 states. [2019-10-13 23:19:38,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:19:38,679 INFO L93 Difference]: Finished difference Result 112 states and 168 transitions. [2019-10-13 23:19:38,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:19:38,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 23:19:38,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:19:38,684 INFO L225 Difference]: With dead ends: 112 [2019-10-13 23:19:38,684 INFO L226 Difference]: Without dead ends: 55 [2019-10-13 23:19:38,685 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 23:19:38,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-13 23:19:38,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-10-13 23:19:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-13 23:19:38,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2019-10-13 23:19:38,696 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 18 [2019-10-13 23:19:38,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:19:38,697 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2019-10-13 23:19:38,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:19:38,697 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2019-10-13 23:19:38,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 23:19:38,702 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:19:38,702 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 23:19:38,703 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:19:38,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:19:38,703 INFO L82 PathProgramCache]: Analyzing trace with hash -229892154, now seen corresponding path program 1 times [2019-10-13 23:19:38,704 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:19:38,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082447981] [2019-10-13 23:19:38,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:19:38,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:19:38,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:19:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:19:38,775 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 23:19:38,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082447981] [2019-10-13 23:19:38,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:19:38,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:19:38,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835258553] [2019-10-13 23:19:38,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:19:38,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:19:38,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:19:38,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:19:38,778 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. Second operand 3 states. [2019-10-13 23:19:38,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:19:38,860 INFO L93 Difference]: Finished difference Result 139 states and 209 transitions. [2019-10-13 23:19:38,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:19:38,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 23:19:38,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:19:38,862 INFO L225 Difference]: With dead ends: 139 [2019-10-13 23:19:38,863 INFO L226 Difference]: Without dead ends: 93 [2019-10-13 23:19:38,863 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 23:19:38,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-13 23:19:38,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2019-10-13 23:19:38,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-13 23:19:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2019-10-13 23:19:38,874 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 23 [2019-10-13 23:19:38,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:19:38,874 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2019-10-13 23:19:38,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:19:38,874 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2019-10-13 23:19:38,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 23:19:38,875 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:19:38,876 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, 1] [2019-10-13 23:19:38,876 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:19:38,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:19:38,876 INFO L82 PathProgramCache]: Analyzing trace with hash -566484954, now seen corresponding path program 1 times [2019-10-13 23:19:38,877 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:19:38,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453059226] [2019-10-13 23:19:38,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:19:38,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:19:38,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:19:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:19:38,941 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 23:19:38,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453059226] [2019-10-13 23:19:38,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:19:38,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:19:38,942 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949529368] [2019-10-13 23:19:38,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:19:38,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:19:38,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:19:38,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:19:38,944 INFO L87 Difference]: Start difference. First operand 90 states and 131 transitions. Second operand 3 states. [2019-10-13 23:19:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:19:38,985 INFO L93 Difference]: Finished difference Result 179 states and 261 transitions. [2019-10-13 23:19:38,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:19:38,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 23:19:38,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:19:38,987 INFO L225 Difference]: With dead ends: 179 [2019-10-13 23:19:38,988 INFO L226 Difference]: Without dead ends: 100 [2019-10-13 23:19:38,989 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 23:19:38,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-13 23:19:38,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-10-13 23:19:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-13 23:19:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 139 transitions. [2019-10-13 23:19:39,012 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 139 transitions. Word has length 24 [2019-10-13 23:19:39,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:19:39,013 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 139 transitions. [2019-10-13 23:19:39,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:19:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 139 transitions. [2019-10-13 23:19:39,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 23:19:39,014 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:19:39,015 INFO L380 BasicCegarLoop]: trace histogram [3, 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] [2019-10-13 23:19:39,015 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:19:39,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:19:39,016 INFO L82 PathProgramCache]: Analyzing trace with hash 357038310, now seen corresponding path program 1 times [2019-10-13 23:19:39,016 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:19:39,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888793434] [2019-10-13 23:19:39,016 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:19:39,017 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:19:39,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:19:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:19:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 23:19:39,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888793434] [2019-10-13 23:19:39,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:19:39,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:19:39,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176606536] [2019-10-13 23:19:39,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:19:39,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:19:39,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:19:39,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:19:39,068 INFO L87 Difference]: Start difference. First operand 98 states and 139 transitions. Second operand 3 states. [2019-10-13 23:19:39,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:19:39,096 INFO L93 Difference]: Finished difference Result 163 states and 233 transitions. [2019-10-13 23:19:39,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:19:39,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-13 23:19:39,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:19:39,098 INFO L225 Difference]: With dead ends: 163 [2019-10-13 23:19:39,098 INFO L226 Difference]: Without dead ends: 76 [2019-10-13 23:19:39,099 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 23:19:39,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-13 23:19:39,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-10-13 23:19:39,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-13 23:19:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2019-10-13 23:19:39,107 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 35 [2019-10-13 23:19:39,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:19:39,107 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2019-10-13 23:19:39,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:19:39,107 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2019-10-13 23:19:39,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 23:19:39,108 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:19:39,109 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, 1, 1, 1] [2019-10-13 23:19:39,109 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:19:39,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:19:39,109 INFO L82 PathProgramCache]: Analyzing trace with hash 448490246, now seen corresponding path program 1 times [2019-10-13 23:19:39,110 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:19:39,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447464379] [2019-10-13 23:19:39,110 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:19:39,110 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:19:39,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:19:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:19:39,201 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 23:19:39,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447464379] [2019-10-13 23:19:39,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:19:39,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:19:39,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518142856] [2019-10-13 23:19:39,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:19:39,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:19:39,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:19:39,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:19:39,204 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand 4 states. [2019-10-13 23:19:39,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:19:39,259 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2019-10-13 23:19:39,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:19:39,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-10-13 23:19:39,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:19:39,261 INFO L225 Difference]: With dead ends: 79 [2019-10-13 23:19:39,261 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 23:19:39,262 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:19:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 23:19:39,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 23:19:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 23:19:39,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 23:19:39,264 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2019-10-13 23:19:39,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:19:39,265 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 23:19:39,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:19:39,266 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 23:19:39,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 23:19:39,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 23:19:39,392 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-13 23:19:39,392 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 23:19:39,393 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 23:19:39,393 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 23:19:39,393 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 23:19:39,393 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 23:19:39,393 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 13 344) no Hoare annotation was computed. [2019-10-13 23:19:39,393 INFO L443 ceAbstractionStarter]: For program point L36(lines 36 47) no Hoare annotation was computed. [2019-10-13 23:19:39,393 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 101) no Hoare annotation was computed. [2019-10-13 23:19:39,393 INFO L443 ceAbstractionStarter]: For program point L53(lines 53 104) no Hoare annotation was computed. [2019-10-13 23:19:39,394 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 217) no Hoare annotation was computed. [2019-10-13 23:19:39,394 INFO L443 ceAbstractionStarter]: For program point L70(lines 70 85) no Hoare annotation was computed. [2019-10-13 23:19:39,394 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 333) no Hoare annotation was computed. [2019-10-13 23:19:39,394 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 201) no Hoare annotation was computed. [2019-10-13 23:19:39,394 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 69) no Hoare annotation was computed. [2019-10-13 23:19:39,394 INFO L439 ceAbstractionStarter]: At program point L335(lines 23 339) the Hoare annotation is: (let ((.cse0 (= main_~this_sink~0 0))) (or (and (= 2 main_~q~0) .cse0) (and (= main_~q~0 0) .cse0) (and (<= 3 main_~q~0) (not .cse0)))) [2019-10-13 23:19:39,395 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 317) no Hoare annotation was computed. [2019-10-13 23:19:39,395 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 13 344) no Hoare annotation was computed. [2019-10-13 23:19:39,395 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 185) no Hoare annotation was computed. [2019-10-13 23:19:39,395 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 301) no Hoare annotation was computed. [2019-10-13 23:19:39,395 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 169) no Hoare annotation was computed. [2019-10-13 23:19:39,395 INFO L443 ceAbstractionStarter]: For program point L88(lines 88 99) no Hoare annotation was computed. [2019-10-13 23:19:39,395 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 285) no Hoare annotation was computed. [2019-10-13 23:19:39,395 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 215) no Hoare annotation was computed. [2019-10-13 23:19:39,396 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 153) no Hoare annotation was computed. [2019-10-13 23:19:39,396 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 220) no Hoare annotation was computed. [2019-10-13 23:19:39,396 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 83) no Hoare annotation was computed. [2019-10-13 23:19:39,396 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 331) no Hoare annotation was computed. [2019-10-13 23:19:39,396 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 269) no Hoare annotation was computed. [2019-10-13 23:19:39,396 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 336) no Hoare annotation was computed. [2019-10-13 23:19:39,396 INFO L443 ceAbstractionStarter]: For program point L188(lines 188 199) no Hoare annotation was computed. [2019-10-13 23:19:39,396 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 137) no Hoare annotation was computed. [2019-10-13 23:19:39,396 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 67) no Hoare annotation was computed. [2019-10-13 23:19:39,397 INFO L439 ceAbstractionStarter]: At program point L23-2(lines 23 339) the Hoare annotation is: (let ((.cse0 (= main_~this_sink~0 0))) (or (and (= main_~q~0 0) .cse0) (and (<= 3 main_~q~0) (not .cse0)))) [2019-10-13 23:19:39,397 INFO L443 ceAbstractionStarter]: For program point L23-3(lines 23 339) no Hoare annotation was computed. [2019-10-13 23:19:39,397 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 315) no Hoare annotation was computed. [2019-10-13 23:19:39,397 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 253) no Hoare annotation was computed. [2019-10-13 23:19:39,397 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 183) no Hoare annotation was computed. [2019-10-13 23:19:39,397 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 121) no Hoare annotation was computed. [2019-10-13 23:19:39,397 INFO L443 ceAbstractionStarter]: For program point L40(lines 40 42) no Hoare annotation was computed. [2019-10-13 23:19:39,398 INFO L443 ceAbstractionStarter]: For program point L288(lines 288 299) no Hoare annotation was computed. [2019-10-13 23:19:39,398 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 237) no Hoare annotation was computed. [2019-10-13 23:19:39,398 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 167) no Hoare annotation was computed. [2019-10-13 23:19:39,398 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 283) no Hoare annotation was computed. [2019-10-13 23:19:39,398 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 151) no Hoare annotation was computed. [2019-10-13 23:19:39,398 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 267) no Hoare annotation was computed. [2019-10-13 23:19:39,398 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 135) no Hoare annotation was computed. [2019-10-13 23:19:39,398 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 251) no Hoare annotation was computed. [2019-10-13 23:19:39,398 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 119) no Hoare annotation was computed. [2019-10-13 23:19:39,399 INFO L443 ceAbstractionStarter]: For program point L224(lines 224 235) no Hoare annotation was computed. [2019-10-13 23:19:39,399 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 94) no Hoare annotation was computed. [2019-10-13 23:19:39,399 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 210) no Hoare annotation was computed. [2019-10-13 23:19:39,399 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2019-10-13 23:19:39,399 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-10-13 23:19:39,399 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 194) no Hoare annotation was computed. [2019-10-13 23:19:39,399 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 62) no Hoare annotation was computed. [2019-10-13 23:19:39,399 INFO L443 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2019-10-13 23:19:39,399 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 178) no Hoare annotation was computed. [2019-10-13 23:19:39,400 INFO L439 ceAbstractionStarter]: At program point L325(lines 13 344) the Hoare annotation is: false [2019-10-13 23:19:39,400 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 294) no Hoare annotation was computed. [2019-10-13 23:19:39,400 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 162) no Hoare annotation was computed. [2019-10-13 23:19:39,400 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 278) no Hoare annotation was computed. [2019-10-13 23:19:39,400 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 146) no Hoare annotation was computed. [2019-10-13 23:19:39,400 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 262) no Hoare annotation was computed. [2019-10-13 23:19:39,400 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 130) no Hoare annotation was computed. [2019-10-13 23:19:39,400 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 246) no Hoare annotation was computed. [2019-10-13 23:19:39,400 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 114) no Hoare annotation was computed. [2019-10-13 23:19:39,401 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 230) no Hoare annotation was computed. [2019-10-13 23:19:39,401 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 13 344) the Hoare annotation is: true [2019-10-13 23:19:39,401 INFO L443 ceAbstractionStarter]: For program point L33(lines 33 52) no Hoare annotation was computed. [2019-10-13 23:19:39,401 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 49) no Hoare annotation was computed. [2019-10-13 23:19:39,401 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 343) no Hoare annotation was computed. [2019-10-13 23:19:39,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 11:19:39 BoogieIcfgContainer [2019-10-13 23:19:39,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 23:19:39,418 INFO L168 Benchmark]: Toolchain (without parser) took 2422.66 ms. Allocated memory was 138.9 MB in the beginning and 235.9 MB in the end (delta: 97.0 MB). Free memory was 102.3 MB in the beginning and 165.0 MB in the end (delta: -62.8 MB). Peak memory consumption was 34.2 MB. Max. memory is 7.1 GB. [2019-10-13 23:19:39,419 INFO L168 Benchmark]: CDTParser took 1.28 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 23:19:39,420 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.26 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 102.0 MB in the beginning and 180.3 MB in the end (delta: -78.3 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-10-13 23:19:39,420 INFO L168 Benchmark]: Boogie Preprocessor took 51.63 ms. Allocated memory is still 201.9 MB. Free memory was 180.3 MB in the beginning and 177.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-10-13 23:19:39,421 INFO L168 Benchmark]: RCFGBuilder took 534.81 ms. Allocated memory is still 201.9 MB. Free memory was 177.7 MB in the beginning and 151.4 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-10-13 23:19:39,422 INFO L168 Benchmark]: TraceAbstraction took 1460.49 ms. Allocated memory was 201.9 MB in the beginning and 235.9 MB in the end (delta: 34.1 MB). Free memory was 150.7 MB in the beginning and 165.0 MB in the end (delta: -14.3 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2019-10-13 23:19:39,426 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.28 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 371.26 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 102.0 MB in the beginning and 180.3 MB in the end (delta: -78.3 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.63 ms. Allocated memory is still 201.9 MB. Free memory was 180.3 MB in the beginning and 177.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 534.81 ms. Allocated memory is still 201.9 MB. Free memory was 177.7 MB in the beginning and 151.4 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1460.49 ms. Allocated memory was 201.9 MB in the beginning and 235.9 MB in the end (delta: 34.1 MB). Free memory was 150.7 MB in the beginning and 165.0 MB in the end (delta: -14.3 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 343]: 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: 23]: Loop Invariant Derived loop invariant: ((2 == q && this_sink == 0) || (q == 0 && this_sink == 0)) || (3 <= q && !(this_sink == 0)) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (q == 0 && this_sink == 0) || (3 <= q && !(this_sink == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 72 locations, 1 error locations. Result: SAFE, OverallTime: 1.3s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 542 SDtfs, 190 SDslu, 284 SDs, 0 SdLazy, 87 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 14 NumberOfFragments, 44 HoareAnnotationTreeSize, 7 FomulaSimplifications, 29 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 6427 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 27/27 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...