./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label22_true-unreach-call_false-termination.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/eca-rers2012/Problem01_label22_true-unreach-call_false-termination.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 d643ba28d95f16d18742963f1ebc32166d4daeb8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 19:41:09,016 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 19:41:09,019 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 19:41:09,032 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 19:41:09,034 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 19:41:09,036 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 19:41:09,039 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 19:41:09,041 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 19:41:09,043 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 19:41:09,045 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 19:41:09,047 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 19:41:09,048 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 19:41:09,049 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 19:41:09,052 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 19:41:09,058 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 19:41:09,062 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 19:41:09,063 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 19:41:09,067 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 19:41:09,069 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 19:41:09,071 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 19:41:09,074 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 19:41:09,075 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 19:41:09,077 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 19:41:09,077 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 19:41:09,077 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 19:41:09,078 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 19:41:09,079 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 19:41:09,080 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 19:41:09,080 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 19:41:09,081 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 19:41:09,082 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 19:41:09,082 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 19:41:09,082 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 19:41:09,083 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 19:41:09,083 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 19:41:09,084 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 19:41:09,084 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 19:41:09,111 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 19:41:09,111 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 19:41:09,113 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 19:41:09,117 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 19:41:09,117 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 19:41:09,117 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 19:41:09,118 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 19:41:09,118 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 19:41:09,118 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 19:41:09,118 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 19:41:09,118 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 19:41:09,118 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 19:41:09,118 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 19:41:09,119 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 19:41:09,119 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 19:41:09,119 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 19:41:09,119 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 19:41:09,119 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 19:41:09,120 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 19:41:09,122 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 19:41:09,122 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 19:41:09,123 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 19:41:09,123 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 19:41:09,123 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 19:41:09,123 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 19:41:09,123 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 19:41:09,123 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 19:41:09,124 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 19:41:09,124 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 -> d643ba28d95f16d18742963f1ebc32166d4daeb8 [2018-12-30 19:41:09,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 19:41:09,177 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 19:41:09,180 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 19:41:09,182 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 19:41:09,182 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 19:41:09,183 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label22_true-unreach-call_false-termination.c [2018-12-30 19:41:09,241 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3890fb37d/e0ce73931d214b9bb4ea9f078cfd623c/FLAG8a481301e [2018-12-30 19:41:09,780 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 19:41:09,780 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label22_true-unreach-call_false-termination.c [2018-12-30 19:41:09,800 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3890fb37d/e0ce73931d214b9bb4ea9f078cfd623c/FLAG8a481301e [2018-12-30 19:41:10,032 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3890fb37d/e0ce73931d214b9bb4ea9f078cfd623c [2018-12-30 19:41:10,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 19:41:10,037 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 19:41:10,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 19:41:10,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 19:41:10,042 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 19:41:10,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 07:41:10" (1/1) ... [2018-12-30 19:41:10,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd3e7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:10, skipping insertion in model container [2018-12-30 19:41:10,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 07:41:10" (1/1) ... [2018-12-30 19:41:10,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 19:41:10,119 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 19:41:10,645 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 19:41:10,651 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 19:41:10,747 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 19:41:10,769 INFO L195 MainTranslator]: Completed translation [2018-12-30 19:41:10,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:10 WrapperNode [2018-12-30 19:41:10,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 19:41:10,770 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 19:41:10,770 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 19:41:10,771 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 19:41:10,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:10" (1/1) ... [2018-12-30 19:41:10,799 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:10" (1/1) ... [2018-12-30 19:41:10,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 19:41:10,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 19:41:10,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 19:41:10,965 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 19:41:10,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:10" (1/1) ... [2018-12-30 19:41:10,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:10" (1/1) ... [2018-12-30 19:41:10,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:10" (1/1) ... [2018-12-30 19:41:10,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:10" (1/1) ... [2018-12-30 19:41:11,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:10" (1/1) ... [2018-12-30 19:41:11,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:10" (1/1) ... [2018-12-30 19:41:11,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:10" (1/1) ... [2018-12-30 19:41:11,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 19:41:11,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 19:41:11,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 19:41:11,053 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 19:41:11,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 19:41:11,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 19:41:11,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 19:41:14,481 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 19:41:14,481 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 19:41:14,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:41:14 BoogieIcfgContainer [2018-12-30 19:41:14,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 19:41:14,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 19:41:14,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 19:41:14,488 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 19:41:14,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 07:41:10" (1/3) ... [2018-12-30 19:41:14,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b10308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 07:41:14, skipping insertion in model container [2018-12-30 19:41:14,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:10" (2/3) ... [2018-12-30 19:41:14,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b10308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 07:41:14, skipping insertion in model container [2018-12-30 19:41:14,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:41:14" (3/3) ... [2018-12-30 19:41:14,495 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label22_true-unreach-call_false-termination.c [2018-12-30 19:41:14,509 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 19:41:14,527 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 19:41:14,550 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 19:41:14,592 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 19:41:14,593 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 19:41:14,593 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 19:41:14,593 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 19:41:14,593 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 19:41:14,593 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 19:41:14,594 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 19:41:14,594 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 19:41:14,594 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 19:41:14,619 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2018-12-30 19:41:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-30 19:41:14,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:14,636 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:41:14,639 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:14,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:14,647 INFO L82 PathProgramCache]: Analyzing trace with hash -278590162, now seen corresponding path program 1 times [2018-12-30 19:41:14,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:14,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:14,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:14,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:14,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:15,395 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 19:41:15,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:15,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:41:15,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:41:15,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:41:15,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:15,426 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2018-12-30 19:41:17,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:17,936 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2018-12-30 19:41:17,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:41:17,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-12-30 19:41:17,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:17,961 INFO L225 Difference]: With dead ends: 662 [2018-12-30 19:41:17,961 INFO L226 Difference]: Without dead ends: 397 [2018-12-30 19:41:17,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:17,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-12-30 19:41:18,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2018-12-30 19:41:18,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-12-30 19:41:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 559 transitions. [2018-12-30 19:41:18,047 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 559 transitions. Word has length 127 [2018-12-30 19:41:18,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:18,049 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 559 transitions. [2018-12-30 19:41:18,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:41:18,049 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 559 transitions. [2018-12-30 19:41:18,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-30 19:41:18,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:18,053 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:41:18,054 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:18,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:18,054 INFO L82 PathProgramCache]: Analyzing trace with hash 249291862, now seen corresponding path program 1 times [2018-12-30 19:41:18,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:18,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:18,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:18,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:18,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:18,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:41:18,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:18,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:41:18,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:41:18,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:41:18,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:18,228 INFO L87 Difference]: Start difference. First operand 397 states and 559 transitions. Second operand 4 states. [2018-12-30 19:41:19,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:19,502 INFO L93 Difference]: Finished difference Result 1185 states and 1672 transitions. [2018-12-30 19:41:19,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:41:19,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2018-12-30 19:41:19,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:19,509 INFO L225 Difference]: With dead ends: 1185 [2018-12-30 19:41:19,509 INFO L226 Difference]: Without dead ends: 790 [2018-12-30 19:41:19,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:19,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-12-30 19:41:19,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2018-12-30 19:41:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2018-12-30 19:41:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2018-12-30 19:41:19,555 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 132 [2018-12-30 19:41:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:19,555 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2018-12-30 19:41:19,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:41:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2018-12-30 19:41:19,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-30 19:41:19,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:19,560 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:41:19,560 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:19,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:19,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1600100500, now seen corresponding path program 1 times [2018-12-30 19:41:19,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:19,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:19,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:19,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:19,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:19,663 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-30 19:41:19,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:19,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:41:19,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:41:19,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:41:19,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:19,665 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2018-12-30 19:41:20,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:20,745 INFO L93 Difference]: Finished difference Result 1971 states and 2686 transitions. [2018-12-30 19:41:20,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:41:20,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2018-12-30 19:41:20,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:20,752 INFO L225 Difference]: With dead ends: 1971 [2018-12-30 19:41:20,753 INFO L226 Difference]: Without dead ends: 1183 [2018-12-30 19:41:20,755 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 19:41:20,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2018-12-30 19:41:20,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 921. [2018-12-30 19:41:20,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2018-12-30 19:41:20,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1246 transitions. [2018-12-30 19:41:20,791 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1246 transitions. Word has length 153 [2018-12-30 19:41:20,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:20,792 INFO L480 AbstractCegarLoop]: Abstraction has 921 states and 1246 transitions. [2018-12-30 19:41:20,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:41:20,792 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1246 transitions. [2018-12-30 19:41:20,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-30 19:41:20,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:20,796 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:41:20,796 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:20,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:20,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1232280553, now seen corresponding path program 1 times [2018-12-30 19:41:20,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:20,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:20,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:20,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:20,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:20,990 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-30 19:41:20,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:20,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:41:20,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:41:20,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:41:20,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:20,992 INFO L87 Difference]: Start difference. First operand 921 states and 1246 transitions. Second operand 3 states. [2018-12-30 19:41:22,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:22,904 INFO L93 Difference]: Finished difference Result 2233 states and 2997 transitions. [2018-12-30 19:41:22,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:41:22,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-12-30 19:41:22,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:22,912 INFO L225 Difference]: With dead ends: 2233 [2018-12-30 19:41:22,913 INFO L226 Difference]: Without dead ends: 1314 [2018-12-30 19:41:22,914 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 19:41:22,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2018-12-30 19:41:22,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1052. [2018-12-30 19:41:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2018-12-30 19:41:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1370 transitions. [2018-12-30 19:41:22,948 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1370 transitions. Word has length 189 [2018-12-30 19:41:22,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:22,949 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 1370 transitions. [2018-12-30 19:41:22,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:41:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1370 transitions. [2018-12-30 19:41:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-30 19:41:22,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:22,954 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:41:22,954 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:22,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:22,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1116748331, now seen corresponding path program 1 times [2018-12-30 19:41:22,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:22,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:22,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:22,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:22,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:23,200 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-30 19:41:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-12-30 19:41:23,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:23,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:41:23,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:41:23,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:41:23,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:23,256 INFO L87 Difference]: Start difference. First operand 1052 states and 1370 transitions. Second operand 4 states. [2018-12-30 19:41:24,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:24,007 INFO L93 Difference]: Finished difference Result 2238 states and 2892 transitions. [2018-12-30 19:41:24,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 19:41:24,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-12-30 19:41:24,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:24,019 INFO L225 Difference]: With dead ends: 2238 [2018-12-30 19:41:24,019 INFO L226 Difference]: Without dead ends: 1188 [2018-12-30 19:41:24,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 19:41:24,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2018-12-30 19:41:24,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1183. [2018-12-30 19:41:24,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2018-12-30 19:41:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1507 transitions. [2018-12-30 19:41:24,046 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1507 transitions. Word has length 197 [2018-12-30 19:41:24,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:24,046 INFO L480 AbstractCegarLoop]: Abstraction has 1183 states and 1507 transitions. [2018-12-30 19:41:24,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:41:24,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1507 transitions. [2018-12-30 19:41:24,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-30 19:41:24,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:24,051 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:41:24,051 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:24,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:24,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1390292323, now seen corresponding path program 1 times [2018-12-30 19:41:24,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:24,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:24,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:24,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:24,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:24,190 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-12-30 19:41:24,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:24,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:41:24,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 19:41:24,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 19:41:24,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:41:24,191 INFO L87 Difference]: Start difference. First operand 1183 states and 1507 transitions. Second operand 5 states. [2018-12-30 19:41:25,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:25,304 INFO L93 Difference]: Finished difference Result 2495 states and 3215 transitions. [2018-12-30 19:41:25,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 19:41:25,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 201 [2018-12-30 19:41:25,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:25,320 INFO L225 Difference]: With dead ends: 2495 [2018-12-30 19:41:25,320 INFO L226 Difference]: Without dead ends: 1445 [2018-12-30 19:41:25,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:41:25,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2018-12-30 19:41:25,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2018-12-30 19:41:25,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2018-12-30 19:41:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1799 transitions. [2018-12-30 19:41:25,357 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1799 transitions. Word has length 201 [2018-12-30 19:41:25,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:25,357 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 1799 transitions. [2018-12-30 19:41:25,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 19:41:25,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1799 transitions. [2018-12-30 19:41:25,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-30 19:41:25,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:25,364 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:41:25,365 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:25,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:25,365 INFO L82 PathProgramCache]: Analyzing trace with hash 651133218, now seen corresponding path program 1 times [2018-12-30 19:41:25,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:25,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:25,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:25,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:25,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-12-30 19:41:25,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:25,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:41:25,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:41:25,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:41:25,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:25,540 INFO L87 Difference]: Start difference. First operand 1445 states and 1799 transitions. Second operand 3 states. [2018-12-30 19:41:26,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:26,183 INFO L93 Difference]: Finished difference Result 3150 states and 3936 transitions. [2018-12-30 19:41:26,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:41:26,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-12-30 19:41:26,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:26,191 INFO L225 Difference]: With dead ends: 3150 [2018-12-30 19:41:26,191 INFO L226 Difference]: Without dead ends: 1576 [2018-12-30 19:41:26,193 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 19:41:26,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2018-12-30 19:41:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2018-12-30 19:41:26,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2018-12-30 19:41:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1592 transitions. [2018-12-30 19:41:26,222 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1592 transitions. Word has length 204 [2018-12-30 19:41:26,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:26,222 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 1592 transitions. [2018-12-30 19:41:26,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:41:26,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1592 transitions. [2018-12-30 19:41:26,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-30 19:41:26,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:26,227 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:41:26,227 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:26,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:26,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1390965986, now seen corresponding path program 1 times [2018-12-30 19:41:26,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:26,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:26,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:26,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:26,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-30 19:41:26,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:26,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:41:26,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:41:26,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:41:26,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:26,381 INFO L87 Difference]: Start difference. First operand 1445 states and 1592 transitions. Second operand 3 states. [2018-12-30 19:41:27,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:27,011 INFO L93 Difference]: Finished difference Result 3412 states and 3789 transitions. [2018-12-30 19:41:27,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:41:27,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-12-30 19:41:27,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:27,020 INFO L225 Difference]: With dead ends: 3412 [2018-12-30 19:41:27,021 INFO L226 Difference]: Without dead ends: 2100 [2018-12-30 19:41:27,023 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 19:41:27,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2018-12-30 19:41:27,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1707. [2018-12-30 19:41:27,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2018-12-30 19:41:27,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1869 transitions. [2018-12-30 19:41:27,057 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1869 transitions. Word has length 219 [2018-12-30 19:41:27,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:27,058 INFO L480 AbstractCegarLoop]: Abstraction has 1707 states and 1869 transitions. [2018-12-30 19:41:27,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:41:27,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1869 transitions. [2018-12-30 19:41:27,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-12-30 19:41:27,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:27,063 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:41:27,064 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:27,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:27,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1021467306, now seen corresponding path program 1 times [2018-12-30 19:41:27,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:27,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:27,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:27,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:27,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:27,442 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-30 19:41:27,654 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-30 19:41:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-30 19:41:27,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 19:41:27,719 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 19:41:27,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:27,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 19:41:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-12-30 19:41:28,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 19:41:28,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-12-30 19:41:28,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 19:41:28,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 19:41:28,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-30 19:41:28,100 INFO L87 Difference]: Start difference. First operand 1707 states and 1869 transitions. Second operand 7 states. [2018-12-30 19:41:34,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:34,973 INFO L93 Difference]: Finished difference Result 3681 states and 4021 transitions. [2018-12-30 19:41:34,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 19:41:34,974 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 248 [2018-12-30 19:41:34,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:34,975 INFO L225 Difference]: With dead ends: 3681 [2018-12-30 19:41:34,975 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 19:41:34,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 248 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-30 19:41:34,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 19:41:34,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 19:41:34,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 19:41:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 19:41:34,979 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 248 [2018-12-30 19:41:34,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:34,979 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 19:41:34,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 19:41:34,981 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 19:41:34,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 19:41:34,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 19:41:35,763 WARN L181 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-12-30 19:41:35,840 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-12-30 19:41:35,840 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-12-30 19:41:35,840 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,840 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,840 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,840 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,840 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,840 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,840 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-12-30 19:41:35,841 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-12-30 19:41:35,841 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-12-30 19:41:35,841 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-12-30 19:41:35,841 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-12-30 19:41:35,841 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-12-30 19:41:35,841 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-12-30 19:41:35,841 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-12-30 19:41:35,841 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-12-30 19:41:35,841 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-12-30 19:41:35,841 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,841 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,842 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,842 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,842 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,842 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,842 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-12-30 19:41:35,842 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-12-30 19:41:35,842 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-12-30 19:41:35,842 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-12-30 19:41:35,842 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-12-30 19:41:35,842 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-12-30 19:41:35,842 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-12-30 19:41:35,843 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-12-30 19:41:35,843 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-12-30 19:41:35,843 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-12-30 19:41:35,843 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-12-30 19:41:35,843 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-12-30 19:41:35,843 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-12-30 19:41:35,843 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-12-30 19:41:35,843 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-12-30 19:41:35,843 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,844 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,844 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,844 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,844 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,844 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-12-30 19:41:35,844 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-12-30 19:41:35,844 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-12-30 19:41:35,844 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-12-30 19:41:35,844 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-12-30 19:41:35,844 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-12-30 19:41:35,845 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-12-30 19:41:35,845 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-12-30 19:41:35,845 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-12-30 19:41:35,845 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (and (= ~a8~0 15) .cse0) (and (not (= ~a16~0 6)) (= ~a20~0 1) .cse0) (and .cse0 (= ~a16~0 5)) (and (= ~a7~0 1) (<= ~a21~0 0)) (and (= ~a17~0 1) .cse0) (and (= ~a16~0 4) .cse0))) [2018-12-30 19:41:35,845 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,845 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,846 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,846 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,846 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,846 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-12-30 19:41:35,846 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-12-30 19:41:35,846 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-12-30 19:41:35,846 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-12-30 19:41:35,846 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-12-30 19:41:35,846 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-12-30 19:41:35,846 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-12-30 19:41:35,846 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-12-30 19:41:35,847 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-12-30 19:41:35,847 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-12-30 19:41:35,847 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-12-30 19:41:35,847 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-12-30 19:41:35,847 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-12-30 19:41:35,847 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-12-30 19:41:35,847 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,847 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,847 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,847 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,847 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,848 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-12-30 19:41:35,848 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-12-30 19:41:35,848 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-12-30 19:41:35,848 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-12-30 19:41:35,848 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-12-30 19:41:35,848 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-12-30 19:41:35,848 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-12-30 19:41:35,848 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-12-30 19:41:35,848 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-12-30 19:41:35,848 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,848 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,848 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,849 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,849 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-12-30 19:41:35,849 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,849 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-12-30 19:41:35,849 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-12-30 19:41:35,849 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-12-30 19:41:35,849 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-12-30 19:41:35,849 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-12-30 19:41:35,849 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-12-30 19:41:35,849 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-12-30 19:41:35,849 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 19:41:35,850 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-12-30 19:41:35,850 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-12-30 19:41:35,850 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-12-30 19:41:35,850 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-12-30 19:41:35,850 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-12-30 19:41:35,850 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 557) no Hoare annotation was computed. [2018-12-30 19:41:35,850 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-12-30 19:41:35,850 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,851 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (and (= ~a8~0 15) .cse0) (and (not (= ~a16~0 6)) (= ~a20~0 1) .cse0) (and .cse0 (= ~a16~0 5)) (and (= ~a7~0 1) (<= ~a21~0 0)) (and (= ~a17~0 1) .cse0) (and (= ~a16~0 4) .cse0))) [2018-12-30 19:41:35,851 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,851 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,851 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,851 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,851 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-12-30 19:41:35,851 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-12-30 19:41:35,851 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-12-30 19:41:35,851 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-12-30 19:41:35,851 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-12-30 19:41:35,852 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-12-30 19:41:35,852 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-12-30 19:41:35,852 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-12-30 19:41:35,852 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,852 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,852 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,852 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,852 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,852 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-12-30 19:41:35,852 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 19:41:35,852 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-12-30 19:41:35,852 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-12-30 19:41:35,853 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-12-30 19:41:35,853 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-12-30 19:41:35,853 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-12-30 19:41:35,853 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-12-30 19:41:35,853 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-12-30 19:41:35,853 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-12-30 19:41:35,853 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-12-30 19:41:35,853 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-12-30 19:41:35,853 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-12-30 19:41:35,853 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,853 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,854 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,854 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,854 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-12-30 19:41:35,854 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,854 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,854 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-12-30 19:41:35,854 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-12-30 19:41:35,854 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 19:41:35,854 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-12-30 19:41:35,854 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-12-30 19:41:35,854 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-12-30 19:41:35,854 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-12-30 19:41:35,855 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-12-30 19:41:35,855 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-12-30 19:41:35,855 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-12-30 19:41:35,855 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-12-30 19:41:35,855 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-12-30 19:41:35,855 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-12-30 19:41:35,855 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,855 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,855 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,855 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,855 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,856 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-12-30 19:41:35,856 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,856 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-12-30 19:41:35,856 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-12-30 19:41:35,856 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-12-30 19:41:35,856 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-12-30 19:41:35,856 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-12-30 19:41:35,856 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-12-30 19:41:35,856 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-12-30 19:41:35,856 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-12-30 19:41:35,856 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-12-30 19:41:35,856 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-12-30 19:41:35,857 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-12-30 19:41:35,857 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 19:41:35,857 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-12-30 19:41:35,857 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-12-30 19:41:35,857 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-12-30 19:41:35,857 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,857 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,857 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,857 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,857 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,857 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:35,857 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-12-30 19:41:35,858 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-12-30 19:41:35,858 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-12-30 19:41:35,858 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-12-30 19:41:35,858 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-12-30 19:41:35,858 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-12-30 19:41:35,858 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-12-30 19:41:35,858 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-12-30 19:41:35,858 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-12-30 19:41:35,858 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-12-30 19:41:35,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 07:41:35 BoogieIcfgContainer [2018-12-30 19:41:35,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 19:41:35,880 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 19:41:35,880 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 19:41:35,880 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 19:41:35,880 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:41:14" (3/4) ... [2018-12-30 19:41:35,884 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 19:41:35,927 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 19:41:35,928 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 19:41:36,169 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 19:41:36,173 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 19:41:36,174 INFO L168 Benchmark]: Toolchain (without parser) took 26138.07 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 365.4 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -198.7 MB). Peak memory consumption was 166.7 MB. Max. memory is 11.5 GB. [2018-12-30 19:41:36,175 INFO L168 Benchmark]: CDTParser took 0.15 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 19:41:36,175 INFO L168 Benchmark]: CACSL2BoogieTranslator took 731.88 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 920.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-12-30 19:41:36,175 INFO L168 Benchmark]: Boogie Procedure Inliner took 194.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -189.6 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-12-30 19:41:36,176 INFO L168 Benchmark]: Boogie Preprocessor took 87.02 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-30 19:41:36,176 INFO L168 Benchmark]: RCFGBuilder took 3431.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.8 MB in the end (delta: 110.3 MB). Peak memory consumption was 110.3 MB. Max. memory is 11.5 GB. [2018-12-30 19:41:36,177 INFO L168 Benchmark]: TraceAbstraction took 21394.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 241.2 MB). Free memory was 992.8 MB in the beginning and 1.2 GB in the end (delta: -181.5 MB). Peak memory consumption was 59.7 MB. Max. memory is 11.5 GB. [2018-12-30 19:41:36,177 INFO L168 Benchmark]: Witness Printer took 293.50 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2018-12-30 19:41:36,180 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.15 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 731.88 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 920.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 194.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -189.6 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 87.02 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3431.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.8 MB in the end (delta: 110.3 MB). Peak memory consumption was 110.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21394.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 241.2 MB). Free memory was 992.8 MB in the beginning and 1.2 GB in the end (delta: -181.5 MB). Peak memory consumption was 59.7 MB. Max. memory is 11.5 GB. * Witness Printer took 293.50 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 557]: 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: 30]: Loop Invariant Derived loop invariant: (((((a8 == 15 && a21 == 1) || ((!(a16 == 6) && a20 == 1) && a21 == 1)) || (a21 == 1 && a16 == 5)) || (a7 == 1 && a21 <= 0)) || (a17 == 1 && a21 == 1)) || (a16 == 4 && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((a8 == 15 && a21 == 1) || ((!(a16 == 6) && a20 == 1) && a21 == 1)) || (a21 == 1 && a16 == 5)) || (a7 == 1 && a21 <= 0)) || (a17 == 1 && a21 == 1)) || (a16 == 4 && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 21.2s OverallTime, 9 OverallIterations, 6 TraceHistogramMax, 16.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 575 SDtfs, 2023 SDslu, 109 SDs, 0 SdLazy, 5271 SolverSat, 692 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1707occurred in iteration=8, 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.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1053 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 95 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2274 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 85 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1918 NumberOfCodeBlocks, 1918 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1908 ConstructedInterpolants, 0 QuantifiedInterpolants, 755365 SizeOfPredicates, 1 NumberOfNonLiveVariables, 447 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 1401/1428 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...