./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/bitvector/s3_clnt_3_true-unreach-call_true-no-overflow.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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/bitvector/s3_clnt_3_true-unreach-call_true-no-overflow.BV.c.cil.c -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 c53759a150934ef20fe7ff264c4326cfaaab3702 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 16:01:18,846 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:01:18,848 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:01:18,864 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:01:18,864 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:01:18,865 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:01:18,867 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:01:18,870 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:01:18,871 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:01:18,879 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:01:18,882 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:01:18,883 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:01:18,883 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:01:18,886 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:01:18,890 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:01:18,891 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:01:18,892 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:01:18,896 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:01:18,900 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:01:18,903 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:01:18,905 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:01:18,910 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:01:18,914 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:01:18,914 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:01:18,914 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:01:18,915 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:01:18,918 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:01:18,920 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:01:18,921 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:01:18,924 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:01:18,924 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:01:18,925 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:01:18,925 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:01:18,925 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:01:18,926 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:01:18,929 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:01:18,931 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 16:01:18,959 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:01:18,961 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:01:18,963 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:01:18,964 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:01:18,964 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:01:18,964 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:01:18,965 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:01:18,965 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:01:18,965 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:01:18,965 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:01:18,965 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:01:18,966 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:01:18,966 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:01:18,966 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:01:18,966 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:01:18,967 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:01:18,970 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:01:18,970 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:01:18,970 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:01:18,970 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:01:18,971 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:01:18,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:01:18,971 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:01:18,971 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:01:18,971 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:01:18,972 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:01:18,973 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:01:18,974 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:01:18,974 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 -> c53759a150934ef20fe7ff264c4326cfaaab3702 [2018-12-30 16:01:19,035 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:01:19,050 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:01:19,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:01:19,061 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:01:19,061 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:01:19,062 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/s3_clnt_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-12-30 16:01:19,125 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/530433bb2/9fa5803e8bd144408aec0364b6ef5e2d/FLAGf25f20ce4 [2018-12-30 16:01:19,607 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:01:19,608 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/s3_clnt_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-12-30 16:01:19,619 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/530433bb2/9fa5803e8bd144408aec0364b6ef5e2d/FLAGf25f20ce4 [2018-12-30 16:01:19,918 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/530433bb2/9fa5803e8bd144408aec0364b6ef5e2d [2018-12-30 16:01:19,923 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:01:19,926 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:01:19,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:01:19,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:01:19,931 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:01:19,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:01:19" (1/1) ... [2018-12-30 16:01:19,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7e2a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:01:19, skipping insertion in model container [2018-12-30 16:01:19,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:01:19" (1/1) ... [2018-12-30 16:01:19,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:01:19,988 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:01:20,319 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:01:20,324 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:01:20,389 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:01:20,415 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:01:20,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:01:20 WrapperNode [2018-12-30 16:01:20,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:01:20,417 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:01:20,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:01:20,418 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:01:20,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:01:20" (1/1) ... [2018-12-30 16:01:20,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:01:20" (1/1) ... [2018-12-30 16:01:20,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:01:20,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:01:20,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:01:20,561 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:01:20,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:01:20" (1/1) ... [2018-12-30 16:01:20,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:01:20" (1/1) ... [2018-12-30 16:01:20,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:01:20" (1/1) ... [2018-12-30 16:01:20,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:01:20" (1/1) ... [2018-12-30 16:01:20,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:01:20" (1/1) ... [2018-12-30 16:01:20,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:01:20" (1/1) ... [2018-12-30 16:01:20,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:01:20" (1/1) ... [2018-12-30 16:01:20,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:01:20,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:01:20,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:01:20,604 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:01:20,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:01:20" (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 [2018-12-30 16:01:20,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:01:20,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:01:20,833 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:01:20,837 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:01:21,815 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:01:21,815 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 16:01:21,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:01:21 BoogieIcfgContainer [2018-12-30 16:01:21,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:01:21,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:01:21,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:01:21,819 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:01:21,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:01:19" (1/3) ... [2018-12-30 16:01:21,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47edf07a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:01:21, skipping insertion in model container [2018-12-30 16:01:21,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:01:20" (2/3) ... [2018-12-30 16:01:21,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47edf07a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:01:21, skipping insertion in model container [2018-12-30 16:01:21,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:01:21" (3/3) ... [2018-12-30 16:01:21,822 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-12-30 16:01:21,830 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:01:21,838 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 16:01:21,855 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 16:01:21,888 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:01:21,889 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:01:21,889 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:01:21,889 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:01:21,890 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:01:21,890 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:01:21,890 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:01:21,890 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:01:21,890 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:01:21,910 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2018-12-30 16:01:21,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-30 16:01:21,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:01:21,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:01:21,922 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:01:21,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:01:21,927 INFO L82 PathProgramCache]: Analyzing trace with hash 511659491, now seen corresponding path program 1 times [2018-12-30 16:01:21,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:01:21,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:01:21,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:21,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:01:21,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:01:22,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:01:22,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:01:22,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:01:22,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:01:22,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:01:22,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:22,215 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2018-12-30 16:01:22,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:01:22,511 INFO L93 Difference]: Finished difference Result 246 states and 422 transitions. [2018-12-30 16:01:22,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:01:22,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-30 16:01:22,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:01:22,542 INFO L225 Difference]: With dead ends: 246 [2018-12-30 16:01:22,542 INFO L226 Difference]: Without dead ends: 112 [2018-12-30 16:01:22,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:22,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-30 16:01:22,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-30 16:01:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-30 16:01:22,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 170 transitions. [2018-12-30 16:01:22,594 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 170 transitions. Word has length 24 [2018-12-30 16:01:22,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:01:22,594 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 170 transitions. [2018-12-30 16:01:22,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:01:22,595 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 170 transitions. [2018-12-30 16:01:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-30 16:01:22,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:01:22,598 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:01:22,599 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:01:22,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:01:22,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1971493731, now seen corresponding path program 1 times [2018-12-30 16:01:22,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:01:22,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:01:22,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:22,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:01:22,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:01:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:01:22,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:01:22,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:01:22,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:01:22,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:01:22,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:22,713 INFO L87 Difference]: Start difference. First operand 112 states and 170 transitions. Second operand 3 states. [2018-12-30 16:01:23,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:01:23,260 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2018-12-30 16:01:23,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:01:23,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-30 16:01:23,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:01:23,264 INFO L225 Difference]: With dead ends: 232 [2018-12-30 16:01:23,264 INFO L226 Difference]: Without dead ends: 130 [2018-12-30 16:01:23,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:23,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-30 16:01:23,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2018-12-30 16:01:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-30 16:01:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 190 transitions. [2018-12-30 16:01:23,278 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 190 transitions. Word has length 36 [2018-12-30 16:01:23,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:01:23,279 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 190 transitions. [2018-12-30 16:01:23,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:01:23,279 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 190 transitions. [2018-12-30 16:01:23,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-30 16:01:23,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:01:23,281 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:01:23,281 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:01:23,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:01:23,282 INFO L82 PathProgramCache]: Analyzing trace with hash 441356492, now seen corresponding path program 1 times [2018-12-30 16:01:23,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:01:23,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:01:23,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:23,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:01:23,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:01:23,387 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-30 16:01:23,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:01:23,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:01:23,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:01:23,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:01:23,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:23,389 INFO L87 Difference]: Start difference. First operand 127 states and 190 transitions. Second operand 3 states. [2018-12-30 16:01:23,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:01:23,652 INFO L93 Difference]: Finished difference Result 265 states and 401 transitions. [2018-12-30 16:01:23,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:01:23,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-30 16:01:23,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:01:23,657 INFO L225 Difference]: With dead ends: 265 [2018-12-30 16:01:23,657 INFO L226 Difference]: Without dead ends: 148 [2018-12-30 16:01:23,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:23,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-30 16:01:23,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2018-12-30 16:01:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-30 16:01:23,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 212 transitions. [2018-12-30 16:01:23,672 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 212 transitions. Word has length 50 [2018-12-30 16:01:23,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:01:23,672 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 212 transitions. [2018-12-30 16:01:23,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:01:23,673 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 212 transitions. [2018-12-30 16:01:23,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-30 16:01:23,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:01:23,676 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:01:23,676 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:01:23,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:01:23,677 INFO L82 PathProgramCache]: Analyzing trace with hash -394489400, now seen corresponding path program 1 times [2018-12-30 16:01:23,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:01:23,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:01:23,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:23,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:01:23,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:01:23,779 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-30 16:01:23,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:01:23,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:01:23,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:01:23,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:01:23,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:23,780 INFO L87 Difference]: Start difference. First operand 144 states and 212 transitions. Second operand 3 states. [2018-12-30 16:01:23,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:01:23,899 INFO L93 Difference]: Finished difference Result 410 states and 605 transitions. [2018-12-30 16:01:23,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:01:23,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-30 16:01:23,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:01:23,904 INFO L225 Difference]: With dead ends: 410 [2018-12-30 16:01:23,904 INFO L226 Difference]: Without dead ends: 276 [2018-12-30 16:01:23,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:23,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-12-30 16:01:23,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2018-12-30 16:01:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-12-30 16:01:23,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 405 transitions. [2018-12-30 16:01:23,939 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 405 transitions. Word has length 67 [2018-12-30 16:01:23,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:01:23,939 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 405 transitions. [2018-12-30 16:01:23,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:01:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 405 transitions. [2018-12-30 16:01:23,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-30 16:01:23,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:01:23,944 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:01:23,945 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:01:23,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:01:23,945 INFO L82 PathProgramCache]: Analyzing trace with hash 625494152, now seen corresponding path program 1 times [2018-12-30 16:01:23,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:01:23,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:01:23,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:23,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:01:23,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:01:24,111 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-30 16:01:24,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:01:24,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:01:24,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:01:24,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:01:24,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:24,113 INFO L87 Difference]: Start difference. First operand 276 states and 405 transitions. Second operand 3 states. [2018-12-30 16:01:24,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:01:24,418 INFO L93 Difference]: Finished difference Result 590 states and 878 transitions. [2018-12-30 16:01:24,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:01:24,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-12-30 16:01:24,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:01:24,421 INFO L225 Difference]: With dead ends: 590 [2018-12-30 16:01:24,421 INFO L226 Difference]: Without dead ends: 324 [2018-12-30 16:01:24,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:24,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-12-30 16:01:24,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 318. [2018-12-30 16:01:24,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-12-30 16:01:24,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 457 transitions. [2018-12-30 16:01:24,452 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 457 transitions. Word has length 85 [2018-12-30 16:01:24,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:01:24,453 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 457 transitions. [2018-12-30 16:01:24,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:01:24,453 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 457 transitions. [2018-12-30 16:01:24,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-30 16:01:24,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:01:24,458 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:01:24,458 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:01:24,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:01:24,461 INFO L82 PathProgramCache]: Analyzing trace with hash 743834560, now seen corresponding path program 1 times [2018-12-30 16:01:24,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:01:24,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:01:24,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:24,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:01:24,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:01:24,594 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-30 16:01:24,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:01:24,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:01:24,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:01:24,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:01:24,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:24,596 INFO L87 Difference]: Start difference. First operand 318 states and 457 transitions. Second operand 3 states. [2018-12-30 16:01:24,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:01:24,710 INFO L93 Difference]: Finished difference Result 473 states and 680 transitions. [2018-12-30 16:01:24,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:01:24,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2018-12-30 16:01:24,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:01:24,718 INFO L225 Difference]: With dead ends: 473 [2018-12-30 16:01:24,718 INFO L226 Difference]: Without dead ends: 471 [2018-12-30 16:01:24,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:24,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-12-30 16:01:24,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2018-12-30 16:01:24,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-12-30 16:01:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 678 transitions. [2018-12-30 16:01:24,736 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 678 transitions. Word has length 105 [2018-12-30 16:01:24,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:01:24,737 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 678 transitions. [2018-12-30 16:01:24,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:01:24,737 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 678 transitions. [2018-12-30 16:01:24,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-30 16:01:24,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:01:24,740 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:01:24,741 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:01:24,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:01:24,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1167688199, now seen corresponding path program 1 times [2018-12-30 16:01:24,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:01:24,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:01:24,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:24,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:01:24,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:01:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-30 16:01:24,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:01:24,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:01:24,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:01:24,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:01:24,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:24,858 INFO L87 Difference]: Start difference. First operand 471 states and 678 transitions. Second operand 3 states. [2018-12-30 16:01:25,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:01:25,529 INFO L93 Difference]: Finished difference Result 1082 states and 1605 transitions. [2018-12-30 16:01:25,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:01:25,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-12-30 16:01:25,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:01:25,536 INFO L225 Difference]: With dead ends: 1082 [2018-12-30 16:01:25,536 INFO L226 Difference]: Without dead ends: 618 [2018-12-30 16:01:25,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:25,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-12-30 16:01:25,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 594. [2018-12-30 16:01:25,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-12-30 16:01:25,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 876 transitions. [2018-12-30 16:01:25,576 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 876 transitions. Word has length 123 [2018-12-30 16:01:25,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:01:25,578 INFO L480 AbstractCegarLoop]: Abstraction has 594 states and 876 transitions. [2018-12-30 16:01:25,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:01:25,578 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 876 transitions. [2018-12-30 16:01:25,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-30 16:01:25,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:01:25,580 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 7, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:01:25,580 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:01:25,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:01:25,584 INFO L82 PathProgramCache]: Analyzing trace with hash -266344288, now seen corresponding path program 1 times [2018-12-30 16:01:25,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:01:25,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:01:25,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:25,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:01:25,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:01:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-12-30 16:01:25,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:01:25,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:01:25,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:01:25,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:01:25,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:25,738 INFO L87 Difference]: Start difference. First operand 594 states and 876 transitions. Second operand 3 states. [2018-12-30 16:01:27,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:01:27,308 INFO L93 Difference]: Finished difference Result 1456 states and 2204 transitions. [2018-12-30 16:01:27,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:01:27,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2018-12-30 16:01:27,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:01:27,315 INFO L225 Difference]: With dead ends: 1456 [2018-12-30 16:01:27,316 INFO L226 Difference]: Without dead ends: 821 [2018-12-30 16:01:27,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:27,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2018-12-30 16:01:27,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 783. [2018-12-30 16:01:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-12-30 16:01:27,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1128 transitions. [2018-12-30 16:01:27,346 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1128 transitions. Word has length 149 [2018-12-30 16:01:27,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:01:27,347 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 1128 transitions. [2018-12-30 16:01:27,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:01:27,347 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1128 transitions. [2018-12-30 16:01:27,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-30 16:01:27,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:01:27,351 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:01:27,351 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:01:27,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:01:27,351 INFO L82 PathProgramCache]: Analyzing trace with hash -466571119, now seen corresponding path program 1 times [2018-12-30 16:01:27,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:01:27,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:01:27,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:27,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:01:27,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:01:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-12-30 16:01:27,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:01:27,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:01:27,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:01:27,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:01:27,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:27,478 INFO L87 Difference]: Start difference. First operand 783 states and 1128 transitions. Second operand 3 states. [2018-12-30 16:01:28,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:01:28,174 INFO L93 Difference]: Finished difference Result 1712 states and 2481 transitions. [2018-12-30 16:01:28,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:01:28,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2018-12-30 16:01:28,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:01:28,181 INFO L225 Difference]: With dead ends: 1712 [2018-12-30 16:01:28,181 INFO L226 Difference]: Without dead ends: 894 [2018-12-30 16:01:28,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:28,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2018-12-30 16:01:28,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 858. [2018-12-30 16:01:28,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2018-12-30 16:01:28,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1224 transitions. [2018-12-30 16:01:28,207 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1224 transitions. Word has length 170 [2018-12-30 16:01:28,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:01:28,207 INFO L480 AbstractCegarLoop]: Abstraction has 858 states and 1224 transitions. [2018-12-30 16:01:28,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:01:28,208 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1224 transitions. [2018-12-30 16:01:28,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-30 16:01:28,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:01:28,212 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:01:28,212 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:01:28,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:01:28,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1681812864, now seen corresponding path program 1 times [2018-12-30 16:01:28,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:01:28,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:01:28,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:28,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:01:28,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:01:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-12-30 16:01:28,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:01:28,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:01:28,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:01:28,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:01:28,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:28,329 INFO L87 Difference]: Start difference. First operand 858 states and 1224 transitions. Second operand 3 states. [2018-12-30 16:01:28,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:01:28,883 INFO L93 Difference]: Finished difference Result 1862 states and 2673 transitions. [2018-12-30 16:01:28,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:01:28,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2018-12-30 16:01:28,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:01:28,890 INFO L225 Difference]: With dead ends: 1862 [2018-12-30 16:01:28,890 INFO L226 Difference]: Without dead ends: 987 [2018-12-30 16:01:28,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:28,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2018-12-30 16:01:28,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 951. [2018-12-30 16:01:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-12-30 16:01:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1356 transitions. [2018-12-30 16:01:28,917 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1356 transitions. Word has length 194 [2018-12-30 16:01:28,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:01:28,918 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 1356 transitions. [2018-12-30 16:01:28,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:01:28,918 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1356 transitions. [2018-12-30 16:01:28,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-30 16:01:28,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:01:28,924 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:01:28,928 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:01:28,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:01:28,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1348358718, now seen corresponding path program 1 times [2018-12-30 16:01:28,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:01:28,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:01:28,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:28,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:01:28,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:01:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-12-30 16:01:29,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:01:29,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:01:29,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:01:29,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:01:29,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:29,073 INFO L87 Difference]: Start difference. First operand 951 states and 1356 transitions. Second operand 3 states. [2018-12-30 16:01:29,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:01:29,194 INFO L93 Difference]: Finished difference Result 2833 states and 4038 transitions. [2018-12-30 16:01:29,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:01:29,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2018-12-30 16:01:29,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:01:29,205 INFO L225 Difference]: With dead ends: 2833 [2018-12-30 16:01:29,206 INFO L226 Difference]: Without dead ends: 1892 [2018-12-30 16:01:29,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:29,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2018-12-30 16:01:29,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1890. [2018-12-30 16:01:29,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1890 states. [2018-12-30 16:01:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2693 transitions. [2018-12-30 16:01:29,267 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2693 transitions. Word has length 224 [2018-12-30 16:01:29,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:01:29,267 INFO L480 AbstractCegarLoop]: Abstraction has 1890 states and 2693 transitions. [2018-12-30 16:01:29,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:01:29,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2693 transitions. [2018-12-30 16:01:29,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-30 16:01:29,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:01:29,274 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:01:29,275 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:01:29,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:01:29,275 INFO L82 PathProgramCache]: Analyzing trace with hash 132204992, now seen corresponding path program 1 times [2018-12-30 16:01:29,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:01:29,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:01:29,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:29,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:01:29,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:01:29,434 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2018-12-30 16:01:29,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:01:29,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:01:29,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:01:29,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:01:29,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:29,437 INFO L87 Difference]: Start difference. First operand 1890 states and 2693 transitions. Second operand 3 states. [2018-12-30 16:01:29,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:01:29,943 INFO L93 Difference]: Finished difference Result 4076 states and 5839 transitions. [2018-12-30 16:01:29,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:01:29,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2018-12-30 16:01:29,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:01:29,957 INFO L225 Difference]: With dead ends: 4076 [2018-12-30 16:01:29,958 INFO L226 Difference]: Without dead ends: 2166 [2018-12-30 16:01:29,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:29,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2018-12-30 16:01:30,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2100. [2018-12-30 16:01:30,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2018-12-30 16:01:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 3005 transitions. [2018-12-30 16:01:30,017 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 3005 transitions. Word has length 224 [2018-12-30 16:01:30,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:01:30,018 INFO L480 AbstractCegarLoop]: Abstraction has 2100 states and 3005 transitions. [2018-12-30 16:01:30,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:01:30,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 3005 transitions. [2018-12-30 16:01:30,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-12-30 16:01:30,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:01:30,025 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:01:30,026 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:01:30,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:01:30,027 INFO L82 PathProgramCache]: Analyzing trace with hash 912871510, now seen corresponding path program 1 times [2018-12-30 16:01:30,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:01:30,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:01:30,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:30,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:01:30,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:01:30,155 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2018-12-30 16:01:30,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:01:30,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:01:30,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:01:30,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:01:30,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:30,158 INFO L87 Difference]: Start difference. First operand 2100 states and 3005 transitions. Second operand 3 states. [2018-12-30 16:01:30,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:01:30,603 INFO L93 Difference]: Finished difference Result 4256 states and 6073 transitions. [2018-12-30 16:01:30,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:01:30,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2018-12-30 16:01:30,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:01:30,615 INFO L225 Difference]: With dead ends: 4256 [2018-12-30 16:01:30,615 INFO L226 Difference]: Without dead ends: 2148 [2018-12-30 16:01:30,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:30,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2018-12-30 16:01:30,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2082. [2018-12-30 16:01:30,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2018-12-30 16:01:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 2951 transitions. [2018-12-30 16:01:30,675 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 2951 transitions. Word has length 259 [2018-12-30 16:01:30,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:01:30,675 INFO L480 AbstractCegarLoop]: Abstraction has 2082 states and 2951 transitions. [2018-12-30 16:01:30,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:01:30,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2951 transitions. [2018-12-30 16:01:30,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-12-30 16:01:30,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:01:30,684 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:01:30,684 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:01:30,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:01:30,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1837028224, now seen corresponding path program 1 times [2018-12-30 16:01:30,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:01:30,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:01:30,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:30,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:01:30,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:01:30,899 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2018-12-30 16:01:30,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:01:30,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:01:30,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:01:30,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:01:30,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:30,902 INFO L87 Difference]: Start difference. First operand 2082 states and 2951 transitions. Second operand 3 states. [2018-12-30 16:01:31,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:01:31,115 INFO L93 Difference]: Finished difference Result 6211 states and 8802 transitions. [2018-12-30 16:01:31,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:01:31,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2018-12-30 16:01:31,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:01:31,135 INFO L225 Difference]: With dead ends: 6211 [2018-12-30 16:01:31,135 INFO L226 Difference]: Without dead ends: 4139 [2018-12-30 16:01:31,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:31,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4139 states. [2018-12-30 16:01:31,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4139 to 4137. [2018-12-30 16:01:31,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4137 states. [2018-12-30 16:01:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 5847 transitions. [2018-12-30 16:01:31,255 INFO L78 Accepts]: Start accepts. Automaton has 4137 states and 5847 transitions. Word has length 269 [2018-12-30 16:01:31,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:01:31,256 INFO L480 AbstractCegarLoop]: Abstraction has 4137 states and 5847 transitions. [2018-12-30 16:01:31,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:01:31,256 INFO L276 IsEmpty]: Start isEmpty. Operand 4137 states and 5847 transitions. [2018-12-30 16:01:31,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-12-30 16:01:31,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:01:31,268 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:01:31,268 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:01:31,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:01:31,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1739569540, now seen corresponding path program 1 times [2018-12-30 16:01:31,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:01:31,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:01:31,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:31,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:01:31,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:01:31,452 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2018-12-30 16:01:31,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:01:31,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:01:31,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:01:31,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:01:31,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:31,454 INFO L87 Difference]: Start difference. First operand 4137 states and 5847 transitions. Second operand 3 states. [2018-12-30 16:01:32,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:01:32,761 INFO L93 Difference]: Finished difference Result 8369 states and 11808 transitions. [2018-12-30 16:01:32,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:01:32,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2018-12-30 16:01:32,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:01:32,787 INFO L225 Difference]: With dead ends: 8369 [2018-12-30 16:01:32,788 INFO L226 Difference]: Without dead ends: 4245 [2018-12-30 16:01:32,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:32,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4245 states. [2018-12-30 16:01:32,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4245 to 4137. [2018-12-30 16:01:32,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4137 states. [2018-12-30 16:01:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 5739 transitions. [2018-12-30 16:01:32,889 INFO L78 Accepts]: Start accepts. Automaton has 4137 states and 5739 transitions. Word has length 269 [2018-12-30 16:01:32,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:01:32,890 INFO L480 AbstractCegarLoop]: Abstraction has 4137 states and 5739 transitions. [2018-12-30 16:01:32,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:01:32,890 INFO L276 IsEmpty]: Start isEmpty. Operand 4137 states and 5739 transitions. [2018-12-30 16:01:32,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-12-30 16:01:32,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:01:32,901 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:01:32,902 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:01:32,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:01:32,903 INFO L82 PathProgramCache]: Analyzing trace with hash 938764333, now seen corresponding path program 1 times [2018-12-30 16:01:32,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:01:32,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:01:32,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:32,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:01:32,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:01:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2018-12-30 16:01:33,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:01:33,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:01:33,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:01:33,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:01:33,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:33,037 INFO L87 Difference]: Start difference. First operand 4137 states and 5739 transitions. Second operand 3 states. [2018-12-30 16:01:34,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:01:34,106 INFO L93 Difference]: Finished difference Result 8855 states and 12162 transitions. [2018-12-30 16:01:34,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:01:34,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2018-12-30 16:01:34,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:01:34,127 INFO L225 Difference]: With dead ends: 8855 [2018-12-30 16:01:34,127 INFO L226 Difference]: Without dead ends: 4731 [2018-12-30 16:01:34,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:34,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2018-12-30 16:01:34,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 4311. [2018-12-30 16:01:34,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4311 states. [2018-12-30 16:01:34,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4311 states to 4311 states and 5973 transitions. [2018-12-30 16:01:34,235 INFO L78 Accepts]: Start accepts. Automaton has 4311 states and 5973 transitions. Word has length 296 [2018-12-30 16:01:34,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:01:34,236 INFO L480 AbstractCegarLoop]: Abstraction has 4311 states and 5973 transitions. [2018-12-30 16:01:34,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:01:34,236 INFO L276 IsEmpty]: Start isEmpty. Operand 4311 states and 5973 transitions. [2018-12-30 16:01:34,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-12-30 16:01:34,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:01:34,245 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:01:34,246 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:01:34,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:01:34,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1894222412, now seen corresponding path program 1 times [2018-12-30 16:01:34,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:01:34,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:01:34,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:34,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:01:34,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:01:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2018-12-30 16:01:34,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:01:34,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:01:34,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:01:34,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:01:34,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:34,420 INFO L87 Difference]: Start difference. First operand 4311 states and 5973 transitions. Second operand 3 states. [2018-12-30 16:01:34,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:01:34,943 INFO L93 Difference]: Finished difference Result 8933 states and 12252 transitions. [2018-12-30 16:01:34,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:01:34,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2018-12-30 16:01:34,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:01:34,978 INFO L225 Difference]: With dead ends: 8933 [2018-12-30 16:01:34,979 INFO L226 Difference]: Without dead ends: 4131 [2018-12-30 16:01:34,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:01:34,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4131 states. [2018-12-30 16:01:35,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4131 to 4113. [2018-12-30 16:01:35,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4113 states. [2018-12-30 16:01:35,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4113 states to 4113 states and 5679 transitions. [2018-12-30 16:01:35,072 INFO L78 Accepts]: Start accepts. Automaton has 4113 states and 5679 transitions. Word has length 297 [2018-12-30 16:01:35,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:01:35,073 INFO L480 AbstractCegarLoop]: Abstraction has 4113 states and 5679 transitions. [2018-12-30 16:01:35,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:01:35,073 INFO L276 IsEmpty]: Start isEmpty. Operand 4113 states and 5679 transitions. [2018-12-30 16:01:35,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-12-30 16:01:35,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:01:35,083 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:01:35,084 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:01:35,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:01:35,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1483906000, now seen corresponding path program 1 times [2018-12-30 16:01:35,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:01:35,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:01:35,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:35,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:01:35,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:01:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2018-12-30 16:01:35,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:01:35,304 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 [2018-12-30 16:01:35,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:01:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:01:35,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:01:35,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2018-12-30 16:01:35,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 16:01:35,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-30 16:01:35,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 16:01:35,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 16:01:35,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:01:35,712 INFO L87 Difference]: Start difference. First operand 4113 states and 5679 transitions. Second operand 5 states. [2018-12-30 16:01:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:01:36,940 INFO L93 Difference]: Finished difference Result 9387 states and 13069 transitions. [2018-12-30 16:01:36,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 16:01:36,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 307 [2018-12-30 16:01:36,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:01:36,968 INFO L225 Difference]: With dead ends: 9387 [2018-12-30 16:01:36,968 INFO L226 Difference]: Without dead ends: 5098 [2018-12-30 16:01:36,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-30 16:01:36,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5098 states. [2018-12-30 16:01:37,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5098 to 4274. [2018-12-30 16:01:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4274 states. [2018-12-30 16:01:37,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4274 states to 4274 states and 5908 transitions. [2018-12-30 16:01:37,081 INFO L78 Accepts]: Start accepts. Automaton has 4274 states and 5908 transitions. Word has length 307 [2018-12-30 16:01:37,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:01:37,082 INFO L480 AbstractCegarLoop]: Abstraction has 4274 states and 5908 transitions. [2018-12-30 16:01:37,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 16:01:37,082 INFO L276 IsEmpty]: Start isEmpty. Operand 4274 states and 5908 transitions. [2018-12-30 16:01:37,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-12-30 16:01:37,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:01:37,093 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:01:37,093 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:01:37,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:01:37,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1368718125, now seen corresponding path program 1 times [2018-12-30 16:01:37,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:01:37,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:01:37,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:37,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:01:37,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:01:37,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2018-12-30 16:01:37,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:01:37,386 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 [2018-12-30 16:01:37,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:01:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:01:37,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:01:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2018-12-30 16:01:37,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 16:01:37,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-30 16:01:37,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:01:37,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:01:37,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:01:37,606 INFO L87 Difference]: Start difference. First operand 4274 states and 5908 transitions. Second operand 4 states. [2018-12-30 16:01:39,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:01:39,812 INFO L93 Difference]: Finished difference Result 5429 states and 7539 transitions. [2018-12-30 16:01:39,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:01:39,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2018-12-30 16:01:39,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:01:39,819 INFO L225 Difference]: With dead ends: 5429 [2018-12-30 16:01:39,820 INFO L226 Difference]: Without dead ends: 2207 [2018-12-30 16:01:39,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:01:39,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2018-12-30 16:01:39,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 2207. [2018-12-30 16:01:39,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2207 states. [2018-12-30 16:01:39,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 3065 transitions. [2018-12-30 16:01:39,885 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 3065 transitions. Word has length 308 [2018-12-30 16:01:39,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:01:39,885 INFO L480 AbstractCegarLoop]: Abstraction has 2207 states and 3065 transitions. [2018-12-30 16:01:39,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:01:39,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 3065 transitions. [2018-12-30 16:01:39,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-12-30 16:01:39,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:01:39,891 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:01:39,892 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:01:39,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:01:39,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1115026887, now seen corresponding path program 1 times [2018-12-30 16:01:39,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:01:39,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:01:39,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:39,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:01:39,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:01:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:01:40,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 649 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2018-12-30 16:01:40,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:01:40,150 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 [2018-12-30 16:01:40,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:01:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:01:40,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:01:40,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 649 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2018-12-30 16:01:40,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 16:01:40,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-30 16:01:40,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:01:40,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:01:40,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:01:40,401 INFO L87 Difference]: Start difference. First operand 2207 states and 3065 transitions. Second operand 4 states. [2018-12-30 16:01:41,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:01:41,357 INFO L93 Difference]: Finished difference Result 3153 states and 4322 transitions. [2018-12-30 16:01:41,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:01:41,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2018-12-30 16:01:41,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:01:41,362 INFO L225 Difference]: With dead ends: 3153 [2018-12-30 16:01:41,362 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 16:01:41,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:01:41,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 16:01:41,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 16:01:41,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 16:01:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 16:01:41,367 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 333 [2018-12-30 16:01:41,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:01:41,367 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 16:01:41,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:01:41,367 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 16:01:41,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 16:01:41,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 16:01:41,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:41,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:01:43,237 WARN L181 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 53 DAG size of output: 3 [2018-12-30 16:01:43,364 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2018-12-30 16:01:43,757 WARN L181 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2018-12-30 16:01:44,187 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 24 [2018-12-30 16:01:44,246 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 613) no Hoare annotation was computed. [2018-12-30 16:01:44,246 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 436) no Hoare annotation was computed. [2018-12-30 16:01:44,246 INFO L448 ceAbstractionStarter]: For program point L432-2(lines 202 534) no Hoare annotation was computed. [2018-12-30 16:01:44,247 INFO L451 ceAbstractionStarter]: At program point L201(lines 200 537) the Hoare annotation is: true [2018-12-30 16:01:44,247 INFO L444 ceAbstractionStarter]: At program point L168(lines 164 549) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2018-12-30 16:01:44,247 INFO L444 ceAbstractionStarter]: At program point L102(lines 101 570) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= ULTIMATE.start_ssl3_connect_~s__state~0 12292)) [2018-12-30 16:01:44,247 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 371) no Hoare annotation was computed. [2018-12-30 16:01:44,247 INFO L448 ceAbstractionStarter]: For program point L401(lines 401 406) no Hoare annotation was computed. [2018-12-30 16:01:44,248 INFO L448 ceAbstractionStarter]: For program point L401-2(lines 401 406) no Hoare annotation was computed. [2018-12-30 16:01:44,248 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 547) no Hoare annotation was computed. [2018-12-30 16:01:44,248 INFO L448 ceAbstractionStarter]: For program point L137(lines 137 558) no Hoare annotation was computed. [2018-12-30 16:01:44,248 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 569) no Hoare annotation was computed. [2018-12-30 16:01:44,248 INFO L444 ceAbstractionStarter]: At program point L138(lines 134 559) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2018-12-30 16:01:44,248 INFO L444 ceAbstractionStarter]: At program point L535(lines 98 601) the Hoare annotation is: (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse5 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4416) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse1 .cse2 .cse3) (<= ULTIMATE.start_ssl3_connect_~s__state~0 3) (and .cse4 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse5 (not (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))))) [2018-12-30 16:01:44,248 INFO L448 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2018-12-30 16:01:44,248 INFO L451 ceAbstractionStarter]: At program point L602(lines 97 603) the Hoare annotation is: true [2018-12-30 16:01:44,249 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 546) no Hoare annotation was computed. [2018-12-30 16:01:44,249 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 557) no Hoare annotation was computed. [2018-12-30 16:01:44,249 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 568) no Hoare annotation was computed. [2018-12-30 16:01:44,249 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 376) no Hoare annotation was computed. [2018-12-30 16:01:44,249 INFO L448 ceAbstractionStarter]: For program point L372-2(lines 372 376) no Hoare annotation was computed. [2018-12-30 16:01:44,249 INFO L444 ceAbstractionStarter]: At program point L207(lines 104 569) the Hoare annotation is: (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) [2018-12-30 16:01:44,249 INFO L444 ceAbstractionStarter]: At program point L174(lines 170 547) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2018-12-30 16:01:44,249 INFO L448 ceAbstractionStarter]: For program point L571(lines 571 599) no Hoare annotation was computed. [2018-12-30 16:01:44,249 INFO L448 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2018-12-30 16:01:44,249 INFO L448 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2018-12-30 16:01:44,250 INFO L448 ceAbstractionStarter]: For program point L572(lines 572 596) no Hoare annotation was computed. [2018-12-30 16:01:44,250 INFO L448 ceAbstractionStarter]: For program point L506-1(lines 202 534) no Hoare annotation was computed. [2018-12-30 16:01:44,250 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 346) no Hoare annotation was computed. [2018-12-30 16:01:44,250 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 279) no Hoare annotation was computed. [2018-12-30 16:01:44,250 INFO L448 ceAbstractionStarter]: For program point L308-1(lines 308 322) no Hoare annotation was computed. [2018-12-30 16:01:44,250 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 545) no Hoare annotation was computed. [2018-12-30 16:01:44,250 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 556) no Hoare annotation was computed. [2018-12-30 16:01:44,250 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 567) no Hoare annotation was computed. [2018-12-30 16:01:44,250 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 610) no Hoare annotation was computed. [2018-12-30 16:01:44,250 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 582) no Hoare annotation was computed. [2018-12-30 16:01:44,251 INFO L448 ceAbstractionStarter]: For program point L606-2(lines 606 610) no Hoare annotation was computed. [2018-12-30 16:01:44,251 INFO L448 ceAbstractionStarter]: For program point L573-2(lines 572 594) no Hoare annotation was computed. [2018-12-30 16:01:44,251 INFO L444 ceAbstractionStarter]: At program point L144(lines 140 557) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2018-12-30 16:01:44,251 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 579) no Hoare annotation was computed. [2018-12-30 16:01:44,251 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 448) no Hoare annotation was computed. [2018-12-30 16:01:44,251 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 216) no Hoare annotation was computed. [2018-12-30 16:01:44,251 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 544) no Hoare annotation was computed. [2018-12-30 16:01:44,251 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 555) no Hoare annotation was computed. [2018-12-30 16:01:44,251 INFO L448 ceAbstractionStarter]: For program point L212-2(lines 202 534) no Hoare annotation was computed. [2018-12-30 16:01:44,252 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 566) no Hoare annotation was computed. [2018-12-30 16:01:44,252 INFO L448 ceAbstractionStarter]: For program point L477(lines 477 481) no Hoare annotation was computed. [2018-12-30 16:01:44,252 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 316) no Hoare annotation was computed. [2018-12-30 16:01:44,252 INFO L448 ceAbstractionStarter]: For program point L312-2(lines 310 322) no Hoare annotation was computed. [2018-12-30 16:01:44,252 INFO L444 ceAbstractionStarter]: At program point L180(lines 176 545) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2018-12-30 16:01:44,252 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 511 515) no Hoare annotation was computed. [2018-12-30 16:01:44,252 INFO L448 ceAbstractionStarter]: For program point L412(lines 412 416) no Hoare annotation was computed. [2018-12-30 16:01:44,252 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 253) no Hoare annotation was computed. [2018-12-30 16:01:44,252 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 543) no Hoare annotation was computed. [2018-12-30 16:01:44,252 INFO L448 ceAbstractionStarter]: For program point L149(lines 149 554) no Hoare annotation was computed. [2018-12-30 16:01:44,252 INFO L448 ceAbstractionStarter]: For program point L116(lines 116 565) no Hoare annotation was computed. [2018-12-30 16:01:44,253 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2018-12-30 16:01:44,253 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 65 619) no Hoare annotation was computed. [2018-12-30 16:01:44,253 INFO L444 ceAbstractionStarter]: At program point L150(lines 146 555) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2018-12-30 16:01:44,253 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2018-12-30 16:01:44,253 INFO L448 ceAbstractionStarter]: For program point L482(lines 482 486) no Hoare annotation was computed. [2018-12-30 16:01:44,253 INFO L448 ceAbstractionStarter]: For program point L482-2(lines 482 486) no Hoare annotation was computed. [2018-12-30 16:01:44,253 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 16:01:44,253 INFO L448 ceAbstractionStarter]: For program point L284(lines 284 292) no Hoare annotation was computed. [2018-12-30 16:01:44,253 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 542) no Hoare annotation was computed. [2018-12-30 16:01:44,253 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 553) no Hoare annotation was computed. [2018-12-30 16:01:44,253 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 564) no Hoare annotation was computed. [2018-12-30 16:01:44,254 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 388) no Hoare annotation was computed. [2018-12-30 16:01:44,254 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 355) no Hoare annotation was computed. [2018-12-30 16:01:44,254 INFO L444 ceAbstractionStarter]: At program point L186(lines 182 543) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) .cse1) (and (and .cse0 .cse1) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)))) [2018-12-30 16:01:44,254 INFO L444 ceAbstractionStarter]: At program point L120(lines 116 565) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2018-12-30 16:01:44,254 INFO L444 ceAbstractionStarter]: At program point L352(lines 65 619) the Hoare annotation is: false [2018-12-30 16:01:44,254 INFO L448 ceAbstractionStarter]: For program point $Ultimate##87(lines 202 536) no Hoare annotation was computed. [2018-12-30 16:01:44,254 INFO L451 ceAbstractionStarter]: At program point L617(lines 65 619) the Hoare annotation is: true [2018-12-30 16:01:44,254 INFO L448 ceAbstractionStarter]: For program point L584(lines 584 590) no Hoare annotation was computed. [2018-12-30 16:01:44,254 INFO L448 ceAbstractionStarter]: For program point L518(lines 518 522) no Hoare annotation was computed. [2018-12-30 16:01:44,254 INFO L448 ceAbstractionStarter]: For program point L518-2(lines 518 522) no Hoare annotation was computed. [2018-12-30 16:01:44,255 INFO L448 ceAbstractionStarter]: For program point $Ultimate##88(lines 202 536) no Hoare annotation was computed. [2018-12-30 16:01:44,255 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 291) no Hoare annotation was computed. [2018-12-30 16:01:44,255 INFO L448 ceAbstractionStarter]: For program point L287-2(lines 202 534) no Hoare annotation was computed. [2018-12-30 16:01:44,255 INFO L448 ceAbstractionStarter]: For program point L188(lines 188 541) no Hoare annotation was computed. [2018-12-30 16:01:44,255 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 552) no Hoare annotation was computed. [2018-12-30 16:01:44,255 INFO L448 ceAbstractionStarter]: For program point L122(lines 122 563) no Hoare annotation was computed. [2018-12-30 16:01:44,255 INFO L451 ceAbstractionStarter]: At program point L618(lines 7 620) the Hoare annotation is: true [2018-12-30 16:01:44,255 INFO L448 ceAbstractionStarter]: For program point L453(lines 453 457) no Hoare annotation was computed. [2018-12-30 16:01:44,255 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 16:01:44,255 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 360) no Hoare annotation was computed. [2018-12-30 16:01:44,255 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 241) no Hoare annotation was computed. [2018-12-30 16:01:44,255 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 540) no Hoare annotation was computed. [2018-12-30 16:01:44,256 INFO L448 ceAbstractionStarter]: For program point L158(lines 158 551) no Hoare annotation was computed. [2018-12-30 16:01:44,256 INFO L448 ceAbstractionStarter]: For program point L224-2(lines 202 534) no Hoare annotation was computed. [2018-12-30 16:01:44,256 INFO L448 ceAbstractionStarter]: For program point L125(lines 125 562) no Hoare annotation was computed. [2018-12-30 16:01:44,256 INFO L444 ceAbstractionStarter]: At program point L192(lines 188 541) the Hoare annotation is: (let ((.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)))) [2018-12-30 16:01:44,256 INFO L444 ceAbstractionStarter]: At program point L126(lines 122 563) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2018-12-30 16:01:44,256 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 490 502) no Hoare annotation was computed. [2018-12-30 16:01:44,256 INFO L448 ceAbstractionStarter]: For program point L424(lines 424 428) no Hoare annotation was computed. [2018-12-30 16:01:44,256 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 231) no Hoare annotation was computed. [2018-12-30 16:01:44,256 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 16:01:44,256 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 539) no Hoare annotation was computed. [2018-12-30 16:01:44,257 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 550) no Hoare annotation was computed. [2018-12-30 16:01:44,257 INFO L448 ceAbstractionStarter]: For program point L128(lines 128 561) no Hoare annotation was computed. [2018-12-30 16:01:44,257 INFO L448 ceAbstractionStarter]: For program point L525(lines 525 529) no Hoare annotation was computed. [2018-12-30 16:01:44,257 INFO L444 ceAbstractionStarter]: At program point L195(lines 194 539) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 .cse2 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2 .cse1 (not (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))))) [2018-12-30 16:01:44,257 INFO L444 ceAbstractionStarter]: At program point L162(lines 152 553) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2018-12-30 16:01:44,257 INFO L448 ceAbstractionStarter]: For program point L493(lines 493 498) no Hoare annotation was computed. [2018-12-30 16:01:44,257 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 471) no Hoare annotation was computed. [2018-12-30 16:01:44,257 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 460 471) no Hoare annotation was computed. [2018-12-30 16:01:44,257 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 266) no Hoare annotation was computed. [2018-12-30 16:01:44,258 INFO L448 ceAbstractionStarter]: For program point L262-2(lines 202 534) no Hoare annotation was computed. [2018-12-30 16:01:44,258 INFO L448 ceAbstractionStarter]: For program point L395(lines 395 399) no Hoare annotation was computed. [2018-12-30 16:01:44,258 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 333) no Hoare annotation was computed. [2018-12-30 16:01:44,258 INFO L448 ceAbstractionStarter]: For program point L329-2(lines 202 534) no Hoare annotation was computed. [2018-12-30 16:01:44,258 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 538) no Hoare annotation was computed. [2018-12-30 16:01:44,258 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 549) no Hoare annotation was computed. [2018-12-30 16:01:44,258 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 560) no Hoare annotation was computed. [2018-12-30 16:01:44,258 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 65 619) no Hoare annotation was computed. [2018-12-30 16:01:44,258 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 468) no Hoare annotation was computed. [2018-12-30 16:01:44,258 INFO L451 ceAbstractionStarter]: At program point L198(lines 197 538) the Hoare annotation is: true [2018-12-30 16:01:44,258 INFO L444 ceAbstractionStarter]: At program point L132(lines 128 561) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2018-12-30 16:01:44,259 INFO L448 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-12-30 16:01:44,259 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 237) no Hoare annotation was computed. [2018-12-30 16:01:44,259 INFO L451 ceAbstractionStarter]: At program point L629(lines 621 631) the Hoare annotation is: true [2018-12-30 16:01:44,259 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 303) no Hoare annotation was computed. [2018-12-30 16:01:44,259 INFO L448 ceAbstractionStarter]: For program point L299-2(lines 299 303) no Hoare annotation was computed. [2018-12-30 16:01:44,259 INFO L448 ceAbstractionStarter]: For program point L167(lines 167 548) no Hoare annotation was computed. [2018-12-30 16:01:44,259 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 559) no Hoare annotation was computed. [2018-12-30 16:01:44,259 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 570) no Hoare annotation was computed. [2018-12-30 16:01:44,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:01:44 BoogieIcfgContainer [2018-12-30 16:01:44,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:01:44,302 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:01:44,302 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:01:44,303 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:01:44,303 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:01:21" (3/4) ... [2018-12-30 16:01:44,308 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 16:01:44,326 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-30 16:01:44,327 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 16:01:44,461 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:01:44,461 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:01:44,462 INFO L168 Benchmark]: Toolchain (without parser) took 24537.22 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 595.1 MB). Free memory was 947.3 MB in the beginning and 1.3 GB in the end (delta: -317.3 MB). Peak memory consumption was 277.7 MB. Max. memory is 11.5 GB. [2018-12-30 16:01:44,463 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:01:44,463 INFO L168 Benchmark]: CACSL2BoogieTranslator took 489.23 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 929.8 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-12-30 16:01:44,463 INFO L168 Benchmark]: Boogie Procedure Inliner took 143.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 929.8 MB in the beginning and 1.1 GB in the end (delta: -204.6 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-30 16:01:44,464 INFO L168 Benchmark]: Boogie Preprocessor took 42.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-30 16:01:44,464 INFO L168 Benchmark]: RCFGBuilder took 1212.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. [2018-12-30 16:01:44,464 INFO L168 Benchmark]: TraceAbstraction took 22484.90 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 449.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -196.0 MB). Peak memory consumption was 253.3 MB. Max. memory is 11.5 GB. [2018-12-30 16:01:44,465 INFO L168 Benchmark]: Witness Printer took 159.24 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-12-30 16:01:44,467 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 489.23 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 929.8 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 143.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 929.8 MB in the beginning and 1.1 GB in the end (delta: -204.6 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1212.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22484.90 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 449.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -196.0 MB). Peak memory consumption was 253.3 MB. Max. memory is 11.5 GB. * Witness Printer took 159.24 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 613]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && !(s__hit == 0)) && 4432 <= s__state) || ((blastFlag <= 4 && 4432 <= s__state) && s__state <= 4560) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (blastFlag <= 4 && s__state <= 4448) && 4432 <= s__state - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: blastFlag <= 2 && s__state == 12292 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((s__state == 4416 && blastFlag <= 4) || ((s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state)) || blastFlag <= 2) || (((((4560 <= s__state && s__state <= 4560) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (((((s__state <= 4352 && blastFlag <= 4) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || s__state <= 3) || ((((s__state <= 4352 && s__s3__tmp__next_state___0 <= 3) && blastFlag <= 4) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (s__state <= 4512 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 621]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (4560 <= s__state && blastFlag <= 2) || ((4560 <= s__state && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (s__state <= 4480 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (s__state <= 4480 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((s__state <= 4352 && blastFlag <= 2) && 4352 <= s__state) || (((((s__state <= 4352 && blastFlag <= 4) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((((s__state <= 4352 && s__s3__tmp__next_state___0 <= 3) && blastFlag <= 4) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (s__state <= 4512 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. SAFE Result, 22.3s OverallTime, 20 OverallIterations, 15 TraceHistogramMax, 14.0s AutomataDifference, 0.0s DeadEndRemovalTime, 2.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 3876 SDtfs, 1591 SDslu, 2480 SDs, 0 SdLazy, 2069 SolverSat, 491 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1017 GetRequests, 988 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4311occurred in iteration=16, 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.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 1653 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 192 NumberOfFragments, 284 HoareAnnotationTreeSize, 23 FomulaSimplifications, 14255 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 23 FomulaSimplificationsInter, 8734 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 4737 NumberOfCodeBlocks, 4737 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 4714 ConstructedInterpolants, 0 QuantifiedInterpolants, 1773750 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1840 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 23 InterpolantComputations, 18 PerfectInterpolantSequences, 14378/14424 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...