./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label42.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/eca-rers2012/Problem01_label42.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 1ced3eb982b16bda97708eba7d7a33ef6d709871 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:39:18,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:39:18,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:39:18,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:39:18,195 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:39:18,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:39:18,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:39:18,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:39:18,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:39:18,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:39:18,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:39:18,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:39:18,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:39:18,226 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:39:18,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:39:18,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:39:18,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:39:18,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:39:18,236 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:39:18,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:39:18,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:39:18,246 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:39:18,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:39:18,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:39:18,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:39:18,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:39:18,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:39:18,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:39:18,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:39:18,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:39:18,262 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:39:18,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:39:18,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:39:18,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:39:18,268 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:39:18,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:39:18,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:39:18,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:39:18,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:39:18,273 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:39:18,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:39:18,276 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:39:18,292 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:39:18,293 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:39:18,294 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:39:18,294 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:39:18,294 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:39:18,295 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:39:18,295 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:39:18,295 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:39:18,295 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:39:18,295 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:39:18,296 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:39:18,296 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:39:18,296 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:39:18,296 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:39:18,296 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:39:18,297 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:39:18,297 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:39:18,297 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:39:18,297 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:39:18,298 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:39:18,298 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:39:18,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:39:18,298 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:39:18,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:39:18,299 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:39:18,299 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:39:18,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:39:18,299 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:39:18,299 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 1ced3eb982b16bda97708eba7d7a33ef6d709871 [2019-11-27 22:39:18,604 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:39:18,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:39:18,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:39:18,629 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:39:18,629 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:39:18,632 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label42.c [2019-11-27 22:39:18,708 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e57d3a9a/e045d3a5c92240678ae651c852c233b5/FLAG2a671f03a [2019-11-27 22:39:19,337 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:39:19,338 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label42.c [2019-11-27 22:39:19,359 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e57d3a9a/e045d3a5c92240678ae651c852c233b5/FLAG2a671f03a [2019-11-27 22:39:19,546 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e57d3a9a/e045d3a5c92240678ae651c852c233b5 [2019-11-27 22:39:19,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:39:19,554 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:39:19,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:39:19,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:39:19,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:39:19,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:39:19" (1/1) ... [2019-11-27 22:39:19,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f95bb4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:19, skipping insertion in model container [2019-11-27 22:39:19,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:39:19" (1/1) ... [2019-11-27 22:39:19,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:39:19,628 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:39:20,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:39:20,101 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:39:20,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:39:20,229 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:39:20,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:20 WrapperNode [2019-11-27 22:39:20,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:39:20,231 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:39:20,232 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:39:20,232 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:39:20,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:20" (1/1) ... [2019-11-27 22:39:20,269 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:20" (1/1) ... [2019-11-27 22:39:20,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:39:20,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:39:20,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:39:20,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:39:20,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:20" (1/1) ... [2019-11-27 22:39:20,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:20" (1/1) ... [2019-11-27 22:39:20,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:20" (1/1) ... [2019-11-27 22:39:20,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:20" (1/1) ... [2019-11-27 22:39:20,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:20" (1/1) ... [2019-11-27 22:39:20,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:20" (1/1) ... [2019-11-27 22:39:20,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:20" (1/1) ... [2019-11-27 22:39:20,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:39:20,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:39:20,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:39:20,425 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:39:20,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:39:20,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:39:20,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:39:22,011 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:39:22,011 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:39:22,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:39:22 BoogieIcfgContainer [2019-11-27 22:39:22,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:39:22,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:39:22,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:39:22,017 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:39:22,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:39:19" (1/3) ... [2019-11-27 22:39:22,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62bbdd83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:39:22, skipping insertion in model container [2019-11-27 22:39:22,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:20" (2/3) ... [2019-11-27 22:39:22,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62bbdd83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:39:22, skipping insertion in model container [2019-11-27 22:39:22,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:39:22" (3/3) ... [2019-11-27 22:39:22,021 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label42.c [2019-11-27 22:39:22,032 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:39:22,041 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:39:22,056 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:39:22,085 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:39:22,085 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:39:22,085 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:39:22,085 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:39:22,086 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:39:22,086 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:39:22,086 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:39:22,086 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:39:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-27 22:39:22,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-27 22:39:22,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:22,125 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:22,125 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:22,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:22,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1613704130, now seen corresponding path program 1 times [2019-11-27 22:39:22,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:22,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228736665] [2019-11-27 22:39:22,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:39:22,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228736665] [2019-11-27 22:39:22,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:22,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:39:22,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340379538] [2019-11-27 22:39:22,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:22,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:22,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:22,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:22,690 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-11-27 22:39:23,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:23,659 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-11-27 22:39:23,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:23,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-11-27 22:39:23,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:23,692 INFO L225 Difference]: With dead ends: 528 [2019-11-27 22:39:23,692 INFO L226 Difference]: Without dead ends: 266 [2019-11-27 22:39:23,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:23,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-27 22:39:23,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-11-27 22:39:23,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-27 22:39:23,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 374 transitions. [2019-11-27 22:39:23,811 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 374 transitions. Word has length 115 [2019-11-27 22:39:23,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:23,813 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 374 transitions. [2019-11-27 22:39:23,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:23,813 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 374 transitions. [2019-11-27 22:39:23,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-27 22:39:23,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:23,823 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:23,823 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:23,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:23,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1626358534, now seen corresponding path program 1 times [2019-11-27 22:39:23,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:23,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488929657] [2019-11-27 22:39:23,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:24,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 22:39:24,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488929657] [2019-11-27 22:39:24,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:24,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:39:24,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759006949] [2019-11-27 22:39:24,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:39:24,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:24,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:39:24,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:24,117 INFO L87 Difference]: Start difference. First operand 266 states and 374 transitions. Second operand 4 states. [2019-11-27 22:39:24,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:24,977 INFO L93 Difference]: Finished difference Result 1054 states and 1488 transitions. [2019-11-27 22:39:24,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:39:24,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-27 22:39:24,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:24,989 INFO L225 Difference]: With dead ends: 1054 [2019-11-27 22:39:24,990 INFO L226 Difference]: Without dead ends: 790 [2019-11-27 22:39:24,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-27 22:39:25,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 528. [2019-11-27 22:39:25,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-27 22:39:25,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 708 transitions. [2019-11-27 22:39:25,045 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 708 transitions. Word has length 119 [2019-11-27 22:39:25,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:25,046 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 708 transitions. [2019-11-27 22:39:25,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:39:25,047 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 708 transitions. [2019-11-27 22:39:25,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-27 22:39:25,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:25,056 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:25,056 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:25,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:25,057 INFO L82 PathProgramCache]: Analyzing trace with hash -951101936, now seen corresponding path program 1 times [2019-11-27 22:39:25,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:25,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947197804] [2019-11-27 22:39:25,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:25,193 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-27 22:39:25,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947197804] [2019-11-27 22:39:25,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:25,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:39:25,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519753283] [2019-11-27 22:39:25,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:25,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:25,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:25,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:25,200 INFO L87 Difference]: Start difference. First operand 528 states and 708 transitions. Second operand 3 states. [2019-11-27 22:39:25,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:25,703 INFO L93 Difference]: Finished difference Result 1316 states and 1785 transitions. [2019-11-27 22:39:25,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:25,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-27 22:39:25,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:25,709 INFO L225 Difference]: With dead ends: 1316 [2019-11-27 22:39:25,709 INFO L226 Difference]: Without dead ends: 790 [2019-11-27 22:39:25,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:25,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-27 22:39:25,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 659. [2019-11-27 22:39:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-27 22:39:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 888 transitions. [2019-11-27 22:39:25,730 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 888 transitions. Word has length 149 [2019-11-27 22:39:25,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:25,730 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 888 transitions. [2019-11-27 22:39:25,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:25,731 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 888 transitions. [2019-11-27 22:39:25,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-27 22:39:25,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:25,733 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:25,734 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:25,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:25,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1921921286, now seen corresponding path program 1 times [2019-11-27 22:39:25,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:25,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731449685] [2019-11-27 22:39:25,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:25,861 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-27 22:39:25,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731449685] [2019-11-27 22:39:25,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:25,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:39:25,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581078389] [2019-11-27 22:39:25,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:39:25,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:25,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:39:25,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:25,864 INFO L87 Difference]: Start difference. First operand 659 states and 888 transitions. Second operand 4 states. [2019-11-27 22:39:26,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:26,681 INFO L93 Difference]: Finished difference Result 1449 states and 1931 transitions. [2019-11-27 22:39:26,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:39:26,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-27 22:39:26,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:26,684 INFO L225 Difference]: With dead ends: 1449 [2019-11-27 22:39:26,685 INFO L226 Difference]: Without dead ends: 792 [2019-11-27 22:39:26,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:39:26,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-11-27 22:39:26,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 790. [2019-11-27 22:39:26,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-27 22:39:26,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1025 transitions. [2019-11-27 22:39:26,705 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1025 transitions. Word has length 153 [2019-11-27 22:39:26,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:26,706 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1025 transitions. [2019-11-27 22:39:26,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:39:26,706 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1025 transitions. [2019-11-27 22:39:26,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-27 22:39:26,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:26,709 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:26,710 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:26,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:26,710 INFO L82 PathProgramCache]: Analyzing trace with hash -680769074, now seen corresponding path program 1 times [2019-11-27 22:39:26,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:26,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070696265] [2019-11-27 22:39:26,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:26,779 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-27 22:39:26,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070696265] [2019-11-27 22:39:26,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:26,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:39:26,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946209973] [2019-11-27 22:39:26,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:26,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:26,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:26,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:26,782 INFO L87 Difference]: Start difference. First operand 790 states and 1025 transitions. Second operand 3 states. [2019-11-27 22:39:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:27,418 INFO L93 Difference]: Finished difference Result 1709 states and 2245 transitions. [2019-11-27 22:39:27,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:27,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-27 22:39:27,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:27,423 INFO L225 Difference]: With dead ends: 1709 [2019-11-27 22:39:27,424 INFO L226 Difference]: Without dead ends: 1052 [2019-11-27 22:39:27,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:27,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-11-27 22:39:27,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2019-11-27 22:39:27,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-11-27 22:39:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1323 transitions. [2019-11-27 22:39:27,453 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1323 transitions. Word has length 157 [2019-11-27 22:39:27,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:27,453 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1323 transitions. [2019-11-27 22:39:27,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:27,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1323 transitions. [2019-11-27 22:39:27,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-27 22:39:27,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:27,458 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:27,458 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:27,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:27,458 INFO L82 PathProgramCache]: Analyzing trace with hash 556803504, now seen corresponding path program 1 times [2019-11-27 22:39:27,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:27,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065531373] [2019-11-27 22:39:27,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:27,521 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-27 22:39:27,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065531373] [2019-11-27 22:39:27,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:27,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:39:27,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629085874] [2019-11-27 22:39:27,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:39:27,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:27,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:39:27,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:27,526 INFO L87 Difference]: Start difference. First operand 1052 states and 1323 transitions. Second operand 4 states. [2019-11-27 22:39:28,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:28,335 INFO L93 Difference]: Finished difference Result 3150 states and 3974 transitions. [2019-11-27 22:39:28,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:39:28,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-27 22:39:28,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:28,350 INFO L225 Difference]: With dead ends: 3150 [2019-11-27 22:39:28,350 INFO L226 Difference]: Without dead ends: 2231 [2019-11-27 22:39:28,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:28,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-11-27 22:39:28,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1576. [2019-11-27 22:39:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-27 22:39:28,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1943 transitions. [2019-11-27 22:39:28,410 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1943 transitions. Word has length 166 [2019-11-27 22:39:28,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:28,411 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1943 transitions. [2019-11-27 22:39:28,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:39:28,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1943 transitions. [2019-11-27 22:39:28,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-27 22:39:28,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:28,420 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:28,420 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:28,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:28,427 INFO L82 PathProgramCache]: Analyzing trace with hash 390134956, now seen corresponding path program 1 times [2019-11-27 22:39:28,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:28,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291025160] [2019-11-27 22:39:28,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-27 22:39:28,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291025160] [2019-11-27 22:39:28,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:28,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:39:28,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851748685] [2019-11-27 22:39:28,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:39:28,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:28,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:39:28,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:39:28,612 INFO L87 Difference]: Start difference. First operand 1576 states and 1943 transitions. Second operand 5 states. [2019-11-27 22:39:29,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:29,760 INFO L93 Difference]: Finished difference Result 3543 states and 4355 transitions. [2019-11-27 22:39:29,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:39:29,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2019-11-27 22:39:29,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:29,771 INFO L225 Difference]: With dead ends: 3543 [2019-11-27 22:39:29,771 INFO L226 Difference]: Without dead ends: 2100 [2019-11-27 22:39:29,774 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:39:29,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-27 22:39:29,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1838. [2019-11-27 22:39:29,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-27 22:39:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2217 transitions. [2019-11-27 22:39:29,823 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2217 transitions. Word has length 190 [2019-11-27 22:39:29,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:29,823 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2217 transitions. [2019-11-27 22:39:29,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:39:29,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2217 transitions. [2019-11-27 22:39:29,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-27 22:39:29,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:29,830 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:29,831 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:29,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:29,831 INFO L82 PathProgramCache]: Analyzing trace with hash 128921415, now seen corresponding path program 1 times [2019-11-27 22:39:29,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:29,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166508444] [2019-11-27 22:39:29,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-27 22:39:29,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166508444] [2019-11-27 22:39:29,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:29,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:39:29,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286970333] [2019-11-27 22:39:29,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:29,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:29,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:29,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:29,907 INFO L87 Difference]: Start difference. First operand 1838 states and 2217 transitions. Second operand 3 states. [2019-11-27 22:39:30,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:30,479 INFO L93 Difference]: Finished difference Result 4067 states and 4903 transitions. [2019-11-27 22:39:30,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:30,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-27 22:39:30,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:30,489 INFO L225 Difference]: With dead ends: 4067 [2019-11-27 22:39:30,490 INFO L226 Difference]: Without dead ends: 1969 [2019-11-27 22:39:30,493 INFO L630 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 [2019-11-27 22:39:30,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-27 22:39:30,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2019-11-27 22:39:30,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-27 22:39:30,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1877 transitions. [2019-11-27 22:39:30,533 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1877 transitions. Word has length 193 [2019-11-27 22:39:30,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:30,533 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1877 transitions. [2019-11-27 22:39:30,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:30,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1877 transitions. [2019-11-27 22:39:30,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-11-27 22:39:30,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:30,540 INFO L410 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:30,540 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:30,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:30,541 INFO L82 PathProgramCache]: Analyzing trace with hash 2022598972, now seen corresponding path program 1 times [2019-11-27 22:39:30,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:30,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268507342] [2019-11-27 22:39:30,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-27 22:39:30,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268507342] [2019-11-27 22:39:30,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516091197] [2019-11-27 22:39:30,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:39:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:30,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:39:30,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:39:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-27 22:39:30,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:39:30,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-11-27 22:39:30,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315221821] [2019-11-27 22:39:30,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:30,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:30,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:30,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:30,968 INFO L87 Difference]: Start difference. First operand 1707 states and 1877 transitions. Second operand 3 states. [2019-11-27 22:39:31,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:31,539 INFO L93 Difference]: Finished difference Result 3672 states and 4041 transitions. [2019-11-27 22:39:31,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:31,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-11-27 22:39:31,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:31,541 INFO L225 Difference]: With dead ends: 3672 [2019-11-27 22:39:31,541 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:39:31,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:31,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:39:31,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:39:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:39:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:39:31,546 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 219 [2019-11-27 22:39:31,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:31,546 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:39:31,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:39:31,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:39:31,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:39:31,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:39:32,004 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-11-27 22:39:32,189 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-11-27 22:39:32,192 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-27 22:39:32,192 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-27 22:39:32,193 INFO L246 CegarLoopResult]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,193 INFO L246 CegarLoopResult]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,193 INFO L246 CegarLoopResult]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,193 INFO L246 CegarLoopResult]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,193 INFO L246 CegarLoopResult]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,193 INFO L246 CegarLoopResult]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,193 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-27 22:39:32,193 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-27 22:39:32,193 INFO L246 CegarLoopResult]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-27 22:39:32,194 INFO L246 CegarLoopResult]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-27 22:39:32,194 INFO L246 CegarLoopResult]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-27 22:39:32,194 INFO L246 CegarLoopResult]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-27 22:39:32,194 INFO L246 CegarLoopResult]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-27 22:39:32,194 INFO L246 CegarLoopResult]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-27 22:39:32,194 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-27 22:39:32,194 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-27 22:39:32,195 INFO L246 CegarLoopResult]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,195 INFO L246 CegarLoopResult]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,195 INFO L246 CegarLoopResult]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,195 INFO L246 CegarLoopResult]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,195 INFO L246 CegarLoopResult]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,196 INFO L246 CegarLoopResult]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,196 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-27 22:39:32,196 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-27 22:39:32,196 INFO L246 CegarLoopResult]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-27 22:39:32,196 INFO L246 CegarLoopResult]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-27 22:39:32,196 INFO L246 CegarLoopResult]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-27 22:39:32,197 INFO L246 CegarLoopResult]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-27 22:39:32,197 INFO L246 CegarLoopResult]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-27 22:39:32,197 INFO L246 CegarLoopResult]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-27 22:39:32,197 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-27 22:39:32,197 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-27 22:39:32,197 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-27 22:39:32,197 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-27 22:39:32,197 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-27 22:39:32,197 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-27 22:39:32,198 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-27 22:39:32,198 INFO L246 CegarLoopResult]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,198 INFO L246 CegarLoopResult]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,198 INFO L246 CegarLoopResult]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,198 INFO L246 CegarLoopResult]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,198 INFO L246 CegarLoopResult]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,198 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-27 22:39:32,198 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-27 22:39:32,198 INFO L246 CegarLoopResult]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-27 22:39:32,199 INFO L246 CegarLoopResult]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-27 22:39:32,199 INFO L246 CegarLoopResult]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-27 22:39:32,199 INFO L246 CegarLoopResult]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-27 22:39:32,199 INFO L246 CegarLoopResult]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-27 22:39:32,199 INFO L246 CegarLoopResult]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-27 22:39:32,199 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-27 22:39:32,200 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (not (= ~a16~0 6))) (.cse2 (= ~a17~0 1)) (.cse0 (= 1 ~a7~0)) (.cse3 (= ~a20~0 1)) (.cse7 (= ~a16~0 5)) (.cse4 (<= ~a17~0 0)) (.cse5 (= ~a21~0 1)) (.cse6 (not (= 13 ~a8~0)))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3) (and .cse1 .cse4 .cse5) (and .cse4 .cse5 .cse3) (and .cse2 .cse5 .cse6) (and .cse2 .cse5 .cse3) (and .cse0 .cse5 .cse6 .cse7) (and .cse5 .cse3 .cse7) (and .cse4 .cse5 .cse6))) [2019-11-27 22:39:32,200 INFO L246 CegarLoopResult]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,200 INFO L246 CegarLoopResult]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,200 INFO L246 CegarLoopResult]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,200 INFO L246 CegarLoopResult]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,201 INFO L246 CegarLoopResult]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,201 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-27 22:39:32,201 INFO L246 CegarLoopResult]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-27 22:39:32,201 INFO L246 CegarLoopResult]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-27 22:39:32,201 INFO L246 CegarLoopResult]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-27 22:39:32,201 INFO L246 CegarLoopResult]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-27 22:39:32,201 INFO L246 CegarLoopResult]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-27 22:39:32,201 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-27 22:39:32,202 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-27 22:39:32,202 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-27 22:39:32,202 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-27 22:39:32,202 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-27 22:39:32,202 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-27 22:39:32,202 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-27 22:39:32,202 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-27 22:39:32,202 INFO L246 CegarLoopResult]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,202 INFO L246 CegarLoopResult]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,203 INFO L246 CegarLoopResult]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,203 INFO L246 CegarLoopResult]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,203 INFO L246 CegarLoopResult]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,203 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-27 22:39:32,203 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-27 22:39:32,203 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-27 22:39:32,203 INFO L246 CegarLoopResult]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-27 22:39:32,203 INFO L246 CegarLoopResult]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-27 22:39:32,203 INFO L246 CegarLoopResult]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-27 22:39:32,204 INFO L246 CegarLoopResult]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-27 22:39:32,204 INFO L246 CegarLoopResult]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-27 22:39:32,204 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-27 22:39:32,204 INFO L246 CegarLoopResult]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,204 INFO L246 CegarLoopResult]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,204 INFO L246 CegarLoopResult]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,204 INFO L246 CegarLoopResult]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,204 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-27 22:39:32,204 INFO L246 CegarLoopResult]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,205 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-27 22:39:32,205 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-27 22:39:32,205 INFO L246 CegarLoopResult]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-27 22:39:32,205 INFO L246 CegarLoopResult]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-27 22:39:32,205 INFO L246 CegarLoopResult]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-27 22:39:32,205 INFO L246 CegarLoopResult]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-27 22:39:32,205 INFO L246 CegarLoopResult]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-27 22:39:32,205 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:39:32,205 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-27 22:39:32,205 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-27 22:39:32,206 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-27 22:39:32,206 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-27 22:39:32,206 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-27 22:39:32,206 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-27 22:39:32,206 INFO L246 CegarLoopResult]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,206 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (not (= ~a16~0 6))) (.cse2 (= ~a17~0 1)) (.cse0 (= 1 ~a7~0)) (.cse3 (= ~a20~0 1)) (.cse7 (= ~a16~0 5)) (.cse4 (<= ~a17~0 0)) (.cse5 (= ~a21~0 1)) (.cse6 (not (= 13 ~a8~0)))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3) (and .cse1 .cse4 .cse5) (and .cse4 .cse5 .cse3) (and .cse2 .cse5 .cse6) (and .cse2 .cse5 .cse3) (and .cse0 .cse5 .cse6 .cse7) (and .cse5 .cse3 .cse7) (and .cse4 .cse5 .cse6))) [2019-11-27 22:39:32,206 INFO L246 CegarLoopResult]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,207 INFO L246 CegarLoopResult]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,207 INFO L246 CegarLoopResult]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,207 INFO L246 CegarLoopResult]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,207 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-27 22:39:32,207 INFO L246 CegarLoopResult]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-27 22:39:32,207 INFO L246 CegarLoopResult]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-27 22:39:32,207 INFO L246 CegarLoopResult]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-27 22:39:32,207 INFO L246 CegarLoopResult]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-27 22:39:32,207 INFO L246 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-27 22:39:32,208 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-27 22:39:32,208 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-27 22:39:32,208 INFO L246 CegarLoopResult]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,208 INFO L246 CegarLoopResult]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,208 INFO L246 CegarLoopResult]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,208 INFO L246 CegarLoopResult]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,208 INFO L246 CegarLoopResult]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,208 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-27 22:39:32,208 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:39:32,209 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-27 22:39:32,209 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-27 22:39:32,209 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-27 22:39:32,209 INFO L246 CegarLoopResult]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-27 22:39:32,209 INFO L246 CegarLoopResult]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-27 22:39:32,209 INFO L246 CegarLoopResult]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-27 22:39:32,209 INFO L246 CegarLoopResult]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-27 22:39:32,209 INFO L246 CegarLoopResult]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-27 22:39:32,209 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-27 22:39:32,209 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-27 22:39:32,210 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-27 22:39:32,210 INFO L246 CegarLoopResult]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,210 INFO L246 CegarLoopResult]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,210 INFO L246 CegarLoopResult]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,210 INFO L246 CegarLoopResult]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,210 INFO L246 CegarLoopResult]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-27 22:39:32,210 INFO L246 CegarLoopResult]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,210 INFO L246 CegarLoopResult]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,210 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-27 22:39:32,211 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-27 22:39:32,211 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:39:32,211 INFO L246 CegarLoopResult]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-27 22:39:32,211 INFO L246 CegarLoopResult]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-27 22:39:32,211 INFO L246 CegarLoopResult]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-27 22:39:32,211 INFO L246 CegarLoopResult]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-27 22:39:32,211 INFO L246 CegarLoopResult]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-27 22:39:32,211 INFO L246 CegarLoopResult]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-27 22:39:32,211 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-27 22:39:32,212 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-27 22:39:32,212 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-27 22:39:32,212 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-27 22:39:32,212 INFO L246 CegarLoopResult]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,212 INFO L246 CegarLoopResult]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,212 INFO L246 CegarLoopResult]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,212 INFO L246 CegarLoopResult]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,212 INFO L246 CegarLoopResult]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,212 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-27 22:39:32,212 INFO L246 CegarLoopResult]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,212 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-27 22:39:32,213 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-27 22:39:32,213 INFO L246 CegarLoopResult]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-27 22:39:32,213 INFO L246 CegarLoopResult]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-27 22:39:32,213 INFO L246 CegarLoopResult]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-27 22:39:32,213 INFO L246 CegarLoopResult]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-27 22:39:32,213 INFO L246 CegarLoopResult]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-27 22:39:32,213 INFO L246 CegarLoopResult]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-27 22:39:32,213 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-27 22:39:32,213 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-27 22:39:32,214 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-27 22:39:32,214 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 22:39:32,214 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 521) no Hoare annotation was computed. [2019-11-27 22:39:32,214 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-27 22:39:32,214 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-27 22:39:32,214 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-27 22:39:32,214 INFO L246 CegarLoopResult]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,214 INFO L246 CegarLoopResult]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,215 INFO L246 CegarLoopResult]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,215 INFO L246 CegarLoopResult]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,215 INFO L246 CegarLoopResult]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,215 INFO L246 CegarLoopResult]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:32,215 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-27 22:39:32,215 INFO L246 CegarLoopResult]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-27 22:39:32,215 INFO L246 CegarLoopResult]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-27 22:39:32,215 INFO L246 CegarLoopResult]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-27 22:39:32,215 INFO L246 CegarLoopResult]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-27 22:39:32,216 INFO L246 CegarLoopResult]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-27 22:39:32,216 INFO L246 CegarLoopResult]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-27 22:39:32,216 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-27 22:39:32,216 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-27 22:39:32,216 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-27 22:39:32,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:39:32 BoogieIcfgContainer [2019-11-27 22:39:32,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:39:32,241 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:39:32,241 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:39:32,242 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:39:32,242 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:39:22" (3/4) ... [2019-11-27 22:39:32,246 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:39:32,269 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:39:32,270 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:39:32,521 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:39:32,521 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:39:32,523 INFO L168 Benchmark]: Toolchain (without parser) took 12971.52 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 398.5 MB). Free memory was 960.3 MB in the beginning and 1.3 GB in the end (delta: -296.5 MB). Peak memory consumption was 102.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:32,524 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:39:32,524 INFO L168 Benchmark]: CACSL2BoogieTranslator took 673.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -148.1 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:32,524 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:32,525 INFO L168 Benchmark]: Boogie Preprocessor took 86.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:32,525 INFO L168 Benchmark]: RCFGBuilder took 1588.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 982.4 MB in the end (delta: 107.1 MB). Peak memory consumption was 107.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:32,526 INFO L168 Benchmark]: TraceAbstraction took 10226.76 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 274.7 MB). Free memory was 975.7 MB in the beginning and 1.3 GB in the end (delta: -304.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:39:32,526 INFO L168 Benchmark]: Witness Printer took 280.33 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:32,529 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 673.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -148.1 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 105.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1588.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 982.4 MB in the end (delta: 107.1 MB). Peak memory consumption was 107.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10226.76 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 274.7 MB). Free memory was 975.7 MB in the beginning and 1.3 GB in the end (delta: -304.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 280.33 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 521]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((1 == a7 && !(a16 == 6)) && a17 == 1) || (1 == a7 && a20 == 1)) || ((!(a16 == 6) && a17 <= 0) && a21 == 1)) || ((a17 <= 0 && a21 == 1) && a20 == 1)) || ((a17 == 1 && a21 == 1) && !(13 == a8))) || ((a17 == 1 && a21 == 1) && a20 == 1)) || (((1 == a7 && a21 == 1) && !(13 == a8)) && a16 == 5)) || ((a21 == 1 && a20 == 1) && a16 == 5)) || ((a17 <= 0 && a21 == 1) && !(13 == a8)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((1 == a7 && !(a16 == 6)) && a17 == 1) || (1 == a7 && a20 == 1)) || ((!(a16 == 6) && a17 <= 0) && a21 == 1)) || ((a17 <= 0 && a21 == 1) && a20 == 1)) || ((a17 == 1 && a21 == 1) && !(13 == a8))) || ((a17 == 1 && a21 == 1) && a20 == 1)) || (((1 == a7 && a21 == 1) && !(13 == a8)) && a16 == 5)) || ((a21 == 1 && a20 == 1) && a16 == 5)) || ((a17 <= 0 && a21 == 1) && !(13 == a8)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 9.6s, OverallIterations: 9, TraceHistogramMax: 5, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 649 SDtfs, 1722 SDslu, 75 SDs, 0 SdLazy, 4105 SolverSat, 714 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1574 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 39 NumberOfFragments, 193 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2083 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 216 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1680 NumberOfCodeBlocks, 1680 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1670 ConstructedInterpolants, 0 QuantifiedInterpolants, 629216 SizeOfPredicates, 1 NumberOfNonLiveVariables, 361 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 793/797 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...