./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 305e9c546a6cc2591d6267bc612ab5ec3e8adaa4 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 17:34:40,648 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 17:34:40,649 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 17:34:40,664 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 17:34:40,664 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 17:34:40,666 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 17:34:40,668 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 17:34:40,670 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 17:34:40,672 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 17:34:40,672 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 17:34:40,674 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 17:34:40,674 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 17:34:40,675 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 17:34:40,676 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 17:34:40,678 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 17:34:40,679 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 17:34:40,680 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 17:34:40,682 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 17:34:40,684 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 17:34:40,686 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 17:34:40,687 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 17:34:40,689 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 17:34:40,692 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 17:34:40,692 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 17:34:40,692 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 17:34:40,694 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 17:34:40,695 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 17:34:40,696 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 17:34:40,697 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 17:34:40,698 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 17:34:40,698 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 17:34:40,700 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 17:34:40,700 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 17:34:40,700 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 17:34:40,701 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 17:34:40,702 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 17:34:40,703 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 17:34:40,728 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 17:34:40,728 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 17:34:40,732 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 17:34:40,732 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 17:34:40,732 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 17:34:40,732 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 17:34:40,733 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 17:34:40,733 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 17:34:40,733 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 17:34:40,733 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 17:34:40,733 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 17:34:40,733 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 17:34:40,734 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 17:34:40,734 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 17:34:40,734 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 17:34:40,734 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 17:34:40,734 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 17:34:40,734 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 17:34:40,735 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 17:34:40,735 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 17:34:40,736 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 17:34:40,736 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 17:34:40,736 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 17:34:40,736 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 17:34:40,736 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 17:34:40,736 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 17:34:40,737 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 17:34:40,737 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 305e9c546a6cc2591d6267bc612ab5ec3e8adaa4 [2019-01-14 17:34:40,791 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 17:34:40,811 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 17:34:40,815 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 17:34:40,817 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 17:34:40,817 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 17:34:40,821 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2019-01-14 17:34:40,878 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7d80035/076e64e4110747d78a2a1b52cab415a5/FLAG75e789659 [2019-01-14 17:34:41,265 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 17:34:41,266 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2019-01-14 17:34:41,272 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7d80035/076e64e4110747d78a2a1b52cab415a5/FLAG75e789659 [2019-01-14 17:34:41,661 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7d80035/076e64e4110747d78a2a1b52cab415a5 [2019-01-14 17:34:41,665 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 17:34:41,667 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 17:34:41,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 17:34:41,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 17:34:41,675 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 17:34:41,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:34:41" (1/1) ... [2019-01-14 17:34:41,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f7c956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:34:41, skipping insertion in model container [2019-01-14 17:34:41,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:34:41" (1/1) ... [2019-01-14 17:34:41,689 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 17:34:41,712 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 17:34:41,924 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 17:34:41,932 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 17:34:41,957 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 17:34:41,974 INFO L195 MainTranslator]: Completed translation [2019-01-14 17:34:41,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:34:41 WrapperNode [2019-01-14 17:34:41,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 17:34:41,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 17:34:41,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 17:34:41,976 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 17:34:41,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:34:41" (1/1) ... [2019-01-14 17:34:41,988 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:34:41" (1/1) ... [2019-01-14 17:34:42,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 17:34:42,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 17:34:42,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 17:34:42,007 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 17:34:42,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:34:41" (1/1) ... [2019-01-14 17:34:42,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:34:41" (1/1) ... [2019-01-14 17:34:42,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:34:41" (1/1) ... [2019-01-14 17:34:42,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:34:41" (1/1) ... [2019-01-14 17:34:42,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:34:41" (1/1) ... [2019-01-14 17:34:42,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:34:41" (1/1) ... [2019-01-14 17:34:42,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:34:41" (1/1) ... [2019-01-14 17:34:42,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 17:34:42,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 17:34:42,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 17:34:42,031 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 17:34:42,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:34:41" (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-01-14 17:34:42,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 17:34:42,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 17:34:42,586 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 17:34:42,586 INFO L286 CfgBuilder]: Removed 21 assue(true) statements. [2019-01-14 17:34:42,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:34:42 BoogieIcfgContainer [2019-01-14 17:34:42,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 17:34:42,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 17:34:42,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 17:34:42,591 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 17:34:42,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 05:34:41" (1/3) ... [2019-01-14 17:34:42,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43567beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 05:34:42, skipping insertion in model container [2019-01-14 17:34:42,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:34:41" (2/3) ... [2019-01-14 17:34:42,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43567beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 05:34:42, skipping insertion in model container [2019-01-14 17:34:42,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:34:42" (3/3) ... [2019-01-14 17:34:42,594 INFO L112 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle_true-unreach-call_true-termination.i [2019-01-14 17:34:42,604 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 17:34:42,613 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-01-14 17:34:42,630 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-01-14 17:34:42,662 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 17:34:42,663 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 17:34:42,663 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 17:34:42,663 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 17:34:42,663 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 17:34:42,663 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 17:34:42,663 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 17:34:42,663 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 17:34:42,663 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 17:34:42,679 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-01-14 17:34:42,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 17:34:42,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:34:42,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:34:42,689 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:34:42,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:34:42,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1436471502, now seen corresponding path program 1 times [2019-01-14 17:34:42,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:34:42,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:34:42,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:34:42,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:34:42,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:34:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:34:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:34:42,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:34:42,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 17:34:42,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 17:34:42,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 17:34:42,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 17:34:42,818 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2019-01-14 17:34:42,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:34:42,840 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2019-01-14 17:34:42,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 17:34:42,841 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-01-14 17:34:42,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:34:42,852 INFO L225 Difference]: With dead ends: 85 [2019-01-14 17:34:42,853 INFO L226 Difference]: Without dead ends: 40 [2019-01-14 17:34:42,856 INFO L631 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-01-14 17:34:42,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-14 17:34:42,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-14 17:34:42,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 17:34:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-01-14 17:34:42,897 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 9 [2019-01-14 17:34:42,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:34:42,897 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-01-14 17:34:42,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 17:34:42,898 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-01-14 17:34:42,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 17:34:42,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:34:42,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:34:42,900 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:34:42,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:34:42,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1526631753, now seen corresponding path program 1 times [2019-01-14 17:34:42,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:34:42,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:34:42,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:34:42,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:34:42,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:34:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:34:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:34:42,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:34:42,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:34:42,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:34:42,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:34:42,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:34:42,992 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 4 states. [2019-01-14 17:34:43,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:34:43,198 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2019-01-14 17:34:43,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:34:43,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-14 17:34:43,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:34:43,200 INFO L225 Difference]: With dead ends: 40 [2019-01-14 17:34:43,201 INFO L226 Difference]: Without dead ends: 34 [2019-01-14 17:34:43,202 INFO L631 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-01-14 17:34:43,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-14 17:34:43,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-14 17:34:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 17:34:43,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-01-14 17:34:43,209 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 10 [2019-01-14 17:34:43,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:34:43,210 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-01-14 17:34:43,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:34:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-01-14 17:34:43,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 17:34:43,210 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:34:43,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:34:43,211 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:34:43,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:34:43,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1785542740, now seen corresponding path program 1 times [2019-01-14 17:34:43,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:34:43,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:34:43,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:34:43,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:34:43,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:34:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:34:43,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:34:43,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:34:43,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 17:34:43,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 17:34:43,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 17:34:43,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 17:34:43,427 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 7 states. [2019-01-14 17:34:43,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:34:43,883 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-01-14 17:34:43,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 17:34:43,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-14 17:34:43,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:34:43,886 INFO L225 Difference]: With dead ends: 51 [2019-01-14 17:34:43,886 INFO L226 Difference]: Without dead ends: 47 [2019-01-14 17:34:43,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-14 17:34:43,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-14 17:34:43,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-01-14 17:34:43,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-14 17:34:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-01-14 17:34:43,896 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 12 [2019-01-14 17:34:43,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:34:43,897 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-01-14 17:34:43,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 17:34:43,897 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-01-14 17:34:43,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 17:34:43,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:34:43,898 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:34:43,899 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:34:43,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:34:43,899 INFO L82 PathProgramCache]: Analyzing trace with hash -734801565, now seen corresponding path program 1 times [2019-01-14 17:34:43,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:34:43,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:34:43,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:34:43,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:34:43,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:34:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:34:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:34:44,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:34:44,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 17:34:44,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 17:34:44,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 17:34:44,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:34:44,012 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 6 states. [2019-01-14 17:34:44,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:34:44,204 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-01-14 17:34:44,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 17:34:44,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-14 17:34:44,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:34:44,205 INFO L225 Difference]: With dead ends: 44 [2019-01-14 17:34:44,205 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 17:34:44,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-14 17:34:44,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 17:34:44,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-14 17:34:44,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 17:34:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-01-14 17:34:44,214 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 15 [2019-01-14 17:34:44,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:34:44,214 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-01-14 17:34:44,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 17:34:44,214 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-01-14 17:34:44,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 17:34:44,215 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:34:44,215 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:34:44,216 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:34:44,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:34:44,216 INFO L82 PathProgramCache]: Analyzing trace with hash -2090765742, now seen corresponding path program 1 times [2019-01-14 17:34:44,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:34:44,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:34:44,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:34:44,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:34:44,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:34:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:34:44,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:34:44,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:34:44,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 17:34:44,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 17:34:44,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 17:34:44,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-14 17:34:44,640 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 8 states. [2019-01-14 17:34:44,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:34:44,880 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-01-14 17:34:44,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 17:34:44,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-01-14 17:34:44,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:34:44,883 INFO L225 Difference]: With dead ends: 71 [2019-01-14 17:34:44,883 INFO L226 Difference]: Without dead ends: 57 [2019-01-14 17:34:44,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-14 17:34:44,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-14 17:34:44,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2019-01-14 17:34:44,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 17:34:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-01-14 17:34:44,893 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 16 [2019-01-14 17:34:44,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:34:44,893 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-01-14 17:34:44,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 17:34:44,894 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-01-14 17:34:44,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 17:34:44,894 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:34:44,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:34:44,895 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:34:44,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:34:44,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1769510362, now seen corresponding path program 1 times [2019-01-14 17:34:44,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:34:44,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:34:44,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:34:44,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:34:44,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:34:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:34:45,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:34:45,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:34:45,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 17:34:45,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 17:34:45,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 17:34:45,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 17:34:45,062 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 9 states. [2019-01-14 17:34:45,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:34:45,898 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-01-14 17:34:45,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 17:34:45,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-01-14 17:34:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:34:45,900 INFO L225 Difference]: With dead ends: 63 [2019-01-14 17:34:45,900 INFO L226 Difference]: Without dead ends: 61 [2019-01-14 17:34:45,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-01-14 17:34:45,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-14 17:34:45,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2019-01-14 17:34:45,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 17:34:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-01-14 17:34:45,918 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 17 [2019-01-14 17:34:45,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:34:45,918 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-01-14 17:34:45,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 17:34:45,919 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-01-14 17:34:45,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 17:34:45,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:34:45,922 INFO L402 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, 1, 1, 1] [2019-01-14 17:34:45,923 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:34:45,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:34:45,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1110583474, now seen corresponding path program 1 times [2019-01-14 17:34:45,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:34:45,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:34:45,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:34:45,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:34:45,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:34:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:34:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:34:46,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:34:46,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:34:46,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:34:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:34:46,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:34:46,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:34:46,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:34:46,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-01-14 17:34:46,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 17:34:46,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 17:34:46,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-01-14 17:34:46,857 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 17 states. [2019-01-14 17:34:47,304 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2019-01-14 17:34:48,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:34:48,096 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-01-14 17:34:48,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 17:34:48,097 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-01-14 17:34:48,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:34:48,100 INFO L225 Difference]: With dead ends: 104 [2019-01-14 17:34:48,100 INFO L226 Difference]: Without dead ends: 82 [2019-01-14 17:34:48,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=313, Invalid=743, Unknown=0, NotChecked=0, Total=1056 [2019-01-14 17:34:48,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-14 17:34:48,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2019-01-14 17:34:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-14 17:34:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-01-14 17:34:48,113 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2019-01-14 17:34:48,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:34:48,113 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-01-14 17:34:48,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 17:34:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-01-14 17:34:48,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 17:34:48,114 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:34:48,114 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:34:48,117 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:34:48,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:34:48,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1311932474, now seen corresponding path program 1 times [2019-01-14 17:34:48,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:34:48,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:34:48,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:34:48,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:34:48,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:34:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:34:48,283 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:34:48,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:34:48,283 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:34:48,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:34:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:34:48,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:34:48,396 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:34:48,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:34:48,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2019-01-14 17:34:48,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 17:34:48,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 17:34:48,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-01-14 17:34:48,420 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 14 states. [2019-01-14 17:34:48,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:34:48,784 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-01-14 17:34:48,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 17:34:48,785 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-01-14 17:34:48,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:34:48,786 INFO L225 Difference]: With dead ends: 77 [2019-01-14 17:34:48,786 INFO L226 Difference]: Without dead ends: 75 [2019-01-14 17:34:48,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2019-01-14 17:34:48,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-14 17:34:48,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-14 17:34:48,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-14 17:34:48,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-01-14 17:34:48,806 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 28 [2019-01-14 17:34:48,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:34:48,807 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-01-14 17:34:48,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 17:34:48,807 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-01-14 17:34:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 17:34:48,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:34:48,808 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:34:48,808 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:34:48,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:34:48,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1348445734, now seen corresponding path program 2 times [2019-01-14 17:34:48,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:34:48,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:34:48,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:34:48,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:34:48,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:34:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:34:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-14 17:34:49,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:34:49,064 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:34:49,083 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 17:34:49,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 17:34:49,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 17:34:49,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:34:49,641 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:34:49,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:34:49,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2019-01-14 17:34:49,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-14 17:34:49,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-14 17:34:49,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2019-01-14 17:34:49,670 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 21 states. [2019-01-14 17:34:51,493 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 17:34:51,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:34:51,591 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-01-14 17:34:51,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-14 17:34:51,592 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-01-14 17:34:51,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:34:51,593 INFO L225 Difference]: With dead ends: 85 [2019-01-14 17:34:51,593 INFO L226 Difference]: Without dead ends: 83 [2019-01-14 17:34:51,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=445, Invalid=1717, Unknown=0, NotChecked=0, Total=2162 [2019-01-14 17:34:51,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-14 17:34:51,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2019-01-14 17:34:51,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-14 17:34:51,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2019-01-14 17:34:51,613 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 39 [2019-01-14 17:34:51,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:34:51,613 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2019-01-14 17:34:51,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-14 17:34:51,613 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2019-01-14 17:34:51,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-14 17:34:51,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:34:51,616 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:34:51,617 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:34:51,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:34:51,617 INFO L82 PathProgramCache]: Analyzing trace with hash 670000306, now seen corresponding path program 2 times [2019-01-14 17:34:51,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:34:51,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:34:51,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:34:51,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 17:34:51,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:34:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:34:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 17:34:51,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:34:51,825 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:34:51,835 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 17:34:51,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 17:34:51,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 17:34:51,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:34:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:34:52,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:34:52,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-01-14 17:34:52,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-14 17:34:52,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-14 17:34:52,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-01-14 17:34:52,316 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 21 states. [2019-01-14 17:34:53,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:34:53,283 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-01-14 17:34:53,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 17:34:53,285 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2019-01-14 17:34:53,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:34:53,285 INFO L225 Difference]: With dead ends: 73 [2019-01-14 17:34:53,285 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 17:34:53,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=323, Invalid=1009, Unknown=0, NotChecked=0, Total=1332 [2019-01-14 17:34:53,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 17:34:53,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 17:34:53,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 17:34:53,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 17:34:53,288 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2019-01-14 17:34:53,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:34:53,289 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 17:34:53,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-14 17:34:53,289 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 17:34:53,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 17:34:53,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 17:34:53,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 17:34:53,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 17:34:53,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 17:34:54,032 WARN L181 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 38 [2019-01-14 17:34:54,271 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2019-01-14 17:34:54,564 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2019-01-14 17:34:54,873 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2019-01-14 17:34:54,876 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-01-14 17:34:54,877 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:34:54,877 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 17:34:54,877 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 17:34:54,877 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:34:54,878 INFO L444 ceAbstractionStarter]: At program point L4-2(lines 3 8) the Hoare annotation is: (let ((.cse5 (+ ULTIMATE.start_main_~buflim~0 2))) (let ((.cse6 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse0 (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0)) (.cse1 (= ULTIMATE.start___VERIFIER_assert_~cond 1)) (.cse2 (<= ULTIMATE.start_main_~bufferlen~0 .cse5)) (.cse3 (<= (+ ULTIMATE.start_main_~buf~0 3) ULTIMATE.start_main_~bufferlen~0)) (.cse4 (<= .cse5 ULTIMATE.start_main_~bufferlen~0))) (or (and .cse0 (<= 2 ULTIMATE.start_main_~buf~0) .cse1 .cse2 (= ULTIMATE.start_main_~in~0 2) .cse3 .cse4) (and .cse0 (= ULTIMATE.start_main_~in~0 0) (= ULTIMATE.start_main_~bufferlen~0 .cse5) (= 0 ULTIMATE.start_main_~buf~0) .cse3 .cse6) (and (<= 3 ULTIMATE.start_main_~buf~0) .cse0 (<= 0 ULTIMATE.start_main_~in~0) (<= (+ ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~in~0 1) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_main_~buf~0 1) .cse3 .cse4 (<= 1 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 1))))) [2019-01-14 17:34:54,878 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:34:54,878 INFO L448 ceAbstractionStarter]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:34:54,878 INFO L444 ceAbstractionStarter]: At program point L4-5(lines 3 8) the Hoare annotation is: (let ((.cse5 (+ ULTIMATE.start_main_~buflim~0 2))) (let ((.cse1 (<= ULTIMATE.start_main_~bufferlen~0 .cse5)) (.cse3 (<= .cse5 ULTIMATE.start_main_~bufferlen~0)) (.cse0 (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0)) (.cse2 (<= (+ ULTIMATE.start_main_~buf~0 3) ULTIMATE.start_main_~bufferlen~0)) (.cse4 (= 1 ULTIMATE.start___VERIFIER_assert_~cond))) (or (and .cse0 (<= 2 ULTIMATE.start_main_~buf~0) .cse1 (= ULTIMATE.start_main_~in~0 2) .cse2 .cse3 .cse4) (and (<= 3 ULTIMATE.start_main_~buf~0) .cse1 .cse2 .cse3 (and .cse0 (<= 0 ULTIMATE.start_main_~in~0) (<= (+ ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~in~0 1) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0))) .cse4) (and .cse0 (= ULTIMATE.start___VERIFIER_assert_~cond 1) .cse1 (<= ULTIMATE.start_main_~buf~0 1) .cse2 .cse3 (<= 1 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 1)) (and .cse0 (= ULTIMATE.start_main_~in~0 0) (= ULTIMATE.start_main_~bufferlen~0 .cse5) (= 0 ULTIMATE.start_main_~buf~0) .cse2 .cse4)))) [2019-01-14 17:34:54,878 INFO L448 ceAbstractionStarter]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:34:54,879 INFO L444 ceAbstractionStarter]: At program point L4-8(lines 3 8) the Hoare annotation is: (let ((.cse5 (+ ULTIMATE.start_main_~buflim~0 2))) (let ((.cse0 (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0)) (.cse1 (= ULTIMATE.start___VERIFIER_assert_~cond 1)) (.cse2 (<= ULTIMATE.start_main_~bufferlen~0 .cse5)) (.cse4 (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0)) (.cse3 (<= .cse5 ULTIMATE.start_main_~bufferlen~0))) (or (and .cse0 .cse1 (<= 2 ULTIMATE.start_main_~bufferlen~0) .cse2 (<= ULTIMATE.start_main_~buf~0 1) .cse3 (<= 1 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 1) (not (= 2 ULTIMATE.start_main_~bufferlen~0))) (and (<= 3 ULTIMATE.start_main_~buf~0) .cse0 .cse1 (<= 0 ULTIMATE.start_main_~in~0) (<= (+ ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~in~0 1) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) .cse2 .cse4 .cse3) (and .cse0 (<= 2 ULTIMATE.start_main_~buf~0) .cse1 .cse2 (= ULTIMATE.start_main_~in~0 2) .cse4 .cse3)))) [2019-01-14 17:34:54,879 INFO L448 ceAbstractionStarter]: For program point L4-9(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:34:54,879 INFO L444 ceAbstractionStarter]: At program point L4-11(lines 3 34) the Hoare annotation is: (let ((.cse5 (+ ULTIMATE.start_main_~buflim~0 2))) (let ((.cse2 (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0)) (.cse0 (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0)) (.cse1 (<= ULTIMATE.start_main_~bufferlen~0 .cse5)) (.cse3 (<= .cse5 ULTIMATE.start_main_~bufferlen~0)) (.cse4 (= 1 ULTIMATE.start___VERIFIER_assert_~cond))) (or (and .cse0 (<= 2 ULTIMATE.start_main_~buf~0) .cse1 (= ULTIMATE.start_main_~in~0 2) .cse2 .cse3 .cse4) (and .cse0 (= ULTIMATE.start_main_~in~0 0) (= ULTIMATE.start_main_~bufferlen~0 .cse5) (= 0 ULTIMATE.start_main_~buf~0) .cse2) (and (<= 3 ULTIMATE.start_main_~buf~0) .cse0 (= ULTIMATE.start___VERIFIER_assert_~cond 1) (<= 0 ULTIMATE.start_main_~in~0) (<= (+ ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~in~0 1) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) .cse1 .cse2 .cse3) (and .cse0 (<= 2 ULTIMATE.start_main_~bufferlen~0) .cse1 (<= ULTIMATE.start_main_~buf~0 1) .cse3 .cse4 (<= 1 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 1) (not (= 2 ULTIMATE.start_main_~bufferlen~0)))))) [2019-01-14 17:34:54,879 INFO L448 ceAbstractionStarter]: For program point L4-12(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:34:54,879 INFO L444 ceAbstractionStarter]: At program point L4-14(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0) (<= 0 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1) (<= 0 ULTIMATE.start_main_~in~0)) [2019-01-14 17:34:54,879 INFO L448 ceAbstractionStarter]: For program point L4-15(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:34:54,879 INFO L444 ceAbstractionStarter]: At program point L4-17(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0) (<= 0 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1) (<= 0 ULTIMATE.start_main_~in~0)) [2019-01-14 17:34:54,880 INFO L448 ceAbstractionStarter]: For program point L4-18(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:34:54,880 INFO L444 ceAbstractionStarter]: At program point L4-20(lines 3 8) the Hoare annotation is: (and (<= 2 ULTIMATE.start_main_~bufferlen~0) (<= (+ ULTIMATE.start_main_~buf~0 1) ULTIMATE.start_main_~bufferlen~0) (<= 0 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1) (<= 0 ULTIMATE.start_main_~in~0)) [2019-01-14 17:34:54,880 INFO L448 ceAbstractionStarter]: For program point L4-21(lines 4 6) no Hoare annotation was computed. [2019-01-14 17:34:54,880 INFO L451 ceAbstractionStarter]: At program point L4-23(lines 3 8) the Hoare annotation is: true [2019-01-14 17:34:54,880 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:34:54,880 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-01-14 17:34:54,880 INFO L448 ceAbstractionStarter]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-01-14 17:34:54,880 INFO L448 ceAbstractionStarter]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-01-14 17:34:54,881 INFO L448 ceAbstractionStarter]: For program point L5-3(line 5) no Hoare annotation was computed. [2019-01-14 17:34:54,881 INFO L448 ceAbstractionStarter]: For program point L5-4(line 5) no Hoare annotation was computed. [2019-01-14 17:34:54,881 INFO L448 ceAbstractionStarter]: For program point L5-5(line 5) no Hoare annotation was computed. [2019-01-14 17:34:54,881 INFO L448 ceAbstractionStarter]: For program point L5-6(line 5) no Hoare annotation was computed. [2019-01-14 17:34:54,881 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2019-01-14 17:34:54,881 INFO L448 ceAbstractionStarter]: For program point L5-7(line 5) no Hoare annotation was computed. [2019-01-14 17:34:54,881 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:34:54,881 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2019-01-14 17:34:54,881 INFO L448 ceAbstractionStarter]: For program point L23-3(lines 23 34) no Hoare annotation was computed. [2019-01-14 17:34:54,881 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:34:54,882 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:34:54,882 INFO L451 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2019-01-14 17:34:54,882 INFO L451 ceAbstractionStarter]: At program point L41-1(lines 10 42) the Hoare annotation is: true [2019-01-14 17:34:54,882 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 17:34:54,882 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2019-01-14 17:34:54,882 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-01-14 17:34:54,882 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:34:54,882 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2019-01-14 17:34:54,883 INFO L448 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2019-01-14 17:34:54,883 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-14 17:34:54,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 05:34:54 BoogieIcfgContainer [2019-01-14 17:34:54,921 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 17:34:54,921 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 17:34:54,922 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 17:34:54,922 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 17:34:54,922 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:34:42" (3/4) ... [2019-01-14 17:34:54,926 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 17:34:54,943 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-01-14 17:34:54,943 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 17:34:55,035 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 17:34:55,038 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 17:34:55,039 INFO L168 Benchmark]: Toolchain (without parser) took 13373.22 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 269.5 MB). Free memory was 946.0 MB in the beginning and 945.3 MB in the end (delta: 669.8 kB). Peak memory consumption was 270.2 MB. Max. memory is 11.5 GB. [2019-01-14 17:34:55,040 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 17:34:55,040 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.56 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 17:34:55,042 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.69 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 17:34:55,042 INFO L168 Benchmark]: Boogie Preprocessor took 23.04 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 17:34:55,048 INFO L168 Benchmark]: RCFGBuilder took 557.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -188.9 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 17:34:55,048 INFO L168 Benchmark]: TraceAbstraction took 12332.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 126.9 MB). Free memory was 1.1 GB in the beginning and 954.0 MB in the end (delta: 164.7 MB). Peak memory consumption was 291.6 MB. Max. memory is 11.5 GB. [2019-01-14 17:34:55,049 INFO L168 Benchmark]: Witness Printer took 116.77 ms. Allocated memory is still 1.3 GB. Free memory was 954.0 MB in the beginning and 945.3 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. [2019-01-14 17:34:55,052 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 306.56 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.69 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.04 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 557.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -188.9 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12332.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 126.9 MB). Free memory was 1.1 GB in the beginning and 954.0 MB in the end (delta: 164.7 MB). Peak memory consumption was 291.6 MB. Max. memory is 11.5 GB. * Witness Printer took 116.77 ms. Allocated memory is still 1.3 GB. Free memory was 954.0 MB in the beginning and 945.3 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((((((bufferlen + 1 <= inlen && 2 <= buf) && bufferlen <= buflim + 2) && in == 2) && buf + 3 <= bufferlen) && buflim + 2 <= bufferlen) && 1 == cond) || (((((3 <= buf && bufferlen <= buflim + 2) && buf + 3 <= bufferlen) && buflim + 2 <= bufferlen) && (bufferlen + 1 <= inlen && 0 <= in) && bufferlen + in + 1 <= buf + inlen) && 1 == cond)) || (((((((bufferlen + 1 <= inlen && cond == 1) && bufferlen <= buflim + 2) && buf <= 1) && buf + 3 <= bufferlen) && buflim + 2 <= bufferlen) && 1 <= buf) && in == 1)) || (((((bufferlen + 1 <= inlen && in == 0) && bufferlen == buflim + 2) && 0 == buf) && buf + 3 <= bufferlen) && 1 == cond) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((2 <= bufferlen && buf + 1 <= bufferlen) && 0 <= buf) && cond == 1) && 0 <= in - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((buf + 2 <= bufferlen && 0 <= buf) && cond == 1) && 0 <= in - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((((((bufferlen + 1 <= inlen && cond == 1) && 2 <= bufferlen) && bufferlen <= buflim + 2) && buf <= 1) && buflim + 2 <= bufferlen) && 1 <= buf) && in == 1) && !(2 == bufferlen)) || (((((((3 <= buf && bufferlen + 1 <= inlen) && cond == 1) && 0 <= in) && bufferlen + in + 1 <= buf + inlen) && bufferlen <= buflim + 2) && buf + 2 <= bufferlen) && buflim + 2 <= bufferlen)) || ((((((bufferlen + 1 <= inlen && 2 <= buf) && cond == 1) && bufferlen <= buflim + 2) && in == 2) && buf + 2 <= bufferlen) && buflim + 2 <= bufferlen) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((((((bufferlen + 1 <= inlen && 2 <= buf) && cond == 1) && bufferlen <= buflim + 2) && in == 2) && buf + 3 <= bufferlen) && buflim + 2 <= bufferlen) || (((((bufferlen + 1 <= inlen && in == 0) && bufferlen == buflim + 2) && 0 == buf) && buf + 3 <= bufferlen) && 1 == cond)) || (((((((3 <= buf && bufferlen + 1 <= inlen) && 0 <= in) && bufferlen + in + 1 <= buf + inlen) && bufferlen <= buflim + 2) && buf + 3 <= bufferlen) && buflim + 2 <= bufferlen) && 1 == cond)) || (((((((bufferlen + 1 <= inlen && cond == 1) && bufferlen <= buflim + 2) && buf <= 1) && buf + 3 <= bufferlen) && buflim + 2 <= bufferlen) && 1 <= buf) && in == 1) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((buf + 2 <= bufferlen && 0 <= buf) && cond == 1) && 0 <= in - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((((((bufferlen + 1 <= inlen && 2 <= buf) && bufferlen <= buflim + 2) && in == 2) && buf + 2 <= bufferlen) && buflim + 2 <= bufferlen) && 1 == cond) || ((((bufferlen + 1 <= inlen && in == 0) && bufferlen == buflim + 2) && 0 == buf) && buf + 2 <= bufferlen)) || (((((((3 <= buf && bufferlen + 1 <= inlen) && cond == 1) && 0 <= in) && bufferlen + in + 1 <= buf + inlen) && bufferlen <= buflim + 2) && buf + 2 <= bufferlen) && buflim + 2 <= bufferlen)) || ((((((((bufferlen + 1 <= inlen && 2 <= bufferlen) && bufferlen <= buflim + 2) && buf <= 1) && buflim + 2 <= bufferlen) && 1 == cond) && 1 <= buf) && in == 1) && !(2 == bufferlen)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 8 error locations. SAFE Result, 12.2s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 256 SDtfs, 1007 SDslu, 729 SDs, 0 SdLazy, 1271 SolverSat, 549 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 306 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1191 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 32 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 44 NumberOfFragments, 536 HoareAnnotationTreeSize, 10 FomulaSimplifications, 2377 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 10 FomulaSimplificationsInter, 1493 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 365 NumberOfCodeBlocks, 365 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 351 ConstructedInterpolants, 0 QuantifiedInterpolants, 102618 SizeOfPredicates, 31 NumberOfNonLiveVariables, 388 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 33/170 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...