./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label12_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_label12_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 14ae8eb2d33b1f0bf446cd99369ade126e9422a8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:40:10,187 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 19:40:10,191 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 19:40:10,204 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 19:40:10,205 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 19:40:10,206 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 19:40:10,208 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 19:40:10,210 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 19:40:10,212 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 19:40:10,213 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 19:40:10,214 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 19:40:10,214 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 19:40:10,216 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 19:40:10,217 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 19:40:10,218 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 19:40:10,219 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 19:40:10,220 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 19:40:10,223 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 19:40:10,225 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 19:40:10,227 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 19:40:10,228 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 19:40:10,230 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 19:40:10,233 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 19:40:10,233 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 19:40:10,233 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 19:40:10,234 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 19:40:10,236 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 19:40:10,236 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 19:40:10,237 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 19:40:10,238 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 19:40:10,238 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 19:40:10,239 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 19:40:10,239 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 19:40:10,239 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 19:40:10,241 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 19:40:10,242 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 19:40:10,242 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:40:10,259 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 19:40:10,259 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 19:40:10,261 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 19:40:10,261 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 19:40:10,261 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 19:40:10,262 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 19:40:10,262 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 19:40:10,262 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 19:40:10,262 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 19:40:10,262 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 19:40:10,263 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 19:40:10,263 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 19:40:10,263 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 19:40:10,263 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 19:40:10,263 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 19:40:10,263 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 19:40:10,264 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 19:40:10,266 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 19:40:10,266 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 19:40:10,266 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 19:40:10,266 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 19:40:10,266 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 19:40:10,267 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 19:40:10,268 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 19:40:10,268 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 19:40:10,268 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 19:40:10,268 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 19:40:10,268 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 19:40:10,269 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 -> 14ae8eb2d33b1f0bf446cd99369ade126e9422a8 [2018-12-30 19:40:10,328 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 19:40:10,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 19:40:10,345 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 19:40:10,347 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 19:40:10,347 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 19:40:10,348 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label12_true-unreach-call_false-termination.c [2018-12-30 19:40:10,411 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36dfc3287/dd82eff3296246a399f9047a0de3aa58/FLAG5aa75273d [2018-12-30 19:40:11,002 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 19:40:11,006 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label12_true-unreach-call_false-termination.c [2018-12-30 19:40:11,032 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36dfc3287/dd82eff3296246a399f9047a0de3aa58/FLAG5aa75273d [2018-12-30 19:40:11,253 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36dfc3287/dd82eff3296246a399f9047a0de3aa58 [2018-12-30 19:40:11,257 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 19:40:11,259 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 19:40:11,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 19:40:11,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 19:40:11,264 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 19:40:11,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 07:40:11" (1/1) ... [2018-12-30 19:40:11,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a4cfb67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:11, skipping insertion in model container [2018-12-30 19:40:11,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 07:40:11" (1/1) ... [2018-12-30 19:40:11,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 19:40:11,340 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 19:40:11,770 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 19:40:11,777 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 19:40:11,919 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 19:40:11,946 INFO L195 MainTranslator]: Completed translation [2018-12-30 19:40:11,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:11 WrapperNode [2018-12-30 19:40:11,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 19:40:11,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 19:40:11,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 19:40:11,948 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 19:40:11,956 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:40:11" (1/1) ... [2018-12-30 19:40:12,062 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:40:11" (1/1) ... [2018-12-30 19:40:12,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 19:40:12,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 19:40:12,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 19:40:12,151 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 19:40:12,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:11" (1/1) ... [2018-12-30 19:40:12,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:11" (1/1) ... [2018-12-30 19:40:12,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:11" (1/1) ... [2018-12-30 19:40:12,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:11" (1/1) ... [2018-12-30 19:40:12,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:11" (1/1) ... [2018-12-30 19:40:12,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:11" (1/1) ... [2018-12-30 19:40:12,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:11" (1/1) ... [2018-12-30 19:40:12,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 19:40:12,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 19:40:12,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 19:40:12,231 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 19:40:12,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:11" (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:40:12,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 19:40:12,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 19:40:15,838 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 19:40:15,839 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 19:40:15,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:40:15 BoogieIcfgContainer [2018-12-30 19:40:15,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 19:40:15,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 19:40:15,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 19:40:15,847 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 19:40:15,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 07:40:11" (1/3) ... [2018-12-30 19:40:15,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511d1f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 07:40:15, skipping insertion in model container [2018-12-30 19:40:15,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:11" (2/3) ... [2018-12-30 19:40:15,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511d1f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 07:40:15, skipping insertion in model container [2018-12-30 19:40:15,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:40:15" (3/3) ... [2018-12-30 19:40:15,856 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label12_true-unreach-call_false-termination.c [2018-12-30 19:40:15,870 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 19:40:15,885 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 19:40:15,908 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 19:40:15,957 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 19:40:15,958 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 19:40:15,958 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 19:40:15,959 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 19:40:15,959 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 19:40:15,959 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 19:40:15,960 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 19:40:15,960 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 19:40:15,960 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 19:40:15,988 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2018-12-30 19:40:16,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-30 19:40:16,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:16,004 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] [2018-12-30 19:40:16,007 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:16,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:16,014 INFO L82 PathProgramCache]: Analyzing trace with hash -56899633, now seen corresponding path program 1 times [2018-12-30 19:40:16,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:16,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:16,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:16,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:16,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:16,712 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:40:16,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:16,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:40:16,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:40:16,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:40:16,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:40:16,745 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2018-12-30 19:40:18,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:18,983 INFO L93 Difference]: Finished difference Result 687 states and 1203 transitions. [2018-12-30 19:40:18,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:40:18,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-12-30 19:40:18,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:19,022 INFO L225 Difference]: With dead ends: 687 [2018-12-30 19:40:19,023 INFO L226 Difference]: Without dead ends: 397 [2018-12-30 19:40:19,029 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:40:19,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-12-30 19:40:19,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2018-12-30 19:40:19,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-30 19:40:19,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2018-12-30 19:40:19,130 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 120 [2018-12-30 19:40:19,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:19,133 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2018-12-30 19:40:19,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:40:19,134 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2018-12-30 19:40:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-30 19:40:19,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:19,144 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-12-30 19:40:19,145 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:19,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:19,145 INFO L82 PathProgramCache]: Analyzing trace with hash -2046521246, now seen corresponding path program 1 times [2018-12-30 19:40:19,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:19,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:19,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:19,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:19,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:40:19,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:19,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:40:19,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:40:19,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:40:19,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:40:19,351 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2018-12-30 19:40:20,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:20,886 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2018-12-30 19:40:20,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:40:20,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-12-30 19:40:20,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:20,892 INFO L225 Difference]: With dead ends: 1054 [2018-12-30 19:40:20,892 INFO L226 Difference]: Without dead ends: 790 [2018-12-30 19:40:20,894 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:40:20,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-12-30 19:40:20,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2018-12-30 19:40:20,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2018-12-30 19:40:20,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1068 transitions. [2018-12-30 19:40:20,947 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1068 transitions. Word has length 126 [2018-12-30 19:40:20,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:20,947 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1068 transitions. [2018-12-30 19:40:20,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:40:20,948 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1068 transitions. [2018-12-30 19:40:20,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-30 19:40:20,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:20,955 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-12-30 19:40:20,955 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:20,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:20,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1403860126, now seen corresponding path program 1 times [2018-12-30 19:40:20,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:20,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:20,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:20,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:20,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:21,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:40:21,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:21,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:40:21,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:40:21,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:40:21,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:40:21,176 INFO L87 Difference]: Start difference. First operand 790 states and 1068 transitions. Second operand 4 states. [2018-12-30 19:40:22,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:22,652 INFO L93 Difference]: Finished difference Result 1578 states and 2134 transitions. [2018-12-30 19:40:22,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:40:22,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-12-30 19:40:22,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:22,660 INFO L225 Difference]: With dead ends: 1578 [2018-12-30 19:40:22,661 INFO L226 Difference]: Without dead ends: 790 [2018-12-30 19:40:22,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:40:22,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-12-30 19:40:22,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2018-12-30 19:40:22,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2018-12-30 19:40:22,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 994 transitions. [2018-12-30 19:40:22,691 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 994 transitions. Word has length 127 [2018-12-30 19:40:22,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:22,692 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 994 transitions. [2018-12-30 19:40:22,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:40:22,692 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 994 transitions. [2018-12-30 19:40:22,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-30 19:40:22,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:22,697 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1] [2018-12-30 19:40:22,697 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:22,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:22,698 INFO L82 PathProgramCache]: Analyzing trace with hash -401386139, now seen corresponding path program 1 times [2018-12-30 19:40:22,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:22,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:22,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:22,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:22,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:22,877 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-30 19:40:22,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:22,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:40:22,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:40:22,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:40:22,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:40:22,879 INFO L87 Difference]: Start difference. First operand 790 states and 994 transitions. Second operand 3 states. [2018-12-30 19:40:25,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:25,090 INFO L93 Difference]: Finished difference Result 2102 states and 2630 transitions. [2018-12-30 19:40:25,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:40:25,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-12-30 19:40:25,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:25,104 INFO L225 Difference]: With dead ends: 2102 [2018-12-30 19:40:25,105 INFO L226 Difference]: Without dead ends: 1314 [2018-12-30 19:40:25,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:40:25,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2018-12-30 19:40:25,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2018-12-30 19:40:25,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2018-12-30 19:40:25,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1429 transitions. [2018-12-30 19:40:25,138 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1429 transitions. Word has length 138 [2018-12-30 19:40:25,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:25,139 INFO L480 AbstractCegarLoop]: Abstraction has 1183 states and 1429 transitions. [2018-12-30 19:40:25,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:40:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1429 transitions. [2018-12-30 19:40:25,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-30 19:40:25,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:25,145 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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:40:25,145 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:25,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:25,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1268632313, now seen corresponding path program 1 times [2018-12-30 19:40:25,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:25,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:25,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:25,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:25,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:25,416 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-30 19:40:25,640 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-30 19:40:25,670 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-30 19:40:25,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:25,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:40:25,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:40:25,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:40:25,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:40:25,672 INFO L87 Difference]: Start difference. First operand 1183 states and 1429 transitions. Second operand 4 states. [2018-12-30 19:40:26,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:26,576 INFO L93 Difference]: Finished difference Result 2500 states and 3010 transitions. [2018-12-30 19:40:26,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 19:40:26,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2018-12-30 19:40:26,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:26,582 INFO L225 Difference]: With dead ends: 2500 [2018-12-30 19:40:26,582 INFO L226 Difference]: Without dead ends: 1319 [2018-12-30 19:40:26,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:40:26,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2018-12-30 19:40:26,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1314. [2018-12-30 19:40:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2018-12-30 19:40:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1566 transitions. [2018-12-30 19:40:26,611 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1566 transitions. Word has length 146 [2018-12-30 19:40:26,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:26,612 INFO L480 AbstractCegarLoop]: Abstraction has 1314 states and 1566 transitions. [2018-12-30 19:40:26,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:40:26,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1566 transitions. [2018-12-30 19:40:26,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-30 19:40:26,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:26,616 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-30 19:40:26,616 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:26,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:26,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1203929905, now seen corresponding path program 1 times [2018-12-30 19:40:26,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:26,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:26,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:26,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:26,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:26,942 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-12-30 19:40:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-30 19:40:26,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:26,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:40:26,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 19:40:26,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 19:40:26,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:40:26,965 INFO L87 Difference]: Start difference. First operand 1314 states and 1566 transitions. Second operand 5 states. [2018-12-30 19:40:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:28,073 INFO L93 Difference]: Finished difference Result 2757 states and 3328 transitions. [2018-12-30 19:40:28,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 19:40:28,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2018-12-30 19:40:28,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:28,082 INFO L225 Difference]: With dead ends: 2757 [2018-12-30 19:40:28,082 INFO L226 Difference]: Without dead ends: 1576 [2018-12-30 19:40:28,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:40:28,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2018-12-30 19:40:28,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2018-12-30 19:40:28,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2018-12-30 19:40:28,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1859 transitions. [2018-12-30 19:40:28,123 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1859 transitions. Word has length 150 [2018-12-30 19:40:28,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:28,123 INFO L480 AbstractCegarLoop]: Abstraction has 1576 states and 1859 transitions. [2018-12-30 19:40:28,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 19:40:28,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1859 transitions. [2018-12-30 19:40:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-30 19:40:28,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:28,128 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-12-30 19:40:28,128 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:28,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:28,129 INFO L82 PathProgramCache]: Analyzing trace with hash 290696396, now seen corresponding path program 1 times [2018-12-30 19:40:28,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:28,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:28,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:28,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:28,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:28,246 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-30 19:40:28,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:28,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:40:28,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:40:28,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:40:28,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:40:28,248 INFO L87 Difference]: Start difference. First operand 1576 states and 1859 transitions. Second operand 3 states. [2018-12-30 19:40:29,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:29,164 INFO L93 Difference]: Finished difference Result 3150 states and 3716 transitions. [2018-12-30 19:40:29,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:40:29,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2018-12-30 19:40:29,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:29,179 INFO L225 Difference]: With dead ends: 3150 [2018-12-30 19:40:29,179 INFO L226 Difference]: Without dead ends: 1576 [2018-12-30 19:40:29,182 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:40:29,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2018-12-30 19:40:29,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1314. [2018-12-30 19:40:29,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2018-12-30 19:40:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1419 transitions. [2018-12-30 19:40:29,207 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1419 transitions. Word has length 153 [2018-12-30 19:40:29,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:29,208 INFO L480 AbstractCegarLoop]: Abstraction has 1314 states and 1419 transitions. [2018-12-30 19:40:29,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:40:29,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1419 transitions. [2018-12-30 19:40:29,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-30 19:40:29,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:29,213 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 19:40:29,213 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:29,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:29,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1555225680, now seen corresponding path program 1 times [2018-12-30 19:40:29,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:29,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:29,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:29,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:29,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-30 19:40:29,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:29,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:40:29,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:40:29,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:40:29,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:40:29,398 INFO L87 Difference]: Start difference. First operand 1314 states and 1419 transitions. Second operand 3 states. [2018-12-30 19:40:29,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:29,923 INFO L93 Difference]: Finished difference Result 3281 states and 3559 transitions. [2018-12-30 19:40:29,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:40:29,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2018-12-30 19:40:29,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:29,932 INFO L225 Difference]: With dead ends: 3281 [2018-12-30 19:40:29,932 INFO L226 Difference]: Without dead ends: 2100 [2018-12-30 19:40:29,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:40:29,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2018-12-30 19:40:29,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1838. [2018-12-30 19:40:29,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2018-12-30 19:40:29,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1964 transitions. [2018-12-30 19:40:29,968 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1964 transitions. Word has length 168 [2018-12-30 19:40:29,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:29,968 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 1964 transitions. [2018-12-30 19:40:29,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:40:29,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1964 transitions. [2018-12-30 19:40:29,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-30 19:40:29,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:29,974 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-30 19:40:29,974 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:29,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:29,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1961603004, now seen corresponding path program 1 times [2018-12-30 19:40:29,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:29,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:29,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:29,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:29,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:30,259 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 97 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-30 19:40:30,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 19:40:30,259 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:40:30,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:30,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 19:40:30,578 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-30 19:40:30,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 19:40:30,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-12-30 19:40:30,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 19:40:30,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 19:40:30,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-30 19:40:30,611 INFO L87 Difference]: Start difference. First operand 1838 states and 1964 transitions. Second operand 7 states. [2018-12-30 19:40:33,604 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-12-30 19:40:36,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:36,785 INFO L93 Difference]: Finished difference Result 3811 states and 4081 transitions. [2018-12-30 19:40:36,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 19:40:36,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 197 [2018-12-30 19:40:36,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:36,794 INFO L225 Difference]: With dead ends: 3811 [2018-12-30 19:40:36,795 INFO L226 Difference]: Without dead ends: 1844 [2018-12-30 19:40:36,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-30 19:40:36,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2018-12-30 19:40:36,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1707. [2018-12-30 19:40:36,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2018-12-30 19:40:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1811 transitions. [2018-12-30 19:40:36,835 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1811 transitions. Word has length 197 [2018-12-30 19:40:36,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:36,836 INFO L480 AbstractCegarLoop]: Abstraction has 1707 states and 1811 transitions. [2018-12-30 19:40:36,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 19:40:36,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1811 transitions. [2018-12-30 19:40:36,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-12-30 19:40:36,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:36,844 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:40:36,845 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:36,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:36,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1209478987, now seen corresponding path program 1 times [2018-12-30 19:40:36,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:36,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:36,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:36,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:36,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:37,249 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-12-30 19:40:37,509 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-12-30 19:40:37,942 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-30 19:40:37,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:37,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 19:40:37,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 19:40:37,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 19:40:37,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-30 19:40:37,944 INFO L87 Difference]: Start difference. First operand 1707 states and 1811 transitions. Second operand 6 states. [2018-12-30 19:40:39,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:39,662 INFO L93 Difference]: Finished difference Result 3709 states and 3936 transitions. [2018-12-30 19:40:39,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 19:40:39,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2018-12-30 19:40:39,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:39,670 INFO L225 Difference]: With dead ends: 3709 [2018-12-30 19:40:39,670 INFO L226 Difference]: Without dead ends: 2004 [2018-12-30 19:40:39,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-30 19:40:39,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2018-12-30 19:40:39,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1576. [2018-12-30 19:40:39,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2018-12-30 19:40:39,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1667 transitions. [2018-12-30 19:40:39,705 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1667 transitions. Word has length 240 [2018-12-30 19:40:39,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:39,705 INFO L480 AbstractCegarLoop]: Abstraction has 1576 states and 1667 transitions. [2018-12-30 19:40:39,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 19:40:39,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1667 transitions. [2018-12-30 19:40:39,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-12-30 19:40:39,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:39,712 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-30 19:40:39,712 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:39,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:39,712 INFO L82 PathProgramCache]: Analyzing trace with hash 2069024162, now seen corresponding path program 1 times [2018-12-30 19:40:39,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:39,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:39,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:39,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:39,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-30 19:40:40,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:40,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 19:40:40,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 19:40:40,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 19:40:40,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-30 19:40:40,257 INFO L87 Difference]: Start difference. First operand 1576 states and 1667 transitions. Second operand 6 states. [2018-12-30 19:40:41,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:41,115 INFO L93 Difference]: Finished difference Result 1784 states and 1875 transitions. [2018-12-30 19:40:41,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 19:40:41,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 262 [2018-12-30 19:40:41,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:41,122 INFO L225 Difference]: With dead ends: 1784 [2018-12-30 19:40:41,122 INFO L226 Difference]: Without dead ends: 1576 [2018-12-30 19:40:41,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-30 19:40:41,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2018-12-30 19:40:41,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2018-12-30 19:40:41,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2018-12-30 19:40:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1666 transitions. [2018-12-30 19:40:41,153 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1666 transitions. Word has length 262 [2018-12-30 19:40:41,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:41,154 INFO L480 AbstractCegarLoop]: Abstraction has 1576 states and 1666 transitions. [2018-12-30 19:40:41,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 19:40:41,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1666 transitions. [2018-12-30 19:40:41,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-12-30 19:40:41,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:41,160 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-30 19:40:41,160 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:41,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:41,160 INFO L82 PathProgramCache]: Analyzing trace with hash -527293898, now seen corresponding path program 1 times [2018-12-30 19:40:41,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:41,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:41,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:41,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:41,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:41,669 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-12-30 19:40:41,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:41,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:40:41,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 19:40:41,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 19:40:41,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:40:41,671 INFO L87 Difference]: Start difference. First operand 1576 states and 1666 transitions. Second operand 5 states. [2018-12-30 19:40:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:42,294 INFO L93 Difference]: Finished difference Result 1788 states and 1878 transitions. [2018-12-30 19:40:42,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:40:42,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 265 [2018-12-30 19:40:42,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:42,301 INFO L225 Difference]: With dead ends: 1788 [2018-12-30 19:40:42,301 INFO L226 Difference]: Without dead ends: 1576 [2018-12-30 19:40:42,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:40:42,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2018-12-30 19:40:42,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2018-12-30 19:40:42,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2018-12-30 19:40:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1664 transitions. [2018-12-30 19:40:42,330 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1664 transitions. Word has length 265 [2018-12-30 19:40:42,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:42,331 INFO L480 AbstractCegarLoop]: Abstraction has 1576 states and 1664 transitions. [2018-12-30 19:40:42,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 19:40:42,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1664 transitions. [2018-12-30 19:40:42,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-12-30 19:40:42,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:42,338 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:40:42,338 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:42,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:42,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1228630665, now seen corresponding path program 1 times [2018-12-30 19:40:42,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:42,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:42,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:42,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:42,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:42,648 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-12-30 19:40:42,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:42,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:40:42,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:40:42,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:40:42,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:40:42,650 INFO L87 Difference]: Start difference. First operand 1576 states and 1664 transitions. Second operand 4 states. [2018-12-30 19:40:43,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:43,310 INFO L93 Difference]: Finished difference Result 3279 states and 3471 transitions. [2018-12-30 19:40:43,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:40:43,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2018-12-30 19:40:43,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:43,312 INFO L225 Difference]: With dead ends: 3279 [2018-12-30 19:40:43,312 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 19:40:43,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:40:43,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 19:40:43,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 19:40:43,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 19:40:43,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 19:40:43,316 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 304 [2018-12-30 19:40:43,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:43,316 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 19:40:43,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:40:43,316 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 19:40:43,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 19:40:43,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 19:40:43,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:40:43,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:40:43,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:40:43,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:40:43,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:40:44,104 WARN L181 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2018-12-30 19:40:44,856 WARN L181 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2018-12-30 19:40:44,860 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-12-30 19:40:44,860 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-12-30 19:40:44,860 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,860 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,860 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,860 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,861 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,861 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,861 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-12-30 19:40:44,861 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-12-30 19:40:44,861 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-12-30 19:40:44,861 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-12-30 19:40:44,861 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-12-30 19:40:44,861 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-12-30 19:40:44,861 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-12-30 19:40:44,861 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-12-30 19:40:44,861 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-12-30 19:40:44,861 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-12-30 19:40:44,862 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,862 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,862 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,862 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,862 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,862 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,862 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-12-30 19:40:44,862 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-12-30 19:40:44,862 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-12-30 19:40:44,862 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-12-30 19:40:44,862 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-12-30 19:40:44,863 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-12-30 19:40:44,863 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-12-30 19:40:44,863 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-12-30 19:40:44,863 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-12-30 19:40:44,863 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-12-30 19:40:44,863 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-12-30 19:40:44,863 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-12-30 19:40:44,863 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-12-30 19:40:44,863 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-12-30 19:40:44,863 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-12-30 19:40:44,863 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,864 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,864 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,864 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,864 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,864 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-12-30 19:40:44,864 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-12-30 19:40:44,864 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-12-30 19:40:44,864 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-12-30 19:40:44,864 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-12-30 19:40:44,864 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-12-30 19:40:44,864 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-12-30 19:40:44,865 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-12-30 19:40:44,865 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 536) no Hoare annotation was computed. [2018-12-30 19:40:44,865 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-12-30 19:40:44,866 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a7~0 1))) (let ((.cse1 (<= ~a21~0 0)) (.cse8 (= ~a16~0 5)) (.cse3 (= ~a17~0 1)) (.cse4 (not .cse0)) (.cse2 (= ~a12~0 8)) (.cse7 (<= ~a17~0 0)) (.cse9 (= ~a16~0 6)) (.cse6 (= ~a16~0 4)) (.cse5 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2 .cse3 (= ~a20~0 1) .cse5) (and (and .cse6 .cse3 .cse5) .cse2) (and .cse2 .cse7 .cse5 .cse8) (and .cse6 .cse2 .cse7 .cse5) (and (and .cse1 (and .cse0 (not (= 5 ~a16~0)))) .cse2) (and .cse4 .cse3 .cse2 .cse5 .cse8) (and .cse4 .cse3 .cse2 .cse5 .cse9) (and .cse4 .cse2 .cse7 .cse5 .cse9) (and .cse0 .cse6 .cse5)))) [2018-12-30 19:40:44,866 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,866 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,866 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,866 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,866 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,866 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-12-30 19:40:44,866 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-12-30 19:40:44,866 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-12-30 19:40:44,866 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-12-30 19:40:44,867 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-12-30 19:40:44,867 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-12-30 19:40:44,867 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-12-30 19:40:44,867 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-12-30 19:40:44,867 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-12-30 19:40:44,867 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-12-30 19:40:44,867 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-12-30 19:40:44,867 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-12-30 19:40:44,867 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-12-30 19:40:44,867 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-12-30 19:40:44,867 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,868 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,868 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,868 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,868 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,868 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-12-30 19:40:44,868 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-12-30 19:40:44,868 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-12-30 19:40:44,868 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-12-30 19:40:44,868 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-12-30 19:40:44,868 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-12-30 19:40:44,868 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-12-30 19:40:44,868 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-12-30 19:40:44,868 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-12-30 19:40:44,869 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,869 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,869 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,869 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,869 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-12-30 19:40:44,869 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,869 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-12-30 19:40:44,869 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-12-30 19:40:44,869 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-12-30 19:40:44,869 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-12-30 19:40:44,869 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-12-30 19:40:44,869 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-12-30 19:40:44,870 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-12-30 19:40:44,870 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 19:40:44,870 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-12-30 19:40:44,870 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-12-30 19:40:44,870 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-12-30 19:40:44,870 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-12-30 19:40:44,870 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-12-30 19:40:44,870 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-12-30 19:40:44,870 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,871 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a7~0 1))) (let ((.cse1 (<= ~a21~0 0)) (.cse7 (= ~a16~0 5)) (.cse3 (= ~a17~0 1)) (.cse8 (not .cse0)) (.cse2 (= ~a12~0 8)) (.cse6 (<= ~a17~0 0)) (.cse9 (= ~a16~0 6)) (.cse4 (= ~a16~0 4)) (.cse5 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (and .cse4 .cse3 .cse5) .cse2) (and .cse2 .cse6 .cse5 .cse7) (and .cse2 (and .cse5 (and .cse8 .cse3 (= ~a20~0 1)))) (and .cse4 .cse2 .cse6 .cse5) (and (and .cse1 (and .cse0 (not (= 5 ~a16~0)))) .cse2) (and .cse8 .cse3 .cse2 .cse5 .cse7) (and .cse8 .cse3 .cse2 .cse5 .cse9) (and .cse8 .cse2 .cse6 .cse5 .cse9) (and .cse0 .cse4 .cse5)))) [2018-12-30 19:40:44,871 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,871 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,871 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,871 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,871 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-12-30 19:40:44,871 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-12-30 19:40:44,871 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-12-30 19:40:44,871 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-12-30 19:40:44,871 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-12-30 19:40:44,872 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-12-30 19:40:44,872 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-12-30 19:40:44,872 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-12-30 19:40:44,872 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,872 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,872 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,872 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,872 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,872 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-12-30 19:40:44,872 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 19:40:44,872 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-12-30 19:40:44,873 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-12-30 19:40:44,873 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-12-30 19:40:44,873 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-12-30 19:40:44,873 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-12-30 19:40:44,873 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-12-30 19:40:44,873 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-12-30 19:40:44,873 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-12-30 19:40:44,873 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-12-30 19:40:44,873 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-12-30 19:40:44,873 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-12-30 19:40:44,873 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,873 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,874 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,874 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,874 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-12-30 19:40:44,874 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,874 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,874 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-12-30 19:40:44,874 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-12-30 19:40:44,874 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 19:40:44,874 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-12-30 19:40:44,874 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-12-30 19:40:44,874 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-12-30 19:40:44,875 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-12-30 19:40:44,875 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-12-30 19:40:44,875 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-12-30 19:40:44,875 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-12-30 19:40:44,875 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-12-30 19:40:44,875 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-12-30 19:40:44,875 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-12-30 19:40:44,875 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,875 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,875 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,875 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,875 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,876 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-12-30 19:40:44,876 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,876 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-12-30 19:40:44,876 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-12-30 19:40:44,876 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-12-30 19:40:44,876 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-12-30 19:40:44,876 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-12-30 19:40:44,876 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-12-30 19:40:44,876 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-12-30 19:40:44,876 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-12-30 19:40:44,876 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-12-30 19:40:44,877 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-12-30 19:40:44,877 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-12-30 19:40:44,877 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 19:40:44,877 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-12-30 19:40:44,877 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-12-30 19:40:44,877 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-12-30 19:40:44,877 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,877 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,877 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,877 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,877 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,878 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:44,878 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-12-30 19:40:44,878 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-12-30 19:40:44,878 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-12-30 19:40:44,878 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-12-30 19:40:44,878 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-12-30 19:40:44,878 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-12-30 19:40:44,878 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-12-30 19:40:44,878 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-12-30 19:40:44,878 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-12-30 19:40:44,878 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-12-30 19:40:44,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 07:40:44 BoogieIcfgContainer [2018-12-30 19:40:44,925 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 19:40:44,929 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 19:40:44,929 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 19:40:44,929 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 19:40:44,930 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:40:15" (3/4) ... [2018-12-30 19:40:44,936 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 19:40:44,961 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 19:40:44,963 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 19:40:45,215 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 19:40:45,220 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 19:40:45,221 INFO L168 Benchmark]: Toolchain (without parser) took 33963.63 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 456.1 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -280.2 MB). Peak memory consumption was 175.9 MB. Max. memory is 11.5 GB. [2018-12-30 19:40:45,223 INFO L168 Benchmark]: CDTParser took 0.17 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:40:45,223 INFO L168 Benchmark]: CACSL2BoogieTranslator took 687.21 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 913.6 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-12-30 19:40:45,223 INFO L168 Benchmark]: Boogie Procedure Inliner took 202.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 913.6 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-12-30 19:40:45,224 INFO L168 Benchmark]: Boogie Preprocessor took 79.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-30 19:40:45,224 INFO L168 Benchmark]: RCFGBuilder took 3611.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.1 MB in the end (delta: 107.2 MB). Peak memory consumption was 107.2 MB. Max. memory is 11.5 GB. [2018-12-30 19:40:45,224 INFO L168 Benchmark]: TraceAbstraction took 29082.27 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 340.3 MB). Free memory was 988.1 MB in the beginning and 1.3 GB in the end (delta: -264.4 MB). Peak memory consumption was 75.8 MB. Max. memory is 11.5 GB. [2018-12-30 19:40:45,228 INFO L168 Benchmark]: Witness Printer took 291.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2018-12-30 19:40:45,231 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.17 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 687.21 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 913.6 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 202.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 913.6 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 79.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3611.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.1 MB in the end (delta: 107.2 MB). Peak memory consumption was 107.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29082.27 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 340.3 MB). Free memory was 988.1 MB in the beginning and 1.3 GB in the end (delta: -264.4 MB). Peak memory consumption was 75.8 MB. Max. memory is 11.5 GB. * Witness Printer took 291.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 536]: 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: (((((((((((a7 == 1 && a21 <= 0) && a12 == 8) && a17 == 1) || ((((!(a7 == 1) && a12 == 8) && a17 == 1) && a20 == 1) && a21 == 1)) || (((a16 == 4 && a17 == 1) && a21 == 1) && a12 == 8)) || (((a12 == 8 && a17 <= 0) && a21 == 1) && a16 == 5)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || ((a21 <= 0 && a7 == 1 && !(5 == a16)) && a12 == 8)) || ((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 5)) || ((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 6)) || ((((!(a7 == 1) && a12 == 8) && a17 <= 0) && a21 == 1) && a16 == 6)) || ((a7 == 1 && a16 == 4) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((a7 == 1 && a21 <= 0) && a12 == 8) && a17 == 1) || (((a16 == 4 && a17 == 1) && a21 == 1) && a12 == 8)) || (((a12 == 8 && a17 <= 0) && a21 == 1) && a16 == 5)) || (a12 == 8 && a21 == 1 && (!(a7 == 1) && a17 == 1) && a20 == 1)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || ((a21 <= 0 && a7 == 1 && !(5 == a16)) && a12 == 8)) || ((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 5)) || ((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 6)) || ((((!(a7 == 1) && a12 == 8) && a17 <= 0) && a21 == 1) && a16 == 6)) || ((a7 == 1 && a16 == 4) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 28.9s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 21.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1021 SDtfs, 2974 SDslu, 163 SDs, 0 SdLazy, 7951 SolverSat, 934 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 256 GetRequests, 214 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred 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.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 1356 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 40 NumberOfFragments, 299 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2913 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 955 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 2593 NumberOfCodeBlocks, 2593 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2579 ConstructedInterpolants, 0 QuantifiedInterpolants, 2116088 SizeOfPredicates, 1 NumberOfNonLiveVariables, 341 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 1623/1650 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...