./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label42.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label42.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a8726e54e507f4e5407a6f1ab8a73f56b359228a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:40:22,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:40:22,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:40:22,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:40:22,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:40:22,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:40:22,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:40:22,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:40:22,361 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:40:22,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:40:22,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:40:22,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:40:22,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:40:22,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:40:22,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:40:22,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:40:22,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:40:22,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:40:22,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:40:22,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:40:22,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:40:22,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:40:22,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:40:22,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:40:22,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:40:22,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:40:22,384 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:40:22,385 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:40:22,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:40:22,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:40:22,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:40:22,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:40:22,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:40:22,390 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:40:22,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:40:22,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:40:22,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:40:22,393 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:40:22,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:40:22,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:40:22,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:40:22,396 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:40:22,411 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:40:22,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:40:22,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:40:22,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:40:22,414 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:40:22,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:40:22,414 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:40:22,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:40:22,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:40:22,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:40:22,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:40:22,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:40:22,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:40:22,416 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:40:22,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:40:22,417 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:40:22,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:40:22,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:40:22,418 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:40:22,418 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:40:22,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:40:22,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:40:22,419 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:40:22,419 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:40:22,419 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:40:22,420 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:40:22,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:40:22,420 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:40:22,421 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 -> a8726e54e507f4e5407a6f1ab8a73f56b359228a [2019-11-27 22:40:22,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:40:22,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:40:22,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:40:22,765 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:40:22,766 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:40:22,766 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label42.c [2019-11-27 22:40:22,844 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d8968d73/42237101eaef4928a1361cf2e93469dc/FLAG5d9f4bb0c [2019-11-27 22:40:23,441 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:40:23,442 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label42.c [2019-11-27 22:40:23,469 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d8968d73/42237101eaef4928a1361cf2e93469dc/FLAG5d9f4bb0c [2019-11-27 22:40:23,763 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d8968d73/42237101eaef4928a1361cf2e93469dc [2019-11-27 22:40:23,766 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:40:23,768 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:40:23,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:40:23,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:40:23,772 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:40:23,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:40:23" (1/1) ... [2019-11-27 22:40:23,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33138635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:23, skipping insertion in model container [2019-11-27 22:40:23,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:40:23" (1/1) ... [2019-11-27 22:40:23,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:40:23,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:40:24,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:40:24,346 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:40:24,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:40:24,454 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:40:24,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:24 WrapperNode [2019-11-27 22:40:24,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:40:24,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:40:24,458 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:40:24,458 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:40:24,465 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:40:24" (1/1) ... [2019-11-27 22:40:24,482 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:40:24" (1/1) ... [2019-11-27 22:40:24,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:40:24,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:40:24,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:40:24,546 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:40:24,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:24" (1/1) ... [2019-11-27 22:40:24,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:24" (1/1) ... [2019-11-27 22:40:24,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:24" (1/1) ... [2019-11-27 22:40:24,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:24" (1/1) ... [2019-11-27 22:40:24,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:24" (1/1) ... [2019-11-27 22:40:24,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:24" (1/1) ... [2019-11-27 22:40:24,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:24" (1/1) ... [2019-11-27 22:40:24,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:40:24,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:40:24,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:40:24,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:40:24,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:24" (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:40:24,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:40:24,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:40:25,900 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:40:25,900 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:40:25,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:40:25 BoogieIcfgContainer [2019-11-27 22:40:25,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:40:25,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:40:25,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:40:25,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:40:25,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:40:23" (1/3) ... [2019-11-27 22:40:25,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b65964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:40:25, skipping insertion in model container [2019-11-27 22:40:25,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:24" (2/3) ... [2019-11-27 22:40:25,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b65964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:40:25, skipping insertion in model container [2019-11-27 22:40:25,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:40:25" (3/3) ... [2019-11-27 22:40:25,912 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label42.c [2019-11-27 22:40:25,923 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:40:25,931 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:40:25,943 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:40:25,975 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:40:25,975 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:40:25,976 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:40:25,976 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:40:25,976 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:40:25,976 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:40:25,976 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:40:25,977 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:40:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-11-27 22:40:26,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-27 22:40:26,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:26,025 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] [2019-11-27 22:40:26,026 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:26,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:26,033 INFO L82 PathProgramCache]: Analyzing trace with hash 499493077, now seen corresponding path program 1 times [2019-11-27 22:40:26,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:26,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719525361] [2019-11-27 22:40:26,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:26,468 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:40:26,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719525361] [2019-11-27 22:40:26,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:26,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:40:26,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334743383] [2019-11-27 22:40:26,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:40:26,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:26,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:40:26,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:26,496 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-11-27 22:40:28,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:28,110 INFO L93 Difference]: Finished difference Result 748 states and 1324 transitions. [2019-11-27 22:40:28,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:40:28,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-27 22:40:28,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:28,133 INFO L225 Difference]: With dead ends: 748 [2019-11-27 22:40:28,133 INFO L226 Difference]: Without dead ends: 454 [2019-11-27 22:40:28,139 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:40:28,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-27 22:40:28,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 451. [2019-11-27 22:40:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-11-27 22:40:28,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 616 transitions. [2019-11-27 22:40:28,219 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 616 transitions. Word has length 100 [2019-11-27 22:40:28,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:28,220 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 616 transitions. [2019-11-27 22:40:28,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:40:28,221 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 616 transitions. [2019-11-27 22:40:28,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-27 22:40:28,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:28,227 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:40:28,228 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:28,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:28,229 INFO L82 PathProgramCache]: Analyzing trace with hash 396760741, now seen corresponding path program 1 times [2019-11-27 22:40:28,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:28,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259702697] [2019-11-27 22:40:28,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:40:28,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259702697] [2019-11-27 22:40:28,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:28,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:40:28,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002917106] [2019-11-27 22:40:28,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:40:28,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:28,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:40:28,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:40:28,310 INFO L87 Difference]: Start difference. First operand 451 states and 616 transitions. Second operand 3 states. [2019-11-27 22:40:28,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:28,822 INFO L93 Difference]: Finished difference Result 1323 states and 1809 transitions. [2019-11-27 22:40:28,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:28,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-27 22:40:28,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:28,828 INFO L225 Difference]: With dead ends: 1323 [2019-11-27 22:40:28,829 INFO L226 Difference]: Without dead ends: 874 [2019-11-27 22:40:28,831 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:40:28,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-11-27 22:40:28,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2019-11-27 22:40:28,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2019-11-27 22:40:28,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1139 transitions. [2019-11-27 22:40:28,878 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1139 transitions. Word has length 117 [2019-11-27 22:40:28,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:28,878 INFO L462 AbstractCegarLoop]: Abstraction has 874 states and 1139 transitions. [2019-11-27 22:40:28,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:40:28,879 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1139 transitions. [2019-11-27 22:40:28,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-27 22:40:28,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:28,889 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:28,891 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:28,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:28,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1844290899, now seen corresponding path program 1 times [2019-11-27 22:40:28,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:28,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534880938] [2019-11-27 22:40:28,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:40:29,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534880938] [2019-11-27 22:40:29,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:29,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:40:29,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201009113] [2019-11-27 22:40:29,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:40:29,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:29,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:40:29,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:29,091 INFO L87 Difference]: Start difference. First operand 874 states and 1139 transitions. Second operand 4 states. [2019-11-27 22:40:29,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:29,679 INFO L93 Difference]: Finished difference Result 2154 states and 2796 transitions. [2019-11-27 22:40:29,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:40:29,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-11-27 22:40:29,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:29,690 INFO L225 Difference]: With dead ends: 2154 [2019-11-27 22:40:29,691 INFO L226 Difference]: Without dead ends: 1282 [2019-11-27 22:40:29,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:29,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2019-11-27 22:40:29,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 862. [2019-11-27 22:40:29,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2019-11-27 22:40:29,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1063 transitions. [2019-11-27 22:40:29,727 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1063 transitions. Word has length 133 [2019-11-27 22:40:29,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:29,730 INFO L462 AbstractCegarLoop]: Abstraction has 862 states and 1063 transitions. [2019-11-27 22:40:29,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:40:29,731 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1063 transitions. [2019-11-27 22:40:29,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-27 22:40:29,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:29,746 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:40:29,747 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:29,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:29,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1961644753, now seen corresponding path program 1 times [2019-11-27 22:40:29,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:29,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814032271] [2019-11-27 22:40:29,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:29,835 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-27 22:40:29,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814032271] [2019-11-27 22:40:29,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:29,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:40:29,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294786057] [2019-11-27 22:40:29,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:40:29,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:29,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:40:29,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:40:29,840 INFO L87 Difference]: Start difference. First operand 862 states and 1063 transitions. Second operand 3 states. [2019-11-27 22:40:30,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:30,476 INFO L93 Difference]: Finished difference Result 2286 states and 2790 transitions. [2019-11-27 22:40:30,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:30,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-11-27 22:40:30,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:30,488 INFO L225 Difference]: With dead ends: 2286 [2019-11-27 22:40:30,488 INFO L226 Difference]: Without dead ends: 1426 [2019-11-27 22:40:30,491 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:40:30,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2019-11-27 22:40:30,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1143. [2019-11-27 22:40:30,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1143 states. [2019-11-27 22:40:30,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1399 transitions. [2019-11-27 22:40:30,541 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1399 transitions. Word has length 139 [2019-11-27 22:40:30,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:30,541 INFO L462 AbstractCegarLoop]: Abstraction has 1143 states and 1399 transitions. [2019-11-27 22:40:30,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:40:30,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1399 transitions. [2019-11-27 22:40:30,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-27 22:40:30,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:30,545 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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] [2019-11-27 22:40:30,545 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:30,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:30,546 INFO L82 PathProgramCache]: Analyzing trace with hash -435160690, now seen corresponding path program 1 times [2019-11-27 22:40:30,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:30,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361911221] [2019-11-27 22:40:30,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-27 22:40:30,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361911221] [2019-11-27 22:40:30,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:30,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:40:30,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102056893] [2019-11-27 22:40:30,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:40:30,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:30,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:40:30,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:40:30,669 INFO L87 Difference]: Start difference. First operand 1143 states and 1399 transitions. Second operand 3 states. [2019-11-27 22:40:31,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:31,157 INFO L93 Difference]: Finished difference Result 2566 states and 3148 transitions. [2019-11-27 22:40:31,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:31,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-11-27 22:40:31,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:31,166 INFO L225 Difference]: With dead ends: 2566 [2019-11-27 22:40:31,166 INFO L226 Difference]: Without dead ends: 1425 [2019-11-27 22:40:31,168 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:40:31,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2019-11-27 22:40:31,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1423. [2019-11-27 22:40:31,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2019-11-27 22:40:31,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1704 transitions. [2019-11-27 22:40:31,202 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1704 transitions. Word has length 144 [2019-11-27 22:40:31,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:31,203 INFO L462 AbstractCegarLoop]: Abstraction has 1423 states and 1704 transitions. [2019-11-27 22:40:31,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:40:31,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1704 transitions. [2019-11-27 22:40:31,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-27 22:40:31,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:31,208 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-27 22:40:31,208 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:31,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:31,209 INFO L82 PathProgramCache]: Analyzing trace with hash -266021720, now seen corresponding path program 1 times [2019-11-27 22:40:31,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:31,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869589651] [2019-11-27 22:40:31,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:31,282 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-27 22:40:31,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869589651] [2019-11-27 22:40:31,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:31,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:40:31,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170711187] [2019-11-27 22:40:31,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:40:31,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:31,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:40:31,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:31,285 INFO L87 Difference]: Start difference. First operand 1423 states and 1704 transitions. Second operand 4 states. [2019-11-27 22:40:32,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:32,080 INFO L93 Difference]: Finished difference Result 3404 states and 4091 transitions. [2019-11-27 22:40:32,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:40:32,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-11-27 22:40:32,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:32,088 INFO L225 Difference]: With dead ends: 3404 [2019-11-27 22:40:32,088 INFO L226 Difference]: Without dead ends: 1700 [2019-11-27 22:40:32,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:32,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-11-27 22:40:32,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1560. [2019-11-27 22:40:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-11-27 22:40:32,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 1725 transitions. [2019-11-27 22:40:32,119 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 1725 transitions. Word has length 146 [2019-11-27 22:40:32,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:32,120 INFO L462 AbstractCegarLoop]: Abstraction has 1560 states and 1725 transitions. [2019-11-27 22:40:32,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:40:32,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1725 transitions. [2019-11-27 22:40:32,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-27 22:40:32,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:32,123 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-27 22:40:32,123 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:32,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:32,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1950870258, now seen corresponding path program 1 times [2019-11-27 22:40:32,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:32,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032999773] [2019-11-27 22:40:32,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:32,277 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 62 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-27 22:40:32,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032999773] [2019-11-27 22:40:32,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520694181] [2019-11-27 22:40:32,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:40:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:32,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:40:32,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:40:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-27 22:40:32,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:40:32,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-27 22:40:32,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304616886] [2019-11-27 22:40:32,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:40:32,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:32,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:40:32,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:40:32,453 INFO L87 Difference]: Start difference. First operand 1560 states and 1725 transitions. Second operand 3 states. [2019-11-27 22:40:32,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:32,912 INFO L93 Difference]: Finished difference Result 3397 states and 3747 transitions. [2019-11-27 22:40:32,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:32,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-27 22:40:32,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:32,920 INFO L225 Difference]: With dead ends: 3397 [2019-11-27 22:40:32,921 INFO L226 Difference]: Without dead ends: 1697 [2019-11-27 22:40:32,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:40:32,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2019-11-27 22:40:32,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1695. [2019-11-27 22:40:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1695 states. [2019-11-27 22:40:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 1803 transitions. [2019-11-27 22:40:32,954 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 1803 transitions. Word has length 150 [2019-11-27 22:40:32,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:32,954 INFO L462 AbstractCegarLoop]: Abstraction has 1695 states and 1803 transitions. [2019-11-27 22:40:32,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:40:32,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 1803 transitions. [2019-11-27 22:40:32,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-27 22:40:32,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:32,959 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-11-27 22:40:33,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:40:33,165 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:33,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:33,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1731681118, now seen corresponding path program 1 times [2019-11-27 22:40:33,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:33,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863860100] [2019-11-27 22:40:33,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:33,333 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 78 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-27 22:40:33,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863860100] [2019-11-27 22:40:33,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004650905] [2019-11-27 22:40:33,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:40:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:33,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:40:33,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:40:33,510 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-27 22:40:33,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:40:33,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2019-11-27 22:40:33,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784557256] [2019-11-27 22:40:33,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:40:33,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:33,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:40:33,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:40:33,517 INFO L87 Difference]: Start difference. First operand 1695 states and 1803 transitions. Second operand 3 states. [2019-11-27 22:40:34,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:34,021 INFO L93 Difference]: Finished difference Result 4518 states and 4819 transitions. [2019-11-27 22:40:34,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:34,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-11-27 22:40:34,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:34,036 INFO L225 Difference]: With dead ends: 4518 [2019-11-27 22:40:34,036 INFO L226 Difference]: Without dead ends: 2965 [2019-11-27 22:40:34,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:40:34,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2019-11-27 22:40:34,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2965. [2019-11-27 22:40:34,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2965 states. [2019-11-27 22:40:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3160 transitions. [2019-11-27 22:40:34,113 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 3160 transitions. Word has length 168 [2019-11-27 22:40:34,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:34,114 INFO L462 AbstractCegarLoop]: Abstraction has 2965 states and 3160 transitions. [2019-11-27 22:40:34,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:40:34,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 3160 transitions. [2019-11-27 22:40:34,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-27 22:40:34,121 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:34,122 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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] [2019-11-27 22:40:34,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:40:34,327 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:34,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:34,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1863728915, now seen corresponding path program 1 times [2019-11-27 22:40:34,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:34,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196050241] [2019-11-27 22:40:34,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:34,400 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-27 22:40:34,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196050241] [2019-11-27 22:40:34,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:34,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:40:34,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671094987] [2019-11-27 22:40:34,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:40:34,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:34,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:40:34,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:40:34,405 INFO L87 Difference]: Start difference. First operand 2965 states and 3160 transitions. Second operand 3 states. [2019-11-27 22:40:34,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:34,922 INFO L93 Difference]: Finished difference Result 4660 states and 4962 transitions. [2019-11-27 22:40:34,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:34,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-27 22:40:34,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:34,941 INFO L225 Difference]: With dead ends: 4660 [2019-11-27 22:40:34,942 INFO L226 Difference]: Without dead ends: 2965 [2019-11-27 22:40:34,946 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:40:34,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2019-11-27 22:40:35,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2825. [2019-11-27 22:40:35,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2825 states. [2019-11-27 22:40:35,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3011 transitions. [2019-11-27 22:40:35,014 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3011 transitions. Word has length 172 [2019-11-27 22:40:35,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:35,015 INFO L462 AbstractCegarLoop]: Abstraction has 2825 states and 3011 transitions. [2019-11-27 22:40:35,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:40:35,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3011 transitions. [2019-11-27 22:40:35,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-27 22:40:35,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:35,025 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-27 22:40:35,026 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:35,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:35,026 INFO L82 PathProgramCache]: Analyzing trace with hash 927349297, now seen corresponding path program 1 times [2019-11-27 22:40:35,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:35,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730713178] [2019-11-27 22:40:35,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:35,135 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-27 22:40:35,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730713178] [2019-11-27 22:40:35,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:35,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:40:35,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453269179] [2019-11-27 22:40:35,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:40:35,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:35,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:40:35,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:40:35,138 INFO L87 Difference]: Start difference. First operand 2825 states and 3011 transitions. Second operand 3 states. [2019-11-27 22:40:35,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:35,590 INFO L93 Difference]: Finished difference Result 3665 states and 3891 transitions. [2019-11-27 22:40:35,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:35,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-27 22:40:35,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:35,591 INFO L225 Difference]: With dead ends: 3665 [2019-11-27 22:40:35,591 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:40:35,595 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:40:35,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:40:35,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:40:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:40:35,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:40:35,596 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 193 [2019-11-27 22:40:35,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:35,596 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:40:35,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:40:35,597 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:40:35,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:40:35,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:40:36,039 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-11-27 22:40:36,314 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-11-27 22:40:36,318 INFO L246 CegarLoopResult]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,318 INFO L246 CegarLoopResult]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,318 INFO L246 CegarLoopResult]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,318 INFO L246 CegarLoopResult]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-27 22:40:36,318 INFO L246 CegarLoopResult]: For program point L565(line 565) no Hoare annotation was computed. [2019-11-27 22:40:36,319 INFO L246 CegarLoopResult]: For program point L499(line 499) no Hoare annotation was computed. [2019-11-27 22:40:36,322 INFO L246 CegarLoopResult]: For program point L433(line 433) no Hoare annotation was computed. [2019-11-27 22:40:36,322 INFO L246 CegarLoopResult]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-27 22:40:36,322 INFO L246 CegarLoopResult]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-27 22:40:36,323 INFO L246 CegarLoopResult]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-27 22:40:36,323 INFO L246 CegarLoopResult]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,323 INFO L246 CegarLoopResult]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,323 INFO L246 CegarLoopResult]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,323 INFO L246 CegarLoopResult]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-27 22:40:36,323 INFO L246 CegarLoopResult]: For program point L568(line 568) no Hoare annotation was computed. [2019-11-27 22:40:36,323 INFO L246 CegarLoopResult]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-27 22:40:36,324 INFO L246 CegarLoopResult]: For program point L436(line 436) no Hoare annotation was computed. [2019-11-27 22:40:36,324 INFO L246 CegarLoopResult]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-11-27 22:40:36,324 INFO L246 CegarLoopResult]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-11-27 22:40:36,324 INFO L246 CegarLoopResult]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-27 22:40:36,324 INFO L246 CegarLoopResult]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,324 INFO L246 CegarLoopResult]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,324 INFO L246 CegarLoopResult]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,325 INFO L246 CegarLoopResult]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-27 22:40:36,325 INFO L246 CegarLoopResult]: For program point L571(line 571) no Hoare annotation was computed. [2019-11-27 22:40:36,325 INFO L246 CegarLoopResult]: For program point L505(line 505) no Hoare annotation was computed. [2019-11-27 22:40:36,325 INFO L246 CegarLoopResult]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-27 22:40:36,325 INFO L246 CegarLoopResult]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-27 22:40:36,326 INFO L246 CegarLoopResult]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,326 INFO L246 CegarLoopResult]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,326 INFO L246 CegarLoopResult]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,326 INFO L246 CegarLoopResult]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-27 22:40:36,326 INFO L246 CegarLoopResult]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-27 22:40:36,326 INFO L246 CegarLoopResult]: For program point L574(line 574) no Hoare annotation was computed. [2019-11-27 22:40:36,326 INFO L246 CegarLoopResult]: For program point L508(line 508) no Hoare annotation was computed. [2019-11-27 22:40:36,326 INFO L246 CegarLoopResult]: For program point L442(line 442) no Hoare annotation was computed. [2019-11-27 22:40:36,326 INFO L246 CegarLoopResult]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-27 22:40:36,327 INFO L246 CegarLoopResult]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-27 22:40:36,327 INFO L246 CegarLoopResult]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-27 22:40:36,327 INFO L246 CegarLoopResult]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,327 INFO L246 CegarLoopResult]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,327 INFO L246 CegarLoopResult]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,327 INFO L246 CegarLoopResult]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-27 22:40:36,327 INFO L246 CegarLoopResult]: For program point L577(line 577) no Hoare annotation was computed. [2019-11-27 22:40:36,327 INFO L246 CegarLoopResult]: For program point L511(line 511) no Hoare annotation was computed. [2019-11-27 22:40:36,327 INFO L246 CegarLoopResult]: For program point L445(line 445) no Hoare annotation was computed. [2019-11-27 22:40:36,328 INFO L246 CegarLoopResult]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-27 22:40:36,328 INFO L246 CegarLoopResult]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-27 22:40:36,328 INFO L246 CegarLoopResult]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-27 22:40:36,328 INFO L246 CegarLoopResult]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-27 22:40:36,328 INFO L246 CegarLoopResult]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,328 INFO L246 CegarLoopResult]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,328 INFO L246 CegarLoopResult]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,328 INFO L246 CegarLoopResult]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-11-27 22:40:36,328 INFO L246 CegarLoopResult]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-11-27 22:40:36,329 INFO L246 CegarLoopResult]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-11-27 22:40:36,329 INFO L246 CegarLoopResult]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-11-27 22:40:36,329 INFO L246 CegarLoopResult]: For program point L580(line 580) no Hoare annotation was computed. [2019-11-27 22:40:36,329 INFO L246 CegarLoopResult]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-27 22:40:36,329 INFO L246 CegarLoopResult]: For program point L448(line 448) no Hoare annotation was computed. [2019-11-27 22:40:36,329 INFO L246 CegarLoopResult]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-27 22:40:36,329 INFO L246 CegarLoopResult]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-27 22:40:36,329 INFO L246 CegarLoopResult]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,329 INFO L246 CegarLoopResult]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,330 INFO L246 CegarLoopResult]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,330 INFO L246 CegarLoopResult]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-27 22:40:36,330 INFO L246 CegarLoopResult]: For program point L583(line 583) no Hoare annotation was computed. [2019-11-27 22:40:36,330 INFO L246 CegarLoopResult]: For program point L517(line 517) no Hoare annotation was computed. [2019-11-27 22:40:36,330 INFO L246 CegarLoopResult]: For program point L451(line 451) no Hoare annotation was computed. [2019-11-27 22:40:36,330 INFO L246 CegarLoopResult]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-27 22:40:36,330 INFO L246 CegarLoopResult]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-27 22:40:36,334 INFO L246 CegarLoopResult]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,334 INFO L246 CegarLoopResult]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,334 INFO L246 CegarLoopResult]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,334 INFO L246 CegarLoopResult]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-27 22:40:36,334 INFO L246 CegarLoopResult]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-27 22:40:36,335 INFO L246 CegarLoopResult]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-27 22:40:36,335 INFO L246 CegarLoopResult]: For program point L520(line 520) no Hoare annotation was computed. [2019-11-27 22:40:36,335 INFO L246 CegarLoopResult]: For program point L454(line 454) no Hoare annotation was computed. [2019-11-27 22:40:36,335 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:40:36,335 INFO L246 CegarLoopResult]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-27 22:40:36,335 INFO L246 CegarLoopResult]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-27 22:40:36,336 INFO L246 CegarLoopResult]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-27 22:40:36,336 INFO L246 CegarLoopResult]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,336 INFO L246 CegarLoopResult]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,336 INFO L246 CegarLoopResult]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,336 INFO L246 CegarLoopResult]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-27 22:40:36,336 INFO L246 CegarLoopResult]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-27 22:40:36,339 INFO L246 CegarLoopResult]: For program point L457(line 457) no Hoare annotation was computed. [2019-11-27 22:40:36,339 INFO L246 CegarLoopResult]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-27 22:40:36,340 INFO L246 CegarLoopResult]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-27 22:40:36,340 INFO L246 CegarLoopResult]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,340 INFO L246 CegarLoopResult]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,340 INFO L246 CegarLoopResult]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,340 INFO L246 CegarLoopResult]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-27 22:40:36,340 INFO L246 CegarLoopResult]: For program point L592(line 592) no Hoare annotation was computed. [2019-11-27 22:40:36,341 INFO L246 CegarLoopResult]: For program point L526(line 526) no Hoare annotation was computed. [2019-11-27 22:40:36,341 INFO L246 CegarLoopResult]: For program point L460(line 460) no Hoare annotation was computed. [2019-11-27 22:40:36,341 INFO L246 CegarLoopResult]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-27 22:40:36,341 INFO L246 CegarLoopResult]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-27 22:40:36,341 INFO L246 CegarLoopResult]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-11-27 22:40:36,341 INFO L246 CegarLoopResult]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-11-27 22:40:36,341 INFO L246 CegarLoopResult]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-27 22:40:36,342 INFO L246 CegarLoopResult]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-27 22:40:36,342 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 22:40:36,342 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 472) no Hoare annotation was computed. [2019-11-27 22:40:36,343 INFO L246 CegarLoopResult]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-11-27 22:40:36,343 INFO L246 CegarLoopResult]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,343 INFO L246 CegarLoopResult]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,343 INFO L246 CegarLoopResult]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-27 22:40:36,343 INFO L246 CegarLoopResult]: For program point L595(line 595) no Hoare annotation was computed. [2019-11-27 22:40:36,344 INFO L246 CegarLoopResult]: For program point L529(line 529) no Hoare annotation was computed. [2019-11-27 22:40:36,344 INFO L246 CegarLoopResult]: For program point L463(line 463) no Hoare annotation was computed. [2019-11-27 22:40:36,344 INFO L246 CegarLoopResult]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-27 22:40:36,344 INFO L246 CegarLoopResult]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-27 22:40:36,344 INFO L246 CegarLoopResult]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-11-27 22:40:36,344 INFO L246 CegarLoopResult]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-11-27 22:40:36,344 INFO L246 CegarLoopResult]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-27 22:40:36,345 INFO L242 CegarLoopResult]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse9 (= ~a25~0 1))) (let ((.cse10 (not .cse9)) (.cse1 (= ~a28~0 7)) (.cse0 (= ~a17~0 8)) (.cse2 (<= ~a11~0 0)) (.cse8 (not (= ~a28~0 11))) (.cse7 (= ~a11~0 1)) (.cse3 (= ~a28~0 10)) (.cse4 (not (= ~a28~0 8))) (.cse6 (= ~a19~0 1)) (.cse5 (not (= ~a17~0 9)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2 .cse5) (and .cse4 .cse6 .cse7 .cse5 .cse8) (and .cse4 .cse9 .cse7 .cse5 .cse8) (and .cse0 .cse1 .cse7) (and .cse10 .cse4 .cse2 .cse5 .cse8) (and .cse10 .cse0 .cse2 .cse8) (and .cse6 .cse1 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse8) (and .cse4 .cse6 .cse2 .cse5 .cse8) (and .cse3 .cse4 .cse7 .cse5) (and (<= 11 ~a28~0) .cse4 .cse6 .cse9 .cse5) (and .cse3 .cse4 .cse6 .cse5)))) [2019-11-27 22:40:36,345 INFO L246 CegarLoopResult]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,345 INFO L246 CegarLoopResult]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,345 INFO L246 CegarLoopResult]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-27 22:40:36,345 INFO L246 CegarLoopResult]: For program point L532(line 532) no Hoare annotation was computed. [2019-11-27 22:40:36,346 INFO L246 CegarLoopResult]: For program point L466(line 466) no Hoare annotation was computed. [2019-11-27 22:40:36,346 INFO L246 CegarLoopResult]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-27 22:40:36,346 INFO L246 CegarLoopResult]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-11-27 22:40:36,346 INFO L246 CegarLoopResult]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-11-27 22:40:36,346 INFO L249 CegarLoopResult]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-27 22:40:36,346 INFO L246 CegarLoopResult]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,346 INFO L246 CegarLoopResult]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,346 INFO L246 CegarLoopResult]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-27 22:40:36,347 INFO L246 CegarLoopResult]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-27 22:40:36,347 INFO L246 CegarLoopResult]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-27 22:40:36,347 INFO L246 CegarLoopResult]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-27 22:40:36,347 INFO L246 CegarLoopResult]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-27 22:40:36,347 INFO L246 CegarLoopResult]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-27 22:40:36,347 INFO L246 CegarLoopResult]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-27 22:40:36,347 INFO L246 CegarLoopResult]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-11-27 22:40:36,347 INFO L246 CegarLoopResult]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-27 22:40:36,347 INFO L246 CegarLoopResult]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,348 INFO L246 CegarLoopResult]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,348 INFO L246 CegarLoopResult]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-27 22:40:36,348 INFO L246 CegarLoopResult]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-11-27 22:40:36,348 INFO L246 CegarLoopResult]: For program point L538(line 538) no Hoare annotation was computed. [2019-11-27 22:40:36,348 INFO L246 CegarLoopResult]: For program point L472(line 472) no Hoare annotation was computed. [2019-11-27 22:40:36,348 INFO L246 CegarLoopResult]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-27 22:40:36,348 INFO L246 CegarLoopResult]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-27 22:40:36,349 INFO L242 CegarLoopResult]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse9 (= ~a25~0 1))) (let ((.cse10 (not .cse9)) (.cse1 (= ~a28~0 7)) (.cse0 (= ~a17~0 8)) (.cse2 (<= ~a11~0 0)) (.cse8 (not (= ~a28~0 11))) (.cse7 (= ~a11~0 1)) (.cse3 (= ~a28~0 10)) (.cse4 (not (= ~a28~0 8))) (.cse6 (= ~a19~0 1)) (.cse5 (not (= ~a17~0 9)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2 .cse5) (and .cse4 .cse6 .cse7 .cse5 .cse8) (and .cse4 .cse9 .cse7 .cse5 .cse8) (and .cse0 .cse1 .cse7) (and .cse10 .cse4 .cse2 .cse5 .cse8) (and .cse10 .cse0 .cse2 .cse8) (and .cse6 .cse1 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse8) (and .cse4 .cse6 .cse2 .cse5 .cse8) (and .cse3 .cse4 .cse7 .cse5) (and (<= 11 ~a28~0) .cse4 .cse6 .cse9 .cse5) (and .cse3 .cse4 .cse6 .cse5)))) [2019-11-27 22:40:36,349 INFO L246 CegarLoopResult]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,349 INFO L246 CegarLoopResult]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,349 INFO L246 CegarLoopResult]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-27 22:40:36,349 INFO L246 CegarLoopResult]: For program point L541(line 541) no Hoare annotation was computed. [2019-11-27 22:40:36,350 INFO L246 CegarLoopResult]: For program point L475(line 475) no Hoare annotation was computed. [2019-11-27 22:40:36,350 INFO L246 CegarLoopResult]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-27 22:40:36,350 INFO L246 CegarLoopResult]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-27 22:40:36,350 INFO L246 CegarLoopResult]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,350 INFO L246 CegarLoopResult]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,350 INFO L246 CegarLoopResult]: For program point L544(line 544) no Hoare annotation was computed. [2019-11-27 22:40:36,350 INFO L246 CegarLoopResult]: For program point L478(line 478) no Hoare annotation was computed. [2019-11-27 22:40:36,350 INFO L246 CegarLoopResult]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-27 22:40:36,350 INFO L246 CegarLoopResult]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-27 22:40:36,351 INFO L246 CegarLoopResult]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-27 22:40:36,351 INFO L246 CegarLoopResult]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-27 22:40:36,351 INFO L246 CegarLoopResult]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-27 22:40:36,351 INFO L246 CegarLoopResult]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-11-27 22:40:36,351 INFO L246 CegarLoopResult]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-11-27 22:40:36,351 INFO L246 CegarLoopResult]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,351 INFO L246 CegarLoopResult]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,351 INFO L246 CegarLoopResult]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-27 22:40:36,352 INFO L246 CegarLoopResult]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,352 INFO L246 CegarLoopResult]: For program point L547(line 547) no Hoare annotation was computed. [2019-11-27 22:40:36,352 INFO L246 CegarLoopResult]: For program point L481(line 481) no Hoare annotation was computed. [2019-11-27 22:40:36,352 INFO L246 CegarLoopResult]: For program point L415(line 415) no Hoare annotation was computed. [2019-11-27 22:40:36,352 INFO L246 CegarLoopResult]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-27 22:40:36,352 INFO L246 CegarLoopResult]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-27 22:40:36,353 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:40:36,353 INFO L246 CegarLoopResult]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-27 22:40:36,353 INFO L246 CegarLoopResult]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,353 INFO L246 CegarLoopResult]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,353 INFO L246 CegarLoopResult]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,353 INFO L246 CegarLoopResult]: For program point L550(line 550) no Hoare annotation was computed. [2019-11-27 22:40:36,353 INFO L246 CegarLoopResult]: For program point L484(line 484) no Hoare annotation was computed. [2019-11-27 22:40:36,354 INFO L246 CegarLoopResult]: For program point L418(line 418) no Hoare annotation was computed. [2019-11-27 22:40:36,354 INFO L246 CegarLoopResult]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-27 22:40:36,354 INFO L246 CegarLoopResult]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-27 22:40:36,354 INFO L246 CegarLoopResult]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,354 INFO L246 CegarLoopResult]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,354 INFO L246 CegarLoopResult]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,354 INFO L246 CegarLoopResult]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-27 22:40:36,355 INFO L246 CegarLoopResult]: For program point L553(line 553) no Hoare annotation was computed. [2019-11-27 22:40:36,355 INFO L246 CegarLoopResult]: For program point L487(line 487) no Hoare annotation was computed. [2019-11-27 22:40:36,355 INFO L246 CegarLoopResult]: For program point L421(line 421) no Hoare annotation was computed. [2019-11-27 22:40:36,355 INFO L246 CegarLoopResult]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-27 22:40:36,355 INFO L246 CegarLoopResult]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-27 22:40:36,355 INFO L246 CegarLoopResult]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,356 INFO L246 CegarLoopResult]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,356 INFO L246 CegarLoopResult]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,356 INFO L246 CegarLoopResult]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-27 22:40:36,356 INFO L246 CegarLoopResult]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-27 22:40:36,356 INFO L246 CegarLoopResult]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-27 22:40:36,356 INFO L246 CegarLoopResult]: For program point L556(line 556) no Hoare annotation was computed. [2019-11-27 22:40:36,356 INFO L246 CegarLoopResult]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-27 22:40:36,357 INFO L246 CegarLoopResult]: For program point L424(line 424) no Hoare annotation was computed. [2019-11-27 22:40:36,357 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:40:36,357 INFO L246 CegarLoopResult]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-27 22:40:36,357 INFO L246 CegarLoopResult]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-27 22:40:36,357 INFO L246 CegarLoopResult]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,357 INFO L246 CegarLoopResult]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,358 INFO L246 CegarLoopResult]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,358 INFO L246 CegarLoopResult]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-27 22:40:36,358 INFO L246 CegarLoopResult]: For program point L559(line 559) no Hoare annotation was computed. [2019-11-27 22:40:36,358 INFO L246 CegarLoopResult]: For program point L493(line 493) no Hoare annotation was computed. [2019-11-27 22:40:36,358 INFO L246 CegarLoopResult]: For program point L427(line 427) no Hoare annotation was computed. [2019-11-27 22:40:36,358 INFO L246 CegarLoopResult]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-27 22:40:36,358 INFO L246 CegarLoopResult]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,359 INFO L246 CegarLoopResult]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,359 INFO L246 CegarLoopResult]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:36,359 INFO L246 CegarLoopResult]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-27 22:40:36,359 INFO L246 CegarLoopResult]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-27 22:40:36,359 INFO L246 CegarLoopResult]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-27 22:40:36,359 INFO L246 CegarLoopResult]: For program point L562(line 562) no Hoare annotation was computed. [2019-11-27 22:40:36,359 INFO L246 CegarLoopResult]: For program point L496(line 496) no Hoare annotation was computed. [2019-11-27 22:40:36,360 INFO L246 CegarLoopResult]: For program point L430(line 430) no Hoare annotation was computed. [2019-11-27 22:40:36,360 INFO L246 CegarLoopResult]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-11-27 22:40:36,360 INFO L246 CegarLoopResult]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-27 22:40:36,360 INFO L246 CegarLoopResult]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-11-27 22:40:36,360 INFO L246 CegarLoopResult]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-27 22:40:36,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:40:36 BoogieIcfgContainer [2019-11-27 22:40:36,418 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:40:36,418 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:40:36,418 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:40:36,422 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:40:36,422 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:40:25" (3/4) ... [2019-11-27 22:40:36,429 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:40:36,470 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:40:36,475 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:40:36,703 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:40:36,703 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:40:36,705 INFO L168 Benchmark]: Toolchain (without parser) took 12937.30 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 434.1 MB). Free memory was 952.3 MB in the beginning and 1.2 GB in the end (delta: -264.3 MB). Peak memory consumption was 169.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:36,705 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:40:36,706 INFO L168 Benchmark]: CACSL2BoogieTranslator took 688.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -141.5 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:36,706 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.29 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:36,706 INFO L168 Benchmark]: Boogie Preprocessor took 93.38 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:36,707 INFO L168 Benchmark]: RCFGBuilder took 1259.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 968.7 MB in the end (delta: 111.7 MB). Peak memory consumption was 111.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:36,707 INFO L168 Benchmark]: TraceAbstraction took 10514.38 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 314.6 MB). Free memory was 968.7 MB in the beginning and 1.2 GB in the end (delta: -272.5 MB). Peak memory consumption was 42.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:36,707 INFO L168 Benchmark]: Witness Printer took 285.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:36,710 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.47 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 688.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -141.5 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.29 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.38 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1259.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 968.7 MB in the end (delta: 111.7 MB). Peak memory consumption was 111.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10514.38 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 314.6 MB). Free memory was 968.7 MB in the beginning and 1.2 GB in the end (delta: -272.5 MB). Peak memory consumption was 42.1 MB. Max. memory is 11.5 GB. * Witness Printer took 285.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 472]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((((a17 == 8 && a28 == 7) && a11 <= 0) || (((a28 == 10 && !(a28 == 8)) && a11 <= 0) && !(a17 == 9))) || ((((!(a28 == 8) && a19 == 1) && a11 == 1) && !(a17 == 9)) && !(a28 == 11))) || ((((!(a28 == 8) && a25 == 1) && a11 == 1) && !(a17 == 9)) && !(a28 == 11))) || ((a17 == 8 && a28 == 7) && a11 == 1)) || ((((!(a25 == 1) && !(a28 == 8)) && a11 <= 0) && !(a17 == 9)) && !(a28 == 11))) || (((!(a25 == 1) && a17 == 8) && a11 <= 0) && !(a28 == 11))) || (((a19 == 1 && a28 == 7) && a25 == 1) && !(a17 == 9))) || (((a17 == 8 && a19 == 1) && a11 <= 0) && !(a28 == 11))) || ((((!(a28 == 8) && a19 == 1) && a11 <= 0) && !(a17 == 9)) && !(a28 == 11))) || (((a28 == 10 && !(a28 == 8)) && a11 == 1) && !(a17 == 9))) || ((((11 <= a28 && !(a28 == 8)) && a19 == 1) && a25 == 1) && !(a17 == 9))) || (((a28 == 10 && !(a28 == 8)) && a19 == 1) && !(a17 == 9)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((((a17 == 8 && a28 == 7) && a11 <= 0) || (((a28 == 10 && !(a28 == 8)) && a11 <= 0) && !(a17 == 9))) || ((((!(a28 == 8) && a19 == 1) && a11 == 1) && !(a17 == 9)) && !(a28 == 11))) || ((((!(a28 == 8) && a25 == 1) && a11 == 1) && !(a17 == 9)) && !(a28 == 11))) || ((a17 == 8 && a28 == 7) && a11 == 1)) || ((((!(a25 == 1) && !(a28 == 8)) && a11 <= 0) && !(a17 == 9)) && !(a28 == 11))) || (((!(a25 == 1) && a17 == 8) && a11 <= 0) && !(a28 == 11))) || (((a19 == 1 && a28 == 7) && a25 == 1) && !(a17 == 9))) || (((a17 == 8 && a19 == 1) && a11 <= 0) && !(a28 == 11))) || ((((!(a28 == 8) && a19 == 1) && a11 <= 0) && !(a17 == 9)) && !(a28 == 11))) || (((a28 == 10 && !(a28 == 8)) && a11 == 1) && !(a17 == 9))) || ((((11 <= a28 && !(a28 == 8)) && a19 == 1) && a25 == 1) && !(a17 == 9))) || (((a28 == 10 && !(a28 == 8)) && a19 == 1) && !(a17 == 9)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 9.6s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 1065 SDtfs, 1945 SDslu, 163 SDs, 0 SdLazy, 3995 SolverSat, 768 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 354 GetRequests, 329 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2965occurred 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.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 990 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 409 HoareAnnotationTreeSize, 3 FomulaSimplifications, 226 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 870 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1780 NumberOfCodeBlocks, 1780 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1768 ConstructedInterpolants, 0 QuantifiedInterpolants, 536707 SizeOfPredicates, 1 NumberOfNonLiveVariables, 580 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 853/855 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...