./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem14_label55_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/Problem14_label55_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 d7ee2ac819f7b75cfc0560bac3b8eea31e76c5dc .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 23:19:26,134 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 23:19:26,136 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 23:19:26,156 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 23:19:26,156 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 23:19:26,157 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 23:19:26,158 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 23:19:26,160 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 23:19:26,162 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 23:19:26,163 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 23:19:26,164 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 23:19:26,169 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 23:19:26,170 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 23:19:26,171 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 23:19:26,174 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 23:19:26,175 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 23:19:26,176 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 23:19:26,177 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 23:19:26,179 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 23:19:26,181 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 23:19:26,182 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 23:19:26,183 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 23:19:26,185 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 23:19:26,185 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 23:19:26,185 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 23:19:26,186 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 23:19:26,188 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 23:19:26,189 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 23:19:26,190 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 23:19:26,191 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 23:19:26,191 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 23:19:26,192 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 23:19:26,192 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 23:19:26,192 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 23:19:26,194 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 23:19:26,195 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 23:19:26,197 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 23:19:26,225 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 23:19:26,225 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 23:19:26,227 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 23:19:26,227 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 23:19:26,227 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 23:19:26,227 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 23:19:26,227 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 23:19:26,228 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 23:19:26,228 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 23:19:26,228 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 23:19:26,228 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 23:19:26,228 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 23:19:26,228 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 23:19:26,228 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 23:19:26,230 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 23:19:26,230 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 23:19:26,230 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 23:19:26,230 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 23:19:26,231 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 23:19:26,231 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 23:19:26,231 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 23:19:26,231 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 23:19:26,231 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 23:19:26,232 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 23:19:26,233 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 23:19:26,233 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 23:19:26,233 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 23:19:26,233 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 23:19:26,233 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 -> d7ee2ac819f7b75cfc0560bac3b8eea31e76c5dc [2018-12-30 23:19:26,271 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 23:19:26,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 23:19:26,287 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 23:19:26,289 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 23:19:26,289 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 23:19:26,290 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem14_label55_true-unreach-call_false-termination.c [2018-12-30 23:19:26,350 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70bc48076/a2c291b64a6b4a9d8d8b7f8e23b90aa3/FLAG07eaed1be [2018-12-30 23:19:26,906 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 23:19:26,907 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem14_label55_true-unreach-call_false-termination.c [2018-12-30 23:19:26,933 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70bc48076/a2c291b64a6b4a9d8d8b7f8e23b90aa3/FLAG07eaed1be [2018-12-30 23:19:27,137 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70bc48076/a2c291b64a6b4a9d8d8b7f8e23b90aa3 [2018-12-30 23:19:27,142 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 23:19:27,143 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 23:19:27,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 23:19:27,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 23:19:27,148 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 23:19:27,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 11:19:27" (1/1) ... [2018-12-30 23:19:27,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fe59425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:27, skipping insertion in model container [2018-12-30 23:19:27,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 11:19:27" (1/1) ... [2018-12-30 23:19:27,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 23:19:27,235 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 23:19:27,802 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 23:19:27,811 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 23:19:27,996 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 23:19:28,017 INFO L195 MainTranslator]: Completed translation [2018-12-30 23:19:28,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:28 WrapperNode [2018-12-30 23:19:28,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 23:19:28,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 23:19:28,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 23:19:28,019 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 23:19:28,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:28" (1/1) ... [2018-12-30 23:19:28,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:28" (1/1) ... [2018-12-30 23:19:28,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 23:19:28,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 23:19:28,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 23:19:28,237 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 23:19:28,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:28" (1/1) ... [2018-12-30 23:19:28,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:28" (1/1) ... [2018-12-30 23:19:28,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:28" (1/1) ... [2018-12-30 23:19:28,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:28" (1/1) ... [2018-12-30 23:19:28,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:28" (1/1) ... [2018-12-30 23:19:28,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:28" (1/1) ... [2018-12-30 23:19:28,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:28" (1/1) ... [2018-12-30 23:19:28,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 23:19:28,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 23:19:28,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 23:19:28,367 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 23:19:28,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:28" (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 23:19:28,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 23:19:28,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 23:19:32,277 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 23:19:32,277 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 23:19:32,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:19:32 BoogieIcfgContainer [2018-12-30 23:19:32,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 23:19:32,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 23:19:32,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 23:19:32,282 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 23:19:32,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 11:19:27" (1/3) ... [2018-12-30 23:19:32,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3daa42ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 11:19:32, skipping insertion in model container [2018-12-30 23:19:32,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:28" (2/3) ... [2018-12-30 23:19:32,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3daa42ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 11:19:32, skipping insertion in model container [2018-12-30 23:19:32,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:19:32" (3/3) ... [2018-12-30 23:19:32,286 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label55_true-unreach-call_false-termination.c [2018-12-30 23:19:32,297 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 23:19:32,305 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 23:19:32,324 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 23:19:32,360 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 23:19:32,361 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 23:19:32,361 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 23:19:32,361 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 23:19:32,362 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 23:19:32,362 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 23:19:32,362 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 23:19:32,362 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 23:19:32,362 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 23:19:32,388 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2018-12-30 23:19:32,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-30 23:19:32,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:32,399 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] [2018-12-30 23:19:32,402 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:32,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:32,407 INFO L82 PathProgramCache]: Analyzing trace with hash -66916295, now seen corresponding path program 1 times [2018-12-30 23:19:32,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:32,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:32,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:32,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:32,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:32,988 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 23:19:32,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:32,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:19:32,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 23:19:33,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 23:19:33,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-30 23:19:33,016 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 6 states. [2018-12-30 23:19:37,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:37,120 INFO L93 Difference]: Finished difference Result 852 states and 1560 transitions. [2018-12-30 23:19:37,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:19:37,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-12-30 23:19:37,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:37,145 INFO L225 Difference]: With dead ends: 852 [2018-12-30 23:19:37,145 INFO L226 Difference]: Without dead ends: 538 [2018-12-30 23:19:37,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:19:37,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-12-30 23:19:37,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2018-12-30 23:19:37,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-12-30 23:19:37,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 778 transitions. [2018-12-30 23:19:37,254 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 778 transitions. Word has length 57 [2018-12-30 23:19:37,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:37,255 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 778 transitions. [2018-12-30 23:19:37,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 23:19:37,255 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 778 transitions. [2018-12-30 23:19:37,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-12-30 23:19:37,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:37,266 INFO L402 BasicCegarLoop]: trace histogram [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, 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] [2018-12-30 23:19:37,266 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:37,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:37,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1784234753, now seen corresponding path program 1 times [2018-12-30 23:19:37,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:37,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:37,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:37,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:37,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:37,483 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-30 23:19:37,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:37,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:19:37,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:19:37,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:19:37,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:19:37,489 INFO L87 Difference]: Start difference. First operand 538 states and 778 transitions. Second operand 4 states. [2018-12-30 23:19:39,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:39,600 INFO L93 Difference]: Finished difference Result 1252 states and 1948 transitions. [2018-12-30 23:19:39,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:19:39,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2018-12-30 23:19:39,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:39,608 INFO L225 Difference]: With dead ends: 1252 [2018-12-30 23:19:39,608 INFO L226 Difference]: Without dead ends: 894 [2018-12-30 23:19:39,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 23:19:39,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2018-12-30 23:19:39,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2018-12-30 23:19:39,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2018-12-30 23:19:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1206 transitions. [2018-12-30 23:19:39,650 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1206 transitions. Word has length 205 [2018-12-30 23:19:39,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:39,651 INFO L480 AbstractCegarLoop]: Abstraction has 894 states and 1206 transitions. [2018-12-30 23:19:39,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:19:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1206 transitions. [2018-12-30 23:19:39,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-12-30 23:19:39,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:39,659 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 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] [2018-12-30 23:19:39,659 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:39,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:39,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1832078, now seen corresponding path program 1 times [2018-12-30 23:19:39,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:39,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:39,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:39,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:39,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:40,050 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 158 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 23:19:40,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:19:40,051 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 23:19:40,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:40,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:19:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-12-30 23:19:40,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:19:40,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-12-30 23:19:40,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 23:19:40,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 23:19:40,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-30 23:19:40,329 INFO L87 Difference]: Start difference. First operand 894 states and 1206 transitions. Second operand 6 states. [2018-12-30 23:19:45,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:45,856 INFO L93 Difference]: Finished difference Result 3446 states and 4804 transitions. [2018-12-30 23:19:45,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 23:19:45,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 228 [2018-12-30 23:19:45,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:45,875 INFO L225 Difference]: With dead ends: 3446 [2018-12-30 23:19:45,876 INFO L226 Difference]: Without dead ends: 2674 [2018-12-30 23:19:45,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:19:45,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2018-12-30 23:19:45,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 1962. [2018-12-30 23:19:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2018-12-30 23:19:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2132 transitions. [2018-12-30 23:19:45,933 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2132 transitions. Word has length 228 [2018-12-30 23:19:45,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:45,933 INFO L480 AbstractCegarLoop]: Abstraction has 1962 states and 2132 transitions. [2018-12-30 23:19:45,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 23:19:45,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2132 transitions. [2018-12-30 23:19:45,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2018-12-30 23:19:45,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:45,949 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-30 23:19:45,950 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:45,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:45,951 INFO L82 PathProgramCache]: Analyzing trace with hash 304952916, now seen corresponding path program 1 times [2018-12-30 23:19:45,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:45,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:45,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:45,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:45,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:46,886 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-30 23:19:47,208 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2018-12-30 23:19:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 619 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-12-30 23:19:47,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:47,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-30 23:19:47,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:19:47,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:19:47,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:19:47,669 INFO L87 Difference]: Start difference. First operand 1962 states and 2132 transitions. Second operand 8 states. [2018-12-30 23:19:49,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:49,888 INFO L93 Difference]: Finished difference Result 4112 states and 4472 transitions. [2018-12-30 23:19:49,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 23:19:49,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 525 [2018-12-30 23:19:49,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:49,905 INFO L225 Difference]: With dead ends: 4112 [2018-12-30 23:19:49,905 INFO L226 Difference]: Without dead ends: 2330 [2018-12-30 23:19:49,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:19:49,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2018-12-30 23:19:49,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2140. [2018-12-30 23:19:49,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2018-12-30 23:19:49,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2314 transitions. [2018-12-30 23:19:49,960 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2314 transitions. Word has length 525 [2018-12-30 23:19:49,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:49,961 INFO L480 AbstractCegarLoop]: Abstraction has 2140 states and 2314 transitions. [2018-12-30 23:19:49,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:19:49,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2314 transitions. [2018-12-30 23:19:49,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2018-12-30 23:19:49,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:49,977 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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] [2018-12-30 23:19:49,977 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:49,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:49,978 INFO L82 PathProgramCache]: Analyzing trace with hash -851417576, now seen corresponding path program 1 times [2018-12-30 23:19:49,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:49,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:49,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:49,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:49,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:50,335 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-30 23:19:50,695 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-12-30 23:19:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 607 proven. 4 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-12-30 23:19:51,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:19:51,198 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:19:51,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:51,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:19:51,663 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 47 proven. 172 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2018-12-30 23:19:51,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:19:51,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-12-30 23:19:51,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 23:19:51,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 23:19:51,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:19:51,699 INFO L87 Difference]: Start difference. First operand 2140 states and 2314 transitions. Second operand 9 states. [2018-12-30 23:19:54,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:54,965 INFO L93 Difference]: Finished difference Result 5720 states and 6242 transitions. [2018-12-30 23:19:54,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-30 23:19:54,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 549 [2018-12-30 23:19:54,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:54,982 INFO L225 Difference]: With dead ends: 5720 [2018-12-30 23:19:54,982 INFO L226 Difference]: Without dead ends: 3570 [2018-12-30 23:19:54,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2018-12-30 23:19:54,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3570 states. [2018-12-30 23:19:55,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3570 to 2674. [2018-12-30 23:19:55,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2018-12-30 23:19:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2894 transitions. [2018-12-30 23:19:55,041 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2894 transitions. Word has length 549 [2018-12-30 23:19:55,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:55,041 INFO L480 AbstractCegarLoop]: Abstraction has 2674 states and 2894 transitions. [2018-12-30 23:19:55,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 23:19:55,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2894 transitions. [2018-12-30 23:19:55,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2018-12-30 23:19:55,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:55,050 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 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] [2018-12-30 23:19:55,050 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:55,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:55,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1692680079, now seen corresponding path program 1 times [2018-12-30 23:19:55,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:55,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:55,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:55,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:55,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:55,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1359 backedges. 677 proven. 0 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2018-12-30 23:19:55,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:55,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:19:55,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:19:55,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:19:55,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:19:55,710 INFO L87 Difference]: Start difference. First operand 2674 states and 2894 transitions. Second operand 4 states. [2018-12-30 23:19:57,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:57,328 INFO L93 Difference]: Finished difference Result 6770 states and 7471 transitions. [2018-12-30 23:19:57,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:19:57,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 702 [2018-12-30 23:19:57,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:57,348 INFO L225 Difference]: With dead ends: 6770 [2018-12-30 23:19:57,348 INFO L226 Difference]: Without dead ends: 4276 [2018-12-30 23:19:57,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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 23:19:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2018-12-30 23:19:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4098. [2018-12-30 23:19:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2018-12-30 23:19:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4453 transitions. [2018-12-30 23:19:57,434 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4453 transitions. Word has length 702 [2018-12-30 23:19:57,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:57,435 INFO L480 AbstractCegarLoop]: Abstraction has 4098 states and 4453 transitions. [2018-12-30 23:19:57,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:19:57,435 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4453 transitions. [2018-12-30 23:19:57,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2018-12-30 23:19:57,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:57,448 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:57,448 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:57,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:57,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1176981808, now seen corresponding path program 1 times [2018-12-30 23:19:57,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:57,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:57,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:57,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:57,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:58,223 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-12-30 23:19:58,668 WARN L181 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2018-12-30 23:19:58,936 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-30 23:19:59,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 1092 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2018-12-30 23:19:59,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:59,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 23:19:59,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 23:19:59,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 23:19:59,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:19:59,393 INFO L87 Difference]: Start difference. First operand 4098 states and 4453 transitions. Second operand 7 states. [2018-12-30 23:20:00,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:00,269 INFO L93 Difference]: Finished difference Result 8294 states and 9013 transitions. [2018-12-30 23:20:00,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 23:20:00,270 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 710 [2018-12-30 23:20:00,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:00,288 INFO L225 Difference]: With dead ends: 8294 [2018-12-30 23:20:00,288 INFO L226 Difference]: Without dead ends: 4276 [2018-12-30 23:20:00,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:20:00,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2018-12-30 23:20:00,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4098. [2018-12-30 23:20:00,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2018-12-30 23:20:00,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4384 transitions. [2018-12-30 23:20:00,364 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4384 transitions. Word has length 710 [2018-12-30 23:20:00,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:00,365 INFO L480 AbstractCegarLoop]: Abstraction has 4098 states and 4384 transitions. [2018-12-30 23:20:00,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 23:20:00,366 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4384 transitions. [2018-12-30 23:20:00,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 784 [2018-12-30 23:20:00,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:00,377 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 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] [2018-12-30 23:20:00,377 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:00,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:00,378 INFO L82 PathProgramCache]: Analyzing trace with hash -571030026, now seen corresponding path program 1 times [2018-12-30 23:20:00,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:00,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:00,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:00,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:00,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:01,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 828 proven. 0 refuted. 0 times theorem prover too weak. 981 trivial. 0 not checked. [2018-12-30 23:20:01,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:20:01,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:20:01,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:20:01,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:20:01,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:20:01,202 INFO L87 Difference]: Start difference. First operand 4098 states and 4384 transitions. Second operand 3 states. [2018-12-30 23:20:02,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:02,365 INFO L93 Difference]: Finished difference Result 9262 states and 9895 transitions. [2018-12-30 23:20:02,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:20:02,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 783 [2018-12-30 23:20:02,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:02,385 INFO L225 Difference]: With dead ends: 9262 [2018-12-30 23:20:02,386 INFO L226 Difference]: Without dead ends: 5344 [2018-12-30 23:20:02,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 23:20:02,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2018-12-30 23:20:02,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 5344. [2018-12-30 23:20:02,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2018-12-30 23:20:02,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5628 transitions. [2018-12-30 23:20:02,487 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5628 transitions. Word has length 783 [2018-12-30 23:20:02,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:02,488 INFO L480 AbstractCegarLoop]: Abstraction has 5344 states and 5628 transitions. [2018-12-30 23:20:02,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:20:02,488 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5628 transitions. [2018-12-30 23:20:02,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2018-12-30 23:20:02,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:02,501 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 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] [2018-12-30 23:20:02,501 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:02,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:02,502 INFO L82 PathProgramCache]: Analyzing trace with hash -456135798, now seen corresponding path program 1 times [2018-12-30 23:20:02,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:02,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:02,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:02,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:02,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:03,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1825 backedges. 1152 proven. 174 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2018-12-30 23:20:03,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:20:03,814 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:20:03,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:03,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:20:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1825 backedges. 1297 proven. 29 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2018-12-30 23:20:05,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:20:05,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2018-12-30 23:20:05,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:20:05,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:20:05,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:20:05,143 INFO L87 Difference]: Start difference. First operand 5344 states and 5628 transitions. Second operand 8 states. [2018-12-30 23:20:05,333 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-12-30 23:20:07,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:07,218 INFO L93 Difference]: Finished difference Result 11674 states and 12269 transitions. [2018-12-30 23:20:07,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 23:20:07,219 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 791 [2018-12-30 23:20:07,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:07,261 INFO L225 Difference]: With dead ends: 11674 [2018-12-30 23:20:07,265 INFO L226 Difference]: Without dead ends: 6510 [2018-12-30 23:20:07,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 790 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-30 23:20:07,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2018-12-30 23:20:07,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 5344. [2018-12-30 23:20:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2018-12-30 23:20:07,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5627 transitions. [2018-12-30 23:20:07,393 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5627 transitions. Word has length 791 [2018-12-30 23:20:07,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:07,395 INFO L480 AbstractCegarLoop]: Abstraction has 5344 states and 5627 transitions. [2018-12-30 23:20:07,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:20:07,395 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5627 transitions. [2018-12-30 23:20:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 819 [2018-12-30 23:20:07,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:07,411 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:20:07,412 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:07,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:07,412 INFO L82 PathProgramCache]: Analyzing trace with hash -68677484, now seen corresponding path program 1 times [2018-12-30 23:20:07,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:07,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:07,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:07,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:07,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:07,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2264 backedges. 1520 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-12-30 23:20:07,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:20:07,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:20:07,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:20:07,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:20:07,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:20:07,905 INFO L87 Difference]: Start difference. First operand 5344 states and 5627 transitions. Second operand 3 states. [2018-12-30 23:20:08,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:08,469 INFO L93 Difference]: Finished difference Result 10508 states and 11073 transitions. [2018-12-30 23:20:08,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:20:08,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 818 [2018-12-30 23:20:08,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:08,482 INFO L225 Difference]: With dead ends: 10508 [2018-12-30 23:20:08,482 INFO L226 Difference]: Without dead ends: 5344 [2018-12-30 23:20:08,487 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 23:20:08,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2018-12-30 23:20:08,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 5344. [2018-12-30 23:20:08,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2018-12-30 23:20:08,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5596 transitions. [2018-12-30 23:20:08,564 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5596 transitions. Word has length 818 [2018-12-30 23:20:08,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:08,564 INFO L480 AbstractCegarLoop]: Abstraction has 5344 states and 5596 transitions. [2018-12-30 23:20:08,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:20:08,565 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5596 transitions. [2018-12-30 23:20:08,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 992 [2018-12-30 23:20:08,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:08,579 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:20:08,579 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:08,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:08,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1843390325, now seen corresponding path program 1 times [2018-12-30 23:20:08,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:08,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:08,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:08,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:08,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:09,105 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-30 23:20:09,277 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-30 23:20:09,512 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-30 23:20:09,736 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-30 23:20:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3077 backedges. 2062 proven. 199 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2018-12-30 23:20:11,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:20:11,285 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:20:11,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:11,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:20:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3077 backedges. 1969 proven. 93 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2018-12-30 23:20:12,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:20:12,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2018-12-30 23:20:12,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:20:12,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:20:12,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:20:12,894 INFO L87 Difference]: Start difference. First operand 5344 states and 5596 transitions. Second operand 8 states. [2018-12-30 23:20:15,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:15,327 INFO L93 Difference]: Finished difference Result 11479 states and 12000 transitions. [2018-12-30 23:20:15,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 23:20:15,327 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 991 [2018-12-30 23:20:15,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:15,340 INFO L225 Difference]: With dead ends: 11479 [2018-12-30 23:20:15,340 INFO L226 Difference]: Without dead ends: 6315 [2018-12-30 23:20:15,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 998 GetRequests, 990 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-12-30 23:20:15,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6315 states. [2018-12-30 23:20:15,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6315 to 5522. [2018-12-30 23:20:15,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5522 states. [2018-12-30 23:20:15,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 5776 transitions. [2018-12-30 23:20:15,433 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 5776 transitions. Word has length 991 [2018-12-30 23:20:15,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:15,434 INFO L480 AbstractCegarLoop]: Abstraction has 5522 states and 5776 transitions. [2018-12-30 23:20:15,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:20:15,434 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 5776 transitions. [2018-12-30 23:20:15,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1069 [2018-12-30 23:20:15,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:15,448 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2018-12-30 23:20:15,448 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:15,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:15,448 INFO L82 PathProgramCache]: Analyzing trace with hash 2022978308, now seen corresponding path program 1 times [2018-12-30 23:20:15,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:15,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:15,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:15,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:15,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:16,127 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-12-30 23:20:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3740 backedges. 1271 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2018-12-30 23:20:17,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:20:17,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:20:17,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:20:17,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:20:17,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:20:17,065 INFO L87 Difference]: Start difference. First operand 5522 states and 5776 transitions. Second operand 4 states. [2018-12-30 23:20:18,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:18,726 INFO L93 Difference]: Finished difference Result 11042 states and 11552 transitions. [2018-12-30 23:20:18,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:20:18,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1068 [2018-12-30 23:20:18,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:18,738 INFO L225 Difference]: With dead ends: 11042 [2018-12-30 23:20:18,738 INFO L226 Difference]: Without dead ends: 5344 [2018-12-30 23:20:18,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:20:18,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2018-12-30 23:20:18,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 4988. [2018-12-30 23:20:18,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2018-12-30 23:20:18,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5138 transitions. [2018-12-30 23:20:18,824 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5138 transitions. Word has length 1068 [2018-12-30 23:20:18,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:18,825 INFO L480 AbstractCegarLoop]: Abstraction has 4988 states and 5138 transitions. [2018-12-30 23:20:18,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:20:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5138 transitions. [2018-12-30 23:20:18,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1117 [2018-12-30 23:20:18,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:18,843 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 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] [2018-12-30 23:20:18,843 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:18,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:18,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1857606004, now seen corresponding path program 1 times [2018-12-30 23:20:18,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:18,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:18,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:18,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:18,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3977 backedges. 2619 proven. 0 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2018-12-30 23:20:20,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:20:20,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:20:20,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:20:20,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:20:20,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:20:20,251 INFO L87 Difference]: Start difference. First operand 4988 states and 5138 transitions. Second operand 5 states. [2018-12-30 23:20:21,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:21,714 INFO L93 Difference]: Finished difference Result 10864 states and 11192 transitions. [2018-12-30 23:20:21,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:20:21,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1116 [2018-12-30 23:20:21,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:21,725 INFO L225 Difference]: With dead ends: 10864 [2018-12-30 23:20:21,725 INFO L226 Difference]: Without dead ends: 6056 [2018-12-30 23:20:21,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 23:20:21,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2018-12-30 23:20:21,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 5344. [2018-12-30 23:20:21,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2018-12-30 23:20:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5497 transitions. [2018-12-30 23:20:21,812 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5497 transitions. Word has length 1116 [2018-12-30 23:20:21,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:21,813 INFO L480 AbstractCegarLoop]: Abstraction has 5344 states and 5497 transitions. [2018-12-30 23:20:21,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:20:21,814 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5497 transitions. [2018-12-30 23:20:21,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1654 [2018-12-30 23:20:21,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:21,844 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:20:21,844 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:21,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:21,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1570608280, now seen corresponding path program 1 times [2018-12-30 23:20:21,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:21,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:21,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:21,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:21,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:24,673 INFO L134 CoverageAnalysis]: Checked inductivity of 8760 backedges. 3686 proven. 498 refuted. 0 times theorem prover too weak. 4576 trivial. 0 not checked. [2018-12-30 23:20:24,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:20:24,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:20:24,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:25,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:20:25,647 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 26 [2018-12-30 23:20:27,944 INFO L134 CoverageAnalysis]: Checked inductivity of 8760 backedges. 3834 proven. 350 refuted. 0 times theorem prover too weak. 4576 trivial. 0 not checked. [2018-12-30 23:20:27,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:20:27,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-12-30 23:20:27,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-30 23:20:27,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-30 23:20:27,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-12-30 23:20:27,967 INFO L87 Difference]: Start difference. First operand 5344 states and 5497 transitions. Second operand 12 states. [2018-12-30 23:20:35,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:35,109 INFO L93 Difference]: Finished difference Result 11593 states and 11930 transitions. [2018-12-30 23:20:35,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-30 23:20:35,111 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1653 [2018-12-30 23:20:35,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:35,125 INFO L225 Difference]: With dead ends: 11593 [2018-12-30 23:20:35,125 INFO L226 Difference]: Without dead ends: 6412 [2018-12-30 23:20:35,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1673 GetRequests, 1656 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-12-30 23:20:35,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2018-12-30 23:20:35,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 5166. [2018-12-30 23:20:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2018-12-30 23:20:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5310 transitions. [2018-12-30 23:20:35,222 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5310 transitions. Word has length 1653 [2018-12-30 23:20:35,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:35,224 INFO L480 AbstractCegarLoop]: Abstraction has 5166 states and 5310 transitions. [2018-12-30 23:20:35,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-30 23:20:35,225 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5310 transitions. [2018-12-30 23:20:35,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1827 [2018-12-30 23:20:35,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:35,329 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 9, 9, 9, 9, 9, 9, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:20:35,331 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:35,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:35,332 INFO L82 PathProgramCache]: Analyzing trace with hash 118949285, now seen corresponding path program 1 times [2018-12-30 23:20:35,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:35,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:35,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:35,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:35,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:36,119 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-12-30 23:20:37,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10389 backedges. 4587 proven. 0 refuted. 0 times theorem prover too weak. 5802 trivial. 0 not checked. [2018-12-30 23:20:37,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:20:37,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:20:37,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:20:37,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:20:37,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:20:37,688 INFO L87 Difference]: Start difference. First operand 5166 states and 5310 transitions. Second operand 4 states. [2018-12-30 23:20:38,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:38,670 INFO L93 Difference]: Finished difference Result 10684 states and 10936 transitions. [2018-12-30 23:20:38,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:20:38,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1826 [2018-12-30 23:20:38,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:38,673 INFO L225 Difference]: With dead ends: 10684 [2018-12-30 23:20:38,673 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 23:20:38,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:20:38,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 23:20:38,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 23:20:38,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 23:20:38,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 23:20:38,681 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1826 [2018-12-30 23:20:38,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:38,682 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 23:20:38,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:20:38,682 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 23:20:38,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 23:20:38,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 23:20:39,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:39,120 WARN L181 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 358 DAG size of output: 254 [2018-12-30 23:20:39,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:39,525 WARN L181 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 358 DAG size of output: 254 [2018-12-30 23:20:41,698 WARN L181 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 241 DAG size of output: 102 [2018-12-30 23:20:43,417 WARN L181 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 241 DAG size of output: 102 [2018-12-30 23:20:43,421 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-12-30 23:20:43,421 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-12-30 23:20:43,421 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,421 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,421 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,421 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-12-30 23:20:43,422 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-12-30 23:20:43,422 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-12-30 23:20:43,422 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-12-30 23:20:43,422 INFO L448 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-12-30 23:20:43,422 INFO L448 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-12-30 23:20:43,422 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-12-30 23:20:43,422 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-12-30 23:20:43,422 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,422 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,422 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,422 INFO L448 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-12-30 23:20:43,422 INFO L448 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-12-30 23:20:43,423 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-12-30 23:20:43,423 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-12-30 23:20:43,423 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-12-30 23:20:43,423 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-12-30 23:20:43,423 INFO L448 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-12-30 23:20:43,423 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-12-30 23:20:43,423 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,423 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,423 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,423 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-12-30 23:20:43,423 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-12-30 23:20:43,423 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-12-30 23:20:43,423 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-12-30 23:20:43,424 INFO L448 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-12-30 23:20:43,424 INFO L448 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-12-30 23:20:43,424 INFO L448 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-12-30 23:20:43,424 INFO L448 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-12-30 23:20:43,424 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-12-30 23:20:43,424 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,424 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,424 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,424 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-12-30 23:20:43,424 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-12-30 23:20:43,424 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-12-30 23:20:43,424 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-12-30 23:20:43,425 INFO L448 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-12-30 23:20:43,425 INFO L448 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-12-30 23:20:43,425 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-12-30 23:20:43,425 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,425 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,425 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,425 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-12-30 23:20:43,425 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-12-30 23:20:43,425 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-12-30 23:20:43,425 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-12-30 23:20:43,425 INFO L448 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-12-30 23:20:43,425 INFO L448 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-12-30 23:20:43,426 INFO L448 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-12-30 23:20:43,426 INFO L448 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-12-30 23:20:43,426 INFO L448 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-12-30 23:20:43,426 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,426 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,426 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,426 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-12-30 23:20:43,426 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-12-30 23:20:43,426 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-12-30 23:20:43,426 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-12-30 23:20:43,426 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-12-30 23:20:43,426 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-12-30 23:20:43,427 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-12-30 23:20:43,427 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-12-30 23:20:43,427 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,427 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,427 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,427 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-12-30 23:20:43,427 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-12-30 23:20:43,427 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-12-30 23:20:43,427 INFO L448 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-12-30 23:20:43,427 INFO L448 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-12-30 23:20:43,427 INFO L448 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-12-30 23:20:43,427 INFO L448 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-12-30 23:20:43,428 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-12-30 23:20:43,428 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,428 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,428 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,428 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-12-30 23:20:43,428 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-12-30 23:20:43,428 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 23:20:43,428 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-12-30 23:20:43,428 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-12-30 23:20:43,428 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-12-30 23:20:43,428 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-12-30 23:20:43,428 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-12-30 23:20:43,429 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-12-30 23:20:43,429 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,429 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,429 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,429 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-12-30 23:20:43,429 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-12-30 23:20:43,429 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-12-30 23:20:43,429 INFO L448 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-12-30 23:20:43,429 INFO L448 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-12-30 23:20:43,429 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-12-30 23:20:43,429 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-12-30 23:20:43,429 INFO L448 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-12-30 23:20:43,429 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,430 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,430 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,430 INFO L448 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-12-30 23:20:43,430 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-12-30 23:20:43,430 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-12-30 23:20:43,430 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-12-30 23:20:43,430 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-12-30 23:20:43,430 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-12-30 23:20:43,430 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 23:20:43,430 INFO L448 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-12-30 23:20:43,430 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-12-30 23:20:43,430 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,431 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,431 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,431 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-12-30 23:20:43,431 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-12-30 23:20:43,431 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-12-30 23:20:43,431 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-12-30 23:20:43,431 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-12-30 23:20:43,431 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-12-30 23:20:43,431 INFO L448 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-12-30 23:20:43,431 INFO L448 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-12-30 23:20:43,432 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2018-12-30 23:20:43,432 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,432 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,432 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,432 INFO L448 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-12-30 23:20:43,432 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-12-30 23:20:43,432 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-12-30 23:20:43,432 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-12-30 23:20:43,432 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-12-30 23:20:43,432 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-12-30 23:20:43,432 INFO L448 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-12-30 23:20:43,432 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-12-30 23:20:43,433 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,433 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,433 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-12-30 23:20:43,433 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-12-30 23:20:43,433 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-12-30 23:20:43,433 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-12-30 23:20:43,433 INFO L448 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-12-30 23:20:43,433 INFO L448 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-12-30 23:20:43,433 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-12-30 23:20:43,433 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-12-30 23:20:43,433 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,433 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,434 INFO L448 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-12-30 23:20:43,434 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-12-30 23:20:43,434 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-12-30 23:20:43,434 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-12-30 23:20:43,434 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-12-30 23:20:43,434 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-12-30 23:20:43,434 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,434 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,435 INFO L444 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse0 (= ~a24~0 1)) (.cse7 (<= ~a21~0 6)) (.cse25 (<= ~a12~0 80)) (.cse1 (<= ~a15~0 8))) (let ((.cse15 (= ~a15~0 8)) (.cse21 (and .cse25 .cse1)) (.cse18 (= ~a15~0 7)) (.cse4 (< 11 ~a12~0)) (.cse19 (or (and .cse25 .cse1 .cse7) (and .cse0 .cse1 .cse7))) (.cse24 (+ ~a12~0 43)) (.cse3 (= ~a21~0 9)) (.cse22 (= ~a21~0 8))) (let ((.cse14 (= ~a21~0 7)) (.cse6 (<= (+ ~a12~0 49) 0)) (.cse5 (and .cse22 .cse1)) (.cse11 (<= ~a12~0 11)) (.cse9 (not .cse3)) (.cse23 (<= .cse24 0)) (.cse8 (<= ~a12~0 95434)) (.cse20 (and .cse4 .cse19)) (.cse17 (not .cse18)) (.cse2 (< 80 ~a12~0)) (.cse16 (and .cse0 .cse21)) (.cse10 (not .cse15)) (.cse12 (< 0 .cse24))) (or (and .cse0 (= ~a21~0 10) .cse1) (and (<= ~a12~0 73282) (or (and .cse2 .cse3) (and .cse4 .cse5)) .cse0) (and .cse0 .cse6 .cse7) (and .cse8 (<= 95381 ~a12~0) .cse0 .cse7) (and .cse9 .cse0 .cse10 .cse11 .cse12) (and (exists ((v_~a12~0_437 Int)) (let ((.cse13 (* 9 v_~a12~0_437))) (and (<= 0 .cse13) (<= v_~a12~0_437 95434) (< 80 v_~a12~0_437) (<= (+ ~a12~0 546123) (div .cse13 10))))) .cse0 .cse14) (and .cse14 .cse0 .cse11 .cse12) (and (and .cse15 .cse7) .cse0 .cse12) (and (not (= ULTIMATE.start_calculate_output_~input 5)) .cse16 .cse12 .cse3) (and .cse17 .cse0 .cse14 .cse6) (and .cse18 .cse5 .cse0) (and .cse0 .cse10 .cse2 .cse3) (and .cse19 .cse10 .cse11) (and .cse18 .cse20 .cse0) (and (and .cse4 .cse21) .cse0) (and .cse22 .cse0 (<= ~a12~0 72) (<= 19 ~a12~0)) (and .cse0 (= ~a15~0 5)) (and (and (and .cse23 .cse17 .cse1) .cse0) .cse10) (and .cse0 .cse10 (and .cse9 .cse23 .cse17)) (and .cse8 .cse20 .cse0) (and (not (= ~a21~0 6)) .cse17 .cse0 .cse10 .cse2) (and .cse16 .cse10 .cse12))))) [2018-12-30 23:20:43,435 INFO L448 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-12-30 23:20:43,435 INFO L448 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-12-30 23:20:43,435 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-12-30 23:20:43,435 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-12-30 23:20:43,435 INFO L448 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-12-30 23:20:43,435 INFO L448 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-12-30 23:20:43,435 INFO L448 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-12-30 23:20:43,435 INFO L448 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-12-30 23:20:43,436 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,436 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,436 INFO L451 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2018-12-30 23:20:43,436 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-12-30 23:20:43,436 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-12-30 23:20:43,436 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-12-30 23:20:43,436 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-12-30 23:20:43,436 INFO L448 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-12-30 23:20:43,436 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-12-30 23:20:43,436 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-12-30 23:20:43,436 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,436 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,436 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-12-30 23:20:43,437 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-12-30 23:20:43,437 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-12-30 23:20:43,437 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-12-30 23:20:43,437 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 23:20:43,437 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-12-30 23:20:43,437 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-12-30 23:20:43,437 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,437 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,437 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-12-30 23:20:43,437 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,437 INFO L448 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-12-30 23:20:43,438 INFO L444 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse0 (= ~a24~0 1)) (.cse7 (<= ~a21~0 6)) (.cse25 (<= ~a12~0 80)) (.cse1 (<= ~a15~0 8))) (let ((.cse15 (= ~a15~0 8)) (.cse21 (and .cse25 .cse1)) (.cse18 (= ~a15~0 7)) (.cse4 (< 11 ~a12~0)) (.cse19 (or (and .cse25 .cse1 .cse7) (and .cse0 .cse1 .cse7))) (.cse24 (+ ~a12~0 43)) (.cse3 (= ~a21~0 9)) (.cse22 (= ~a21~0 8))) (let ((.cse14 (= ~a21~0 7)) (.cse6 (<= (+ ~a12~0 49) 0)) (.cse5 (and .cse22 .cse1)) (.cse11 (<= ~a12~0 11)) (.cse9 (not .cse3)) (.cse23 (<= .cse24 0)) (.cse8 (<= ~a12~0 95434)) (.cse20 (and .cse4 .cse19)) (.cse17 (not .cse18)) (.cse2 (< 80 ~a12~0)) (.cse16 (and .cse0 .cse21)) (.cse10 (not .cse15)) (.cse12 (< 0 .cse24))) (or (and .cse0 (= ~a21~0 10) .cse1) (and (<= ~a12~0 73282) (or (and .cse2 .cse3) (and .cse4 .cse5)) .cse0) (and .cse0 .cse6 .cse7) (and .cse8 (<= 95381 ~a12~0) .cse0 .cse7) (and .cse9 .cse0 .cse10 .cse11 .cse12) (and (exists ((v_~a12~0_437 Int)) (let ((.cse13 (* 9 v_~a12~0_437))) (and (<= 0 .cse13) (<= v_~a12~0_437 95434) (< 80 v_~a12~0_437) (<= (+ ~a12~0 546123) (div .cse13 10))))) .cse0 .cse14) (and .cse14 .cse0 .cse11 .cse12) (and (and .cse15 .cse7) .cse0 .cse12) (and (not (= ULTIMATE.start_calculate_output_~input 5)) .cse16 .cse12 .cse3) (and .cse17 .cse0 .cse14 .cse6) (and .cse18 .cse5 .cse0) (and .cse0 .cse10 .cse2 .cse3) (and .cse19 .cse10 .cse11) (and .cse18 .cse20 .cse0) (and (and .cse4 .cse21) .cse0) (and .cse22 .cse0 (<= ~a12~0 72) (<= 19 ~a12~0)) (and .cse0 (= ~a15~0 5)) (and (and (and .cse23 .cse17 .cse1) .cse0) .cse10) (and .cse0 .cse10 (and .cse9 .cse23 .cse17)) (and .cse8 .cse20 .cse0) (and (not (= ~a21~0 6)) .cse17 .cse0 .cse10 .cse2) (and .cse16 .cse10 .cse12))))) [2018-12-30 23:20:43,438 INFO L448 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-12-30 23:20:43,438 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-12-30 23:20:43,438 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-30 23:20:43,438 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-12-30 23:20:43,438 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-12-30 23:20:43,438 INFO L448 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-12-30 23:20:43,438 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-12-30 23:20:43,438 INFO L448 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-12-30 23:20:43,439 INFO L448 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-12-30 23:20:43,439 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,439 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,439 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,439 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-12-30 23:20:43,439 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-12-30 23:20:43,439 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-12-30 23:20:43,439 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-12-30 23:20:43,439 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-12-30 23:20:43,439 INFO L448 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-12-30 23:20:43,439 INFO L448 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-12-30 23:20:43,439 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-12-30 23:20:43,440 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-12-30 23:20:43,440 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,440 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,440 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,440 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-12-30 23:20:43,440 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-12-30 23:20:43,440 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-12-30 23:20:43,440 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-12-30 23:20:43,440 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 23:20:43,440 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-12-30 23:20:43,440 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-12-30 23:20:43,440 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-12-30 23:20:43,441 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-12-30 23:20:43,441 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,441 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,441 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,441 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-12-30 23:20:43,441 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-12-30 23:20:43,441 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-12-30 23:20:43,441 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-12-30 23:20:43,441 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-12-30 23:20:43,441 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-12-30 23:20:43,441 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-12-30 23:20:43,441 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-12-30 23:20:43,441 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-12-30 23:20:43,442 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,442 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,442 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:20:43,442 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-12-30 23:20:43,442 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-12-30 23:20:43,442 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-30 23:20:43,442 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-12-30 23:20:43,442 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-12-30 23:20:43,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,453 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,453 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,473 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,482 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,484 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,484 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,484 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,494 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,494 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,495 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,495 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 11:20:43 BoogieIcfgContainer [2018-12-30 23:20:43,502 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 23:20:43,503 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 23:20:43,503 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 23:20:43,503 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 23:20:43,506 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:19:32" (3/4) ... [2018-12-30 23:20:43,512 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 23:20:43,565 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 23:20:43,572 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 23:20:43,619 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((a24 == 1 && a21 == 10) && a15 <= 8) || ((a12 <= 73282 && ((80 < a12 && a21 == 9) || (11 < a12 && a21 == 8 && a15 <= 8))) && a24 == 1)) || ((a24 == 1 && a12 + 49 <= 0) && a21 <= 6)) || (((a12 <= 95434 && 95381 <= a12) && a24 == 1) && a21 <= 6)) || ((((!(a21 == 9) && a24 == 1) && !(a15 == 8)) && a12 <= 11) && 0 < a12 + 43)) || (((\exists v_~a12~0_437 : int :: ((0 <= 9 * v_~a12~0_437 && v_~a12~0_437 <= 95434) && 80 < v_~a12~0_437) && a12 + 546123 <= 9 * v_~a12~0_437 / 10) && a24 == 1) && a21 == 7)) || (((a21 == 7 && a24 == 1) && a12 <= 11) && 0 < a12 + 43)) || (((a15 == 8 && a21 <= 6) && a24 == 1) && 0 < a12 + 43)) || (((!(input == 5) && a24 == 1 && a12 <= 80 && a15 <= 8) && 0 < a12 + 43) && a21 == 9)) || (((!(a15 == 7) && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || ((a15 == 7 && a21 == 8 && a15 <= 8) && a24 == 1)) || (((a24 == 1 && !(a15 == 8)) && 80 < a12) && a21 == 9)) || (((((a12 <= 80 && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6)) && !(a15 == 8)) && a12 <= 11)) || ((a15 == 7 && 11 < a12 && (((a12 <= 80 && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && a24 == 1)) || ((11 < a12 && a12 <= 80 && a15 <= 8) && a24 == 1)) || (((a21 == 8 && a24 == 1) && a12 <= 72) && 19 <= a12)) || (a24 == 1 && a15 == 5)) || ((((a12 + 43 <= 0 && !(a15 == 7)) && a15 <= 8) && a24 == 1) && !(a15 == 8))) || ((a24 == 1 && !(a15 == 8)) && (!(a21 == 9) && a12 + 43 <= 0) && !(a15 == 7))) || ((a12 <= 95434 && 11 < a12 && (((a12 <= 80 && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && a24 == 1)) || ((((!(a21 == 6) && !(a15 == 7)) && a24 == 1) && !(a15 == 8)) && 80 < a12)) || (((a24 == 1 && a12 <= 80 && a15 <= 8) && !(a15 == 8)) && 0 < a12 + 43) [2018-12-30 23:20:43,624 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((a24 == 1 && a21 == 10) && a15 <= 8) || ((a12 <= 73282 && ((80 < a12 && a21 == 9) || (11 < a12 && a21 == 8 && a15 <= 8))) && a24 == 1)) || ((a24 == 1 && a12 + 49 <= 0) && a21 <= 6)) || (((a12 <= 95434 && 95381 <= a12) && a24 == 1) && a21 <= 6)) || ((((!(a21 == 9) && a24 == 1) && !(a15 == 8)) && a12 <= 11) && 0 < a12 + 43)) || (((\exists v_~a12~0_437 : int :: ((0 <= 9 * v_~a12~0_437 && v_~a12~0_437 <= 95434) && 80 < v_~a12~0_437) && a12 + 546123 <= 9 * v_~a12~0_437 / 10) && a24 == 1) && a21 == 7)) || (((a21 == 7 && a24 == 1) && a12 <= 11) && 0 < a12 + 43)) || (((a15 == 8 && a21 <= 6) && a24 == 1) && 0 < a12 + 43)) || (((!(input == 5) && a24 == 1 && a12 <= 80 && a15 <= 8) && 0 < a12 + 43) && a21 == 9)) || (((!(a15 == 7) && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || ((a15 == 7 && a21 == 8 && a15 <= 8) && a24 == 1)) || (((a24 == 1 && !(a15 == 8)) && 80 < a12) && a21 == 9)) || (((((a12 <= 80 && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6)) && !(a15 == 8)) && a12 <= 11)) || ((a15 == 7 && 11 < a12 && (((a12 <= 80 && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && a24 == 1)) || ((11 < a12 && a12 <= 80 && a15 <= 8) && a24 == 1)) || (((a21 == 8 && a24 == 1) && a12 <= 72) && 19 <= a12)) || (a24 == 1 && a15 == 5)) || ((((a12 + 43 <= 0 && !(a15 == 7)) && a15 <= 8) && a24 == 1) && !(a15 == 8))) || ((a24 == 1 && !(a15 == 8)) && (!(a21 == 9) && a12 + 43 <= 0) && !(a15 == 7))) || ((a12 <= 95434 && 11 < a12 && (((a12 <= 80 && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && a24 == 1)) || ((((!(a21 == 6) && !(a15 == 7)) && a24 == 1) && !(a15 == 8)) && 80 < a12)) || (((a24 == 1 && a12 <= 80 && a15 <= 8) && !(a15 == 8)) && 0 < a12 + 43) [2018-12-30 23:20:43,776 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 23:20:43,776 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 23:20:43,777 INFO L168 Benchmark]: Toolchain (without parser) took 76635.31 ms. Allocated memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: 2.8 GB). Free memory was 947.3 MB in the beginning and 1.5 GB in the end (delta: -537.6 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2018-12-30 23:20:43,778 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 23:20:43,779 INFO L168 Benchmark]: CACSL2BoogieTranslator took 874.67 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 913.8 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2018-12-30 23:20:43,779 INFO L168 Benchmark]: Boogie Procedure Inliner took 217.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 913.8 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-12-30 23:20:43,779 INFO L168 Benchmark]: Boogie Preprocessor took 127.11 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-30 23:20:43,781 INFO L168 Benchmark]: RCFGBuilder took 3911.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 960.7 MB in the end (delta: 129.0 MB). Peak memory consumption was 129.0 MB. Max. memory is 11.5 GB. [2018-12-30 23:20:43,782 INFO L168 Benchmark]: TraceAbstraction took 71223.39 ms. Allocated memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: 2.7 GB). Free memory was 960.7 MB in the beginning and 1.5 GB in the end (delta: -583.9 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-12-30 23:20:43,782 INFO L168 Benchmark]: Witness Printer took 273.78 ms. Allocated memory is still 3.8 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 59.6 MB). Peak memory consumption was 59.6 MB. Max. memory is 11.5 GB. [2018-12-30 23:20:43,786 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 874.67 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 913.8 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 217.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 913.8 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 127.11 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3911.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 960.7 MB in the end (delta: 129.0 MB). Peak memory consumption was 129.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 71223.39 ms. Allocated memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: 2.7 GB). Free memory was 960.7 MB in the beginning and 1.5 GB in the end (delta: -583.9 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 273.78 ms. Allocated memory is still 3.8 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 59.6 MB). Peak memory consumption was 59.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 880]: Loop Invariant [2018-12-30 23:20:43,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,805 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,805 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,805 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,805 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((a24 == 1 && a21 == 10) && a15 <= 8) || ((a12 <= 73282 && ((80 < a12 && a21 == 9) || (11 < a12 && a21 == 8 && a15 <= 8))) && a24 == 1)) || ((a24 == 1 && a12 + 49 <= 0) && a21 <= 6)) || (((a12 <= 95434 && 95381 <= a12) && a24 == 1) && a21 <= 6)) || ((((!(a21 == 9) && a24 == 1) && !(a15 == 8)) && a12 <= 11) && 0 < a12 + 43)) || (((\exists v_~a12~0_437 : int :: ((0 <= 9 * v_~a12~0_437 && v_~a12~0_437 <= 95434) && 80 < v_~a12~0_437) && a12 + 546123 <= 9 * v_~a12~0_437 / 10) && a24 == 1) && a21 == 7)) || (((a21 == 7 && a24 == 1) && a12 <= 11) && 0 < a12 + 43)) || (((a15 == 8 && a21 <= 6) && a24 == 1) && 0 < a12 + 43)) || (((!(input == 5) && a24 == 1 && a12 <= 80 && a15 <= 8) && 0 < a12 + 43) && a21 == 9)) || (((!(a15 == 7) && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || ((a15 == 7 && a21 == 8 && a15 <= 8) && a24 == 1)) || (((a24 == 1 && !(a15 == 8)) && 80 < a12) && a21 == 9)) || (((((a12 <= 80 && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6)) && !(a15 == 8)) && a12 <= 11)) || ((a15 == 7 && 11 < a12 && (((a12 <= 80 && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && a24 == 1)) || ((11 < a12 && a12 <= 80 && a15 <= 8) && a24 == 1)) || (((a21 == 8 && a24 == 1) && a12 <= 72) && 19 <= a12)) || (a24 == 1 && a15 == 5)) || ((((a12 + 43 <= 0 && !(a15 == 7)) && a15 <= 8) && a24 == 1) && !(a15 == 8))) || ((a24 == 1 && !(a15 == 8)) && (!(a21 == 9) && a12 + 43 <= 0) && !(a15 == 7))) || ((a12 <= 95434 && 11 < a12 && (((a12 <= 80 && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && a24 == 1)) || ((((!(a21 == 6) && !(a15 == 7)) && a24 == 1) && !(a15 == 8)) && 80 < a12)) || (((a24 == 1 && a12 <= 80 && a15 <= 8) && !(a15 == 8)) && 0 < a12 + 43) - InvariantResult [Line: 20]: Loop Invariant [2018-12-30 23:20:43,807 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,808 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] [2018-12-30 23:20:43,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_437,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((a24 == 1 && a21 == 10) && a15 <= 8) || ((a12 <= 73282 && ((80 < a12 && a21 == 9) || (11 < a12 && a21 == 8 && a15 <= 8))) && a24 == 1)) || ((a24 == 1 && a12 + 49 <= 0) && a21 <= 6)) || (((a12 <= 95434 && 95381 <= a12) && a24 == 1) && a21 <= 6)) || ((((!(a21 == 9) && a24 == 1) && !(a15 == 8)) && a12 <= 11) && 0 < a12 + 43)) || (((\exists v_~a12~0_437 : int :: ((0 <= 9 * v_~a12~0_437 && v_~a12~0_437 <= 95434) && 80 < v_~a12~0_437) && a12 + 546123 <= 9 * v_~a12~0_437 / 10) && a24 == 1) && a21 == 7)) || (((a21 == 7 && a24 == 1) && a12 <= 11) && 0 < a12 + 43)) || (((a15 == 8 && a21 <= 6) && a24 == 1) && 0 < a12 + 43)) || (((!(input == 5) && a24 == 1 && a12 <= 80 && a15 <= 8) && 0 < a12 + 43) && a21 == 9)) || (((!(a15 == 7) && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || ((a15 == 7 && a21 == 8 && a15 <= 8) && a24 == 1)) || (((a24 == 1 && !(a15 == 8)) && 80 < a12) && a21 == 9)) || (((((a12 <= 80 && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6)) && !(a15 == 8)) && a12 <= 11)) || ((a15 == 7 && 11 < a12 && (((a12 <= 80 && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && a24 == 1)) || ((11 < a12 && a12 <= 80 && a15 <= 8) && a24 == 1)) || (((a21 == 8 && a24 == 1) && a12 <= 72) && 19 <= a12)) || (a24 == 1 && a15 == 5)) || ((((a12 + 43 <= 0 && !(a15 == 7)) && a15 <= 8) && a24 == 1) && !(a15 == 8))) || ((a24 == 1 && !(a15 == 8)) && (!(a21 == 9) && a12 + 43 <= 0) && !(a15 == 7))) || ((a12 <= 95434 && 11 < a12 && (((a12 <= 80 && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && a24 == 1)) || ((((!(a21 == 6) && !(a15 == 7)) && a24 == 1) && !(a15 == 8)) && 80 < a12)) || (((a24 == 1 && a12 <= 80 && a15 <= 8) && !(a15 == 8)) && 0 < a12 + 43) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. SAFE Result, 71.0s OverallTime, 15 OverallIterations, 15 TraceHistogramMax, 37.5s AutomataDifference, 0.0s DeadEndRemovalTime, 4.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1099 SDtfs, 5703 SDslu, 388 SDs, 0 SdLazy, 24918 SolverSat, 2138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4314 GetRequests, 4228 SyntacticMatches, 5 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5522occurred in iteration=11, 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: 1.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 6427 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 88 NumberOfFragments, 845 HoareAnnotationTreeSize, 3 FomulaSimplifications, 62284 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 3 FomulaSimplificationsInter, 22348 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 16234 NumberOfCodeBlocks, 16234 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 16214 ConstructedInterpolants, 17 QuantifiedInterpolants, 54764912 SizeOfPredicates, 17 NumberOfNonLiveVariables, 5148 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 20 InterpolantComputations, 11 PerfectInterpolantSequences, 54002/55525 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...