./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label51.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_label51.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 1924a8dde25e8984c73792fdb4b4e419be9487c7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:28,166 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:39:28,169 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:39:28,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:39:28,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:39:28,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:39:28,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:39:28,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:39:28,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:39:28,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:39:28,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:39:28,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:39:28,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:39:28,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:39:28,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:39:28,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:39:28,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:39:28,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:39:28,206 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:39:28,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:39:28,209 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:39:28,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:39:28,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:39:28,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:39:28,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:39:28,223 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:39:28,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:39:28,224 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:39:28,224 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:39:28,226 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:39:28,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:39:28,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:39:28,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:39:28,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:39:28,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:39:28,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:39:28,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:39:28,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:39:28,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:39:28,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:39:28,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:39:28,238 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:28,260 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:39:28,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:39:28,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:39:28,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:39:28,262 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:39:28,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:39:28,263 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:39:28,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:39:28,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:39:28,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:39:28,264 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:39:28,264 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:39:28,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:39:28,264 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:39:28,265 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:39:28,265 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:39:28,265 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:39:28,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:39:28,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:39:28,266 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:39:28,268 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:39:28,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:39:28,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:39:28,269 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:39:28,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:39:28,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:39:28,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:39:28,270 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:39:28,271 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 -> 1924a8dde25e8984c73792fdb4b4e419be9487c7 [2019-11-27 22:39:28,636 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:39:28,662 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:39:28,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:39:28,670 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:39:28,670 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:39:28,673 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label51.c [2019-11-27 22:39:28,748 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f723f445/a9eaa4af5f6246c4802eb5e5586b6622/FLAG0b16d4a43 [2019-11-27 22:39:29,329 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:39:29,330 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label51.c [2019-11-27 22:39:29,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f723f445/a9eaa4af5f6246c4802eb5e5586b6622/FLAG0b16d4a43 [2019-11-27 22:39:29,552 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f723f445/a9eaa4af5f6246c4802eb5e5586b6622 [2019-11-27 22:39:29,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:39:29,557 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:39:29,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:39:29,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:39:29,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:39:29,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:39:29" (1/1) ... [2019-11-27 22:39:29,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b1cb90c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:29, skipping insertion in model container [2019-11-27 22:39:29,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:39:29" (1/1) ... [2019-11-27 22:39:29,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:39:29,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:39:30,118 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:39:30,129 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:39:30,260 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:39:30,281 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:39:30,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:30 WrapperNode [2019-11-27 22:39:30,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:39:30,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:39:30,283 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:39:30,283 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:39:30,292 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:30" (1/1) ... [2019-11-27 22:39:30,317 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:30" (1/1) ... [2019-11-27 22:39:30,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:39:30,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:39:30,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:39:30,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:39:30,404 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:30" (1/1) ... [2019-11-27 22:39:30,404 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:30" (1/1) ... [2019-11-27 22:39:30,411 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:30" (1/1) ... [2019-11-27 22:39:30,414 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:30" (1/1) ... [2019-11-27 22:39:30,437 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:30" (1/1) ... [2019-11-27 22:39:30,449 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:30" (1/1) ... [2019-11-27 22:39:30,457 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:30" (1/1) ... [2019-11-27 22:39:30,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:39:30,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:39:30,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:39:30,468 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:39:30,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:30" (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:30,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:39:30,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:39:31,826 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:39:31,827 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:39:31,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:39:31 BoogieIcfgContainer [2019-11-27 22:39:31,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:39:31,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:39:31,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:39:31,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:39:31,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:39:29" (1/3) ... [2019-11-27 22:39:31,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666c16f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:39:31, skipping insertion in model container [2019-11-27 22:39:31,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:30" (2/3) ... [2019-11-27 22:39:31,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666c16f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:39:31, skipping insertion in model container [2019-11-27 22:39:31,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:39:31" (3/3) ... [2019-11-27 22:39:31,839 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label51.c [2019-11-27 22:39:31,850 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:39:31,858 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:39:31,871 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:39:31,901 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:39:31,902 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:39:31,902 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:39:31,902 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:39:31,903 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:39:31,903 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:39:31,903 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:39:31,903 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:39:31,928 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-27 22:39:31,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-27 22:39:31,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:31,942 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] [2019-11-27 22:39:31,942 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:31,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:31,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1145971337, now seen corresponding path program 1 times [2019-11-27 22:39:31,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:31,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566754866] [2019-11-27 22:39:31,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:32,453 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:32,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566754866] [2019-11-27 22:39:32,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:32,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:39:32,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161283460] [2019-11-27 22:39:32,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:32,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:32,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:32,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:32,489 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-11-27 22:39:33,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:33,386 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-11-27 22:39:33,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:33,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-27 22:39:33,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:33,428 INFO L225 Difference]: With dead ends: 528 [2019-11-27 22:39:33,429 INFO L226 Difference]: Without dead ends: 266 [2019-11-27 22:39:33,440 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:33,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-27 22:39:33,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-11-27 22:39:33,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-27 22:39:33,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-27 22:39:33,546 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 106 [2019-11-27 22:39:33,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:33,547 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-27 22:39:33,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:33,548 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-27 22:39:33,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-27 22:39:33,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:33,559 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:33,560 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:33,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:33,561 INFO L82 PathProgramCache]: Analyzing trace with hash 366337359, now seen corresponding path program 1 times [2019-11-27 22:39:33,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:33,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418537109] [2019-11-27 22:39:33,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:33,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:39:33,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418537109] [2019-11-27 22:39:33,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:33,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:39:33,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360926755] [2019-11-27 22:39:33,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:39:33,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:33,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:39:33,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:33,693 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-27 22:39:34,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:34,355 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2019-11-27 22:39:34,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:34,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-27 22:39:34,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:34,362 INFO L225 Difference]: With dead ends: 792 [2019-11-27 22:39:34,362 INFO L226 Difference]: Without dead ends: 528 [2019-11-27 22:39:34,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:34,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-27 22:39:34,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-11-27 22:39:34,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-27 22:39:34,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 720 transitions. [2019-11-27 22:39:34,389 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 720 transitions. Word has length 111 [2019-11-27 22:39:34,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:34,389 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 720 transitions. [2019-11-27 22:39:34,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:39:34,389 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 720 transitions. [2019-11-27 22:39:34,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-27 22:39:34,392 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:34,392 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:34,393 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:34,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:34,393 INFO L82 PathProgramCache]: Analyzing trace with hash -206300869, now seen corresponding path program 1 times [2019-11-27 22:39:34,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:34,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636623084] [2019-11-27 22:39:34,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:39:34,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636623084] [2019-11-27 22:39:34,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:34,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:39:34,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761227869] [2019-11-27 22:39:34,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:34,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:34,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:34,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:34,457 INFO L87 Difference]: Start difference. First operand 528 states and 720 transitions. Second operand 3 states. [2019-11-27 22:39:34,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:34,961 INFO L93 Difference]: Finished difference Result 1185 states and 1617 transitions. [2019-11-27 22:39:34,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:34,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-11-27 22:39:34,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:34,970 INFO L225 Difference]: With dead ends: 1185 [2019-11-27 22:39:34,971 INFO L226 Difference]: Without dead ends: 659 [2019-11-27 22:39:34,972 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:34,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-27 22:39:34,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 528. [2019-11-27 22:39:34,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-27 22:39:34,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 714 transitions. [2019-11-27 22:39:34,989 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 714 transitions. Word has length 119 [2019-11-27 22:39:34,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:34,990 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 714 transitions. [2019-11-27 22:39:34,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:34,990 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 714 transitions. [2019-11-27 22:39:34,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-27 22:39:34,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:34,993 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:34,993 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:34,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:34,994 INFO L82 PathProgramCache]: Analyzing trace with hash -118652371, now seen corresponding path program 1 times [2019-11-27 22:39:34,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:34,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703864400] [2019-11-27 22:39:34,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:35,058 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-27 22:39:35,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703864400] [2019-11-27 22:39:35,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:35,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:39:35,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36851229] [2019-11-27 22:39:35,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:39:35,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:35,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:39:35,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:35,062 INFO L87 Difference]: Start difference. First operand 528 states and 714 transitions. Second operand 4 states. [2019-11-27 22:39:35,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:35,874 INFO L93 Difference]: Finished difference Result 1971 states and 2669 transitions. [2019-11-27 22:39:35,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:39:35,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-11-27 22:39:35,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:35,883 INFO L225 Difference]: With dead ends: 1971 [2019-11-27 22:39:35,883 INFO L226 Difference]: Without dead ends: 1445 [2019-11-27 22:39:35,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:35,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-27 22:39:35,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1314. [2019-11-27 22:39:35,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-27 22:39:35,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1706 transitions. [2019-11-27 22:39:35,931 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1706 transitions. Word has length 128 [2019-11-27 22:39:35,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:35,932 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1706 transitions. [2019-11-27 22:39:35,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:39:35,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1706 transitions. [2019-11-27 22:39:35,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-27 22:39:35,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:35,937 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:35,937 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:35,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:35,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1007946460, now seen corresponding path program 1 times [2019-11-27 22:39:35,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:35,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010993962] [2019-11-27 22:39:35,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:36,056 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-27 22:39:36,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010993962] [2019-11-27 22:39:36,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:36,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:39:36,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30808803] [2019-11-27 22:39:36,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:39:36,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:36,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:39:36,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:36,059 INFO L87 Difference]: Start difference. First operand 1314 states and 1706 transitions. Second operand 4 states. [2019-11-27 22:39:36,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:36,927 INFO L93 Difference]: Finished difference Result 2762 states and 3564 transitions. [2019-11-27 22:39:36,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:39:36,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-27 22:39:36,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:36,935 INFO L225 Difference]: With dead ends: 2762 [2019-11-27 22:39:36,935 INFO L226 Difference]: Without dead ends: 1450 [2019-11-27 22:39:36,939 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:36,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-11-27 22:39:36,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1445. [2019-11-27 22:39:36,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-27 22:39:36,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1843 transitions. [2019-11-27 22:39:36,982 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1843 transitions. Word has length 134 [2019-11-27 22:39:36,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:36,982 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1843 transitions. [2019-11-27 22:39:36,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:39:36,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1843 transitions. [2019-11-27 22:39:36,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-27 22:39:36,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:36,987 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,987 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:36,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:36,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1361139476, now seen corresponding path program 1 times [2019-11-27 22:39:36,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:36,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086464921] [2019-11-27 22:39:36,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:37,122 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-27 22:39:37,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086464921] [2019-11-27 22:39:37,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:37,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:39:37,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834917985] [2019-11-27 22:39:37,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:39:37,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:37,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:39:37,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:39:37,128 INFO L87 Difference]: Start difference. First operand 1445 states and 1843 transitions. Second operand 5 states. [2019-11-27 22:39:38,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:38,229 INFO L93 Difference]: Finished difference Result 2888 states and 3696 transitions. [2019-11-27 22:39:38,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:39:38,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-11-27 22:39:38,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:38,237 INFO L225 Difference]: With dead ends: 2888 [2019-11-27 22:39:38,238 INFO L226 Difference]: Without dead ends: 1576 [2019-11-27 22:39:38,240 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:38,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-27 22:39:38,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2019-11-27 22:39:38,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-27 22:39:38,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1968 transitions. [2019-11-27 22:39:38,276 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1968 transitions. Word has length 138 [2019-11-27 22:39:38,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:38,277 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1968 transitions. [2019-11-27 22:39:38,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:39:38,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1968 transitions. [2019-11-27 22:39:38,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-27 22:39:38,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:38,281 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,281 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:38,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:38,282 INFO L82 PathProgramCache]: Analyzing trace with hash -892874449, now seen corresponding path program 1 times [2019-11-27 22:39:38,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:38,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099463742] [2019-11-27 22:39:38,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:38,331 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-27 22:39:38,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099463742] [2019-11-27 22:39:38,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:38,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:39:38,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570750278] [2019-11-27 22:39:38,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:38,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:38,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:38,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:38,334 INFO L87 Difference]: Start difference. First operand 1576 states and 1968 transitions. Second operand 3 states. [2019-11-27 22:39:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:38,856 INFO L93 Difference]: Finished difference Result 3674 states and 4634 transitions. [2019-11-27 22:39:38,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:38,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-11-27 22:39:38,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:38,864 INFO L225 Difference]: With dead ends: 3674 [2019-11-27 22:39:38,864 INFO L226 Difference]: Without dead ends: 1969 [2019-11-27 22:39:38,867 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:38,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-27 22:39:38,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2019-11-27 22:39:38,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-27 22:39:38,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1924 transitions. [2019-11-27 22:39:38,906 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1924 transitions. Word has length 141 [2019-11-27 22:39:38,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:38,907 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1924 transitions. [2019-11-27 22:39:38,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:38,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1924 transitions. [2019-11-27 22:39:38,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-27 22:39:38,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:38,912 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,912 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:38,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:38,912 INFO L82 PathProgramCache]: Analyzing trace with hash 468657843, now seen corresponding path program 1 times [2019-11-27 22:39:38,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:38,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209889799] [2019-11-27 22:39:38,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:39:39,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209889799] [2019-11-27 22:39:39,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:39,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:39:39,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625651629] [2019-11-27 22:39:39,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:39:39,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:39,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:39:39,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:39:39,042 INFO L87 Difference]: Start difference. First operand 1707 states and 1924 transitions. Second operand 5 states. [2019-11-27 22:39:40,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:40,131 INFO L93 Difference]: Finished difference Result 4593 states and 5243 transitions. [2019-11-27 22:39:40,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:39:40,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-11-27 22:39:40,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:40,145 INFO L225 Difference]: With dead ends: 4593 [2019-11-27 22:39:40,145 INFO L226 Difference]: Without dead ends: 3019 [2019-11-27 22:39:40,148 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:40,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2019-11-27 22:39:40,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 2493. [2019-11-27 22:39:40,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2493 states. [2019-11-27 22:39:40,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 2762 transitions. [2019-11-27 22:39:40,207 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 2762 transitions. Word has length 156 [2019-11-27 22:39:40,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:40,208 INFO L462 AbstractCegarLoop]: Abstraction has 2493 states and 2762 transitions. [2019-11-27 22:39:40,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:39:40,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 2762 transitions. [2019-11-27 22:39:40,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-27 22:39:40,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:40,215 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,215 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:40,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:40,216 INFO L82 PathProgramCache]: Analyzing trace with hash -779622233, now seen corresponding path program 1 times [2019-11-27 22:39:40,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:40,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049253062] [2019-11-27 22:39:40,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-27 22:39:40,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049253062] [2019-11-27 22:39:40,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:40,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:39:40,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979693031] [2019-11-27 22:39:40,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:39:40,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:40,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:39:40,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:40,383 INFO L87 Difference]: Start difference. First operand 2493 states and 2762 transitions. Second operand 4 states. [2019-11-27 22:39:41,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:41,181 INFO L93 Difference]: Finished difference Result 5508 states and 6131 transitions. [2019-11-27 22:39:41,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:39:41,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-27 22:39:41,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:41,197 INFO L225 Difference]: With dead ends: 5508 [2019-11-27 22:39:41,198 INFO L226 Difference]: Without dead ends: 2886 [2019-11-27 22:39:41,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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:41,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2019-11-27 22:39:41,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2493. [2019-11-27 22:39:41,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2493 states. [2019-11-27 22:39:41,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 2683 transitions. [2019-11-27 22:39:41,279 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 2683 transitions. Word has length 185 [2019-11-27 22:39:41,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:41,280 INFO L462 AbstractCegarLoop]: Abstraction has 2493 states and 2683 transitions. [2019-11-27 22:39:41,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:39:41,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 2683 transitions. [2019-11-27 22:39:41,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-11-27 22:39:41,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:41,293 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,294 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:41,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:41,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1645730410, now seen corresponding path program 1 times [2019-11-27 22:39:41,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:41,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171799304] [2019-11-27 22:39:41,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-11-27 22:39:41,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171799304] [2019-11-27 22:39:41,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:41,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 22:39:41,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73103329] [2019-11-27 22:39:41,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:39:41,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:41,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:39:41,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:39:41,648 INFO L87 Difference]: Start difference. First operand 2493 states and 2683 transitions. Second operand 6 states. [2019-11-27 22:39:42,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:42,656 INFO L93 Difference]: Finished difference Result 5162 states and 5545 transitions. [2019-11-27 22:39:42,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:39:42,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 276 [2019-11-27 22:39:42,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:42,672 INFO L225 Difference]: With dead ends: 5162 [2019-11-27 22:39:42,672 INFO L226 Difference]: Without dead ends: 2671 [2019-11-27 22:39:42,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:39:42,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2019-11-27 22:39:42,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 2362. [2019-11-27 22:39:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2362 states. [2019-11-27 22:39:42,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2529 transitions. [2019-11-27 22:39:42,753 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2529 transitions. Word has length 276 [2019-11-27 22:39:42,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:42,754 INFO L462 AbstractCegarLoop]: Abstraction has 2362 states and 2529 transitions. [2019-11-27 22:39:42,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:39:42,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2529 transitions. [2019-11-27 22:39:42,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-27 22:39:42,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:42,767 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:42,767 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:42,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:42,768 INFO L82 PathProgramCache]: Analyzing trace with hash -731842585, now seen corresponding path program 1 times [2019-11-27 22:39:42,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:42,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678442080] [2019-11-27 22:39:42,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-27 22:39:42,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678442080] [2019-11-27 22:39:42,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:42,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:39:42,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460037466] [2019-11-27 22:39:42,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:42,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:42,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:42,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:42,992 INFO L87 Difference]: Start difference. First operand 2362 states and 2529 transitions. Second operand 3 states. [2019-11-27 22:39:43,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:43,434 INFO L93 Difference]: Finished difference Result 4982 states and 5344 transitions. [2019-11-27 22:39:43,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:43,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-11-27 22:39:43,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:43,435 INFO L225 Difference]: With dead ends: 4982 [2019-11-27 22:39:43,435 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:39:43,440 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:43,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:39:43,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:39:43,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:39:43,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:39:43,440 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 292 [2019-11-27 22:39:43,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:43,444 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:39:43,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:43,444 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:39:43,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:39:43,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:39:43,728 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-11-27 22:39:43,931 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-11-27 22:39:43,936 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-27 22:39:43,936 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-27 22:39:43,936 INFO L246 CegarLoopResult]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,937 INFO L246 CegarLoopResult]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,937 INFO L246 CegarLoopResult]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,937 INFO L246 CegarLoopResult]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,937 INFO L246 CegarLoopResult]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,937 INFO L246 CegarLoopResult]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,937 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-27 22:39:43,937 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-27 22:39:43,937 INFO L246 CegarLoopResult]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-27 22:39:43,937 INFO L246 CegarLoopResult]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-27 22:39:43,937 INFO L246 CegarLoopResult]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-27 22:39:43,938 INFO L246 CegarLoopResult]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-27 22:39:43,938 INFO L246 CegarLoopResult]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-27 22:39:43,938 INFO L246 CegarLoopResult]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-27 22:39:43,939 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-27 22:39:43,939 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-27 22:39:43,939 INFO L246 CegarLoopResult]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,939 INFO L246 CegarLoopResult]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,939 INFO L246 CegarLoopResult]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,939 INFO L246 CegarLoopResult]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,939 INFO L246 CegarLoopResult]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,939 INFO L246 CegarLoopResult]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,939 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-27 22:39:43,940 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-27 22:39:43,940 INFO L246 CegarLoopResult]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-27 22:39:43,940 INFO L246 CegarLoopResult]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-27 22:39:43,940 INFO L246 CegarLoopResult]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-27 22:39:43,940 INFO L246 CegarLoopResult]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-27 22:39:43,940 INFO L246 CegarLoopResult]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-27 22:39:43,940 INFO L246 CegarLoopResult]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-27 22:39:43,940 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-27 22:39:43,941 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-27 22:39:43,943 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-27 22:39:43,944 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-27 22:39:43,944 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-27 22:39:43,944 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-27 22:39:43,944 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-27 22:39:43,944 INFO L246 CegarLoopResult]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,944 INFO L246 CegarLoopResult]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,944 INFO L246 CegarLoopResult]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,945 INFO L246 CegarLoopResult]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,945 INFO L246 CegarLoopResult]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,945 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-27 22:39:43,945 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-27 22:39:43,946 INFO L246 CegarLoopResult]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-27 22:39:43,946 INFO L246 CegarLoopResult]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-27 22:39:43,950 INFO L246 CegarLoopResult]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-27 22:39:43,950 INFO L246 CegarLoopResult]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-27 22:39:43,950 INFO L246 CegarLoopResult]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-27 22:39:43,951 INFO L246 CegarLoopResult]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-27 22:39:43,952 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-27 22:39:43,952 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse5 (= ~a17~0 1))) (let ((.cse4 (= ~a16~0 6)) (.cse6 (not (= ~a20~0 1))) (.cse0 (= ~a16~0 4)) (.cse3 (not .cse5)) (.cse1 (<= ~a17~0 0)) (.cse2 (= 15 ~a8~0)) (.cse7 (= ~a16~0 5))) (or (and .cse0 .cse1) (= 1 ~a7~0) (and .cse2 .cse3 .cse4) (and .cse5 (= ~a21~0 1)) (and .cse6 .cse7) (and .cse6 .cse2 .cse4) (and .cse6 .cse0 .cse3) (and .cse1 .cse2 .cse7)))) [2019-11-27 22:39:43,952 INFO L246 CegarLoopResult]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,953 INFO L246 CegarLoopResult]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,953 INFO L246 CegarLoopResult]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,953 INFO L246 CegarLoopResult]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,953 INFO L246 CegarLoopResult]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,953 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-27 22:39:43,954 INFO L246 CegarLoopResult]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-27 22:39:43,954 INFO L246 CegarLoopResult]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-27 22:39:43,954 INFO L246 CegarLoopResult]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-27 22:39:43,954 INFO L246 CegarLoopResult]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-27 22:39:43,954 INFO L246 CegarLoopResult]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-27 22:39:43,954 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-27 22:39:43,955 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-27 22:39:43,955 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-27 22:39:43,955 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-27 22:39:43,955 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-27 22:39:43,955 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-27 22:39:43,956 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-27 22:39:43,956 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-27 22:39:43,956 INFO L246 CegarLoopResult]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,956 INFO L246 CegarLoopResult]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,956 INFO L246 CegarLoopResult]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,957 INFO L246 CegarLoopResult]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,957 INFO L246 CegarLoopResult]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,957 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-27 22:39:43,957 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-27 22:39:43,957 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-27 22:39:43,958 INFO L246 CegarLoopResult]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-27 22:39:43,958 INFO L246 CegarLoopResult]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-27 22:39:43,958 INFO L246 CegarLoopResult]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-27 22:39:43,960 INFO L246 CegarLoopResult]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-27 22:39:43,960 INFO L246 CegarLoopResult]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-27 22:39:43,961 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-27 22:39:43,961 INFO L246 CegarLoopResult]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,961 INFO L246 CegarLoopResult]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,961 INFO L246 CegarLoopResult]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,961 INFO L246 CegarLoopResult]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,962 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-27 22:39:43,962 INFO L246 CegarLoopResult]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,962 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-27 22:39:43,962 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-27 22:39:43,962 INFO L246 CegarLoopResult]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-27 22:39:43,963 INFO L246 CegarLoopResult]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-27 22:39:43,964 INFO L246 CegarLoopResult]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-27 22:39:43,964 INFO L246 CegarLoopResult]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-27 22:39:43,964 INFO L246 CegarLoopResult]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-27 22:39:43,965 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:39:43,965 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-27 22:39:43,965 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-27 22:39:43,965 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-27 22:39:43,965 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-27 22:39:43,966 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-27 22:39:43,966 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-27 22:39:43,966 INFO L246 CegarLoopResult]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,966 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse5 (= ~a17~0 1))) (let ((.cse4 (= ~a16~0 6)) (.cse6 (not (= ~a20~0 1))) (.cse0 (= ~a16~0 4)) (.cse3 (not .cse5)) (.cse1 (<= ~a17~0 0)) (.cse2 (= 15 ~a8~0)) (.cse7 (= ~a16~0 5))) (or (and .cse0 .cse1) (= 1 ~a7~0) (and .cse2 .cse3 .cse4) (and .cse5 (= ~a21~0 1)) (and .cse6 .cse7) (and .cse6 .cse2 .cse4) (and .cse6 .cse0 .cse3) (and .cse1 .cse2 .cse7)))) [2019-11-27 22:39:43,967 INFO L246 CegarLoopResult]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,967 INFO L246 CegarLoopResult]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,967 INFO L246 CegarLoopResult]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,967 INFO L246 CegarLoopResult]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,967 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-27 22:39:43,968 INFO L246 CegarLoopResult]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-27 22:39:43,968 INFO L246 CegarLoopResult]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-27 22:39:43,968 INFO L246 CegarLoopResult]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-27 22:39:43,968 INFO L246 CegarLoopResult]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-27 22:39:43,968 INFO L246 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-27 22:39:43,969 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-27 22:39:43,969 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-27 22:39:43,969 INFO L246 CegarLoopResult]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,969 INFO L246 CegarLoopResult]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,970 INFO L246 CegarLoopResult]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,970 INFO L246 CegarLoopResult]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,970 INFO L246 CegarLoopResult]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,970 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-27 22:39:43,970 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:39:43,971 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-27 22:39:43,971 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-27 22:39:43,971 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-27 22:39:43,971 INFO L246 CegarLoopResult]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-27 22:39:43,971 INFO L246 CegarLoopResult]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-27 22:39:43,972 INFO L246 CegarLoopResult]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-27 22:39:43,972 INFO L246 CegarLoopResult]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-27 22:39:43,972 INFO L246 CegarLoopResult]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-27 22:39:43,972 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-27 22:39:43,973 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-27 22:39:43,973 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-27 22:39:43,973 INFO L246 CegarLoopResult]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,973 INFO L246 CegarLoopResult]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,973 INFO L246 CegarLoopResult]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,974 INFO L246 CegarLoopResult]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,974 INFO L246 CegarLoopResult]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-27 22:39:43,974 INFO L246 CegarLoopResult]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,974 INFO L246 CegarLoopResult]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,974 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-27 22:39:43,975 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-27 22:39:43,975 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:39:43,975 INFO L246 CegarLoopResult]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-27 22:39:43,975 INFO L246 CegarLoopResult]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-27 22:39:43,975 INFO L246 CegarLoopResult]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-27 22:39:43,976 INFO L246 CegarLoopResult]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-27 22:39:43,976 INFO L246 CegarLoopResult]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-27 22:39:43,976 INFO L246 CegarLoopResult]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-27 22:39:43,976 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-27 22:39:43,976 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-27 22:39:43,977 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-27 22:39:43,977 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-27 22:39:43,977 INFO L246 CegarLoopResult]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,977 INFO L246 CegarLoopResult]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,977 INFO L246 CegarLoopResult]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,977 INFO L246 CegarLoopResult]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,978 INFO L246 CegarLoopResult]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,978 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-27 22:39:43,978 INFO L246 CegarLoopResult]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,978 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-27 22:39:43,978 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-27 22:39:43,979 INFO L246 CegarLoopResult]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-27 22:39:43,979 INFO L246 CegarLoopResult]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-27 22:39:43,979 INFO L246 CegarLoopResult]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-27 22:39:43,979 INFO L246 CegarLoopResult]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-27 22:39:43,979 INFO L246 CegarLoopResult]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-27 22:39:43,979 INFO L246 CegarLoopResult]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-27 22:39:43,979 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-27 22:39:43,980 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-27 22:39:43,980 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-27 22:39:43,980 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 22:39:43,980 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 494) no Hoare annotation was computed. [2019-11-27 22:39:43,980 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-27 22:39:43,981 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-27 22:39:43,981 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-27 22:39:43,981 INFO L246 CegarLoopResult]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,981 INFO L246 CegarLoopResult]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,981 INFO L246 CegarLoopResult]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,981 INFO L246 CegarLoopResult]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,982 INFO L246 CegarLoopResult]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,982 INFO L246 CegarLoopResult]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:43,982 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-27 22:39:43,982 INFO L246 CegarLoopResult]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-27 22:39:43,982 INFO L246 CegarLoopResult]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-27 22:39:43,982 INFO L246 CegarLoopResult]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-27 22:39:43,983 INFO L246 CegarLoopResult]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-27 22:39:43,983 INFO L246 CegarLoopResult]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-27 22:39:43,983 INFO L246 CegarLoopResult]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-27 22:39:43,983 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-27 22:39:43,983 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-27 22:39:43,983 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-27 22:39:44,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:39:44 BoogieIcfgContainer [2019-11-27 22:39:44,043 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:39:44,044 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:39:44,044 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:39:44,044 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:39:44,045 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:31" (3/4) ... [2019-11-27 22:39:44,050 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:39:44,084 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:39:44,086 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:39:44,315 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:39:44,315 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:39:44,317 INFO L168 Benchmark]: Toolchain (without parser) took 14760.14 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 402.1 MB). Free memory was 956.3 MB in the beginning and 900.6 MB in the end (delta: 55.7 MB). Peak memory consumption was 457.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:44,317 INFO L168 Benchmark]: CDTParser took 0.41 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:44,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 723.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -127.2 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:44,319 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:44,319 INFO L168 Benchmark]: Boogie Preprocessor took 74.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:44,320 INFO L168 Benchmark]: RCFGBuilder took 1361.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 967.5 MB in the end (delta: 102.2 MB). Peak memory consumption was 102.2 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:44,320 INFO L168 Benchmark]: TraceAbstraction took 12213.05 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 290.5 MB). Free memory was 967.5 MB in the beginning and 912.8 MB in the end (delta: 54.7 MB). Peak memory consumption was 345.2 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:44,321 INFO L168 Benchmark]: Witness Printer took 271.59 ms. Allocated memory is still 1.4 GB. Free memory was 912.8 MB in the beginning and 900.6 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:44,323 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.41 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 723.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -127.2 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 110.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1361.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 967.5 MB in the end (delta: 102.2 MB). Peak memory consumption was 102.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12213.05 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 290.5 MB). Free memory was 967.5 MB in the beginning and 912.8 MB in the end (delta: 54.7 MB). Peak memory consumption was 345.2 MB. Max. memory is 11.5 GB. * Witness Printer took 271.59 ms. Allocated memory is still 1.4 GB. Free memory was 912.8 MB in the beginning and 900.6 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 494]: 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: (((((((a16 == 4 && a17 <= 0) || 1 == a7) || ((15 == a8 && !(a17 == 1)) && a16 == 6)) || (a17 == 1 && a21 == 1)) || (!(a20 == 1) && a16 == 5)) || ((!(a20 == 1) && 15 == a8) && a16 == 6)) || ((!(a20 == 1) && a16 == 4) && !(a17 == 1))) || ((a17 <= 0 && 15 == a8) && a16 == 5) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((a16 == 4 && a17 <= 0) || 1 == a7) || ((15 == a8 && !(a17 == 1)) && a16 == 6)) || (a17 == 1 && a21 == 1)) || (!(a20 == 1) && a16 == 5)) || ((!(a20 == 1) && 15 == a8) && a16 == 6)) || ((!(a20 == 1) && a16 == 4) && !(a17 == 1))) || ((a17 <= 0 && 15 == a8) && a16 == 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 11.5s, OverallIterations: 11, TraceHistogramMax: 7, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 1027 SDtfs, 2372 SDslu, 126 SDs, 0 SdLazy, 5885 SolverSat, 828 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2493occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 1757 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 51 NumberOfFragments, 141 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5203 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 208 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1786 NumberOfCodeBlocks, 1786 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1775 ConstructedInterpolants, 0 QuantifiedInterpolants, 611684 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 1139/1139 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...