./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label26.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label26.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 e002fb6463a65ebb6b75b40986db95c31112380a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:38:55,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:38:55,492 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:38:55,510 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:38:55,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:38:55,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:38:55,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:38:55,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:38:55,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:38:55,533 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:38:55,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:38:55,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:38:55,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:38:55,540 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:38:55,542 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:38:55,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:38:55,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:38:55,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:38:55,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:38:55,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:38:55,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:38:55,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:38:55,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:38:55,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:38:55,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:38:55,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:38:55,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:38:55,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:38:55,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:38:55,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:38:55,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:38:55,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:38:55,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:38:55,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:38:55,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:38:55,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:38:55,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:38:55,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:38:55,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:38:55,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:38:55,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:38:55,572 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:38:55,586 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:38:55,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:38:55,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:38:55,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:38:55,588 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:38:55,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:38:55,589 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:38:55,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:38:55,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:38:55,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:38:55,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:38:55,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:38:55,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:38:55,590 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:38:55,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:38:55,591 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:38:55,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:38:55,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:38:55,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:38:55,592 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:38:55,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:38:55,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:38:55,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:38:55,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:38:55,593 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:38:55,593 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:38:55,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:38:55,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:38:55,594 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 -> e002fb6463a65ebb6b75b40986db95c31112380a [2019-11-27 22:38:55,919 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:38:55,940 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:38:55,944 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:38:55,946 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:38:55,946 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:38:55,948 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label26.c [2019-11-27 22:38:56,023 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/361e9e311/2c8df15e0c7a42bea798a9b2a1f4f5e7/FLAGd06805230 [2019-11-27 22:38:56,627 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:38:56,628 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label26.c [2019-11-27 22:38:56,643 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/361e9e311/2c8df15e0c7a42bea798a9b2a1f4f5e7/FLAGd06805230 [2019-11-27 22:38:56,887 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/361e9e311/2c8df15e0c7a42bea798a9b2a1f4f5e7 [2019-11-27 22:38:56,891 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:38:56,893 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:38:56,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:38:56,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:38:56,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:38:56,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:38:56" (1/1) ... [2019-11-27 22:38:56,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf01ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:56, skipping insertion in model container [2019-11-27 22:38:56,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:38:56" (1/1) ... [2019-11-27 22:38:56,914 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:38:56,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:38:57,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:38:57,583 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:38:57,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:38:57,715 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:38:57,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:57 WrapperNode [2019-11-27 22:38:57,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:38:57,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:38:57,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:38:57,721 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:38:57,738 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:38:57" (1/1) ... [2019-11-27 22:38:57,756 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:38:57" (1/1) ... [2019-11-27 22:38:57,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:38:57,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:38:57,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:38:57,828 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:38:57,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:57" (1/1) ... [2019-11-27 22:38:57,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:57" (1/1) ... [2019-11-27 22:38:57,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:57" (1/1) ... [2019-11-27 22:38:57,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:57" (1/1) ... [2019-11-27 22:38:57,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:57" (1/1) ... [2019-11-27 22:38:57,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:57" (1/1) ... [2019-11-27 22:38:57,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:57" (1/1) ... [2019-11-27 22:38:57,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:38:57,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:38:57,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:38:57,919 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:38:57,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:57" (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:38:58,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:38:58,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:38:59,187 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:38:59,187 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:38:59,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:38:59 BoogieIcfgContainer [2019-11-27 22:38:59,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:38:59,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:38:59,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:38:59,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:38:59,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:38:56" (1/3) ... [2019-11-27 22:38:59,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6abc00b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:38:59, skipping insertion in model container [2019-11-27 22:38:59,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:57" (2/3) ... [2019-11-27 22:38:59,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6abc00b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:38:59, skipping insertion in model container [2019-11-27 22:38:59,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:38:59" (3/3) ... [2019-11-27 22:38:59,201 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label26.c [2019-11-27 22:38:59,212 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:38:59,220 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:38:59,233 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:38:59,263 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:38:59,263 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:38:59,263 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:38:59,264 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:38:59,264 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:38:59,264 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:38:59,265 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:38:59,265 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:38:59,289 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-27 22:38:59,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-27 22:38:59,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:59,302 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:59,302 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:59,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:59,309 INFO L82 PathProgramCache]: Analyzing trace with hash -583926962, now seen corresponding path program 1 times [2019-11-27 22:38:59,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:59,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907543187] [2019-11-27 22:38:59,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:59,879 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:38:59,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907543187] [2019-11-27 22:38:59,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:59,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:38:59,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082992481] [2019-11-27 22:38:59,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:38:59,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:59,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:38:59,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:59,914 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-27 22:39:01,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:01,354 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-27 22:39:01,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:39:01,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-27 22:39:01,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:01,385 INFO L225 Difference]: With dead ends: 662 [2019-11-27 22:39:01,385 INFO L226 Difference]: Without dead ends: 397 [2019-11-27 22:39:01,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-27 22:39:01,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-11-27 22:39:01,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-27 22:39:01,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 553 transitions. [2019-11-27 22:39:01,461 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 553 transitions. Word has length 103 [2019-11-27 22:39:01,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:01,465 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 553 transitions. [2019-11-27 22:39:01,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:39:01,465 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 553 transitions. [2019-11-27 22:39:01,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-27 22:39:01,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:01,474 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:01,474 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:01,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:01,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1625453403, now seen corresponding path program 1 times [2019-11-27 22:39:01,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:01,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779505414] [2019-11-27 22:39:01,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:01,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:39:01,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779505414] [2019-11-27 22:39:01,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:01,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:39:01,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571787962] [2019-11-27 22:39:01,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:39:01,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:01,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:39:01,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:01,634 INFO L87 Difference]: Start difference. First operand 397 states and 553 transitions. Second operand 4 states. [2019-11-27 22:39:02,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:02,494 INFO L93 Difference]: Finished difference Result 1447 states and 2019 transitions. [2019-11-27 22:39:02,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:39:02,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-27 22:39:02,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:02,501 INFO L225 Difference]: With dead ends: 1447 [2019-11-27 22:39:02,502 INFO L226 Difference]: Without dead ends: 1052 [2019-11-27 22:39:02,504 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:39:02,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-11-27 22:39:02,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 659. [2019-11-27 22:39:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-27 22:39:02,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 851 transitions. [2019-11-27 22:39:02,549 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 851 transitions. Word has length 110 [2019-11-27 22:39:02,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:02,550 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 851 transitions. [2019-11-27 22:39:02,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:39:02,550 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 851 transitions. [2019-11-27 22:39:02,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-27 22:39:02,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:02,555 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:02,555 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:02,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:02,555 INFO L82 PathProgramCache]: Analyzing trace with hash 733143454, now seen corresponding path program 1 times [2019-11-27 22:39:02,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:02,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312363769] [2019-11-27 22:39:02,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:02,634 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:39:02,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312363769] [2019-11-27 22:39:02,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:02,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:39:02,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199546973] [2019-11-27 22:39:02,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:39:02,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:02,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:39:02,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:02,636 INFO L87 Difference]: Start difference. First operand 659 states and 851 transitions. Second operand 4 states. [2019-11-27 22:39:03,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:03,512 INFO L93 Difference]: Finished difference Result 1578 states and 1998 transitions. [2019-11-27 22:39:03,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:39:03,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-11-27 22:39:03,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:03,517 INFO L225 Difference]: With dead ends: 1578 [2019-11-27 22:39:03,518 INFO L226 Difference]: Without dead ends: 790 [2019-11-27 22:39:03,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:03,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-27 22:39:03,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-27 22:39:03,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-27 22:39:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 930 transitions. [2019-11-27 22:39:03,546 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 930 transitions. Word has length 124 [2019-11-27 22:39:03,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:03,546 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 930 transitions. [2019-11-27 22:39:03,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:39:03,547 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 930 transitions. [2019-11-27 22:39:03,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-27 22:39:03,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:03,551 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:03,551 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:03,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:03,552 INFO L82 PathProgramCache]: Analyzing trace with hash 2001117315, now seen corresponding path program 1 times [2019-11-27 22:39:03,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:03,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620288572] [2019-11-27 22:39:03,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:03,652 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:39:03,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620288572] [2019-11-27 22:39:03,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:03,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:39:03,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042119032] [2019-11-27 22:39:03,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:03,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:03,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:03,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:03,657 INFO L87 Difference]: Start difference. First operand 790 states and 930 transitions. Second operand 3 states. [2019-11-27 22:39:04,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:04,247 INFO L93 Difference]: Finished difference Result 2233 states and 2643 transitions. [2019-11-27 22:39:04,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:04,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-11-27 22:39:04,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:04,255 INFO L225 Difference]: With dead ends: 2233 [2019-11-27 22:39:04,255 INFO L226 Difference]: Without dead ends: 1445 [2019-11-27 22:39:04,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:04,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-27 22:39:04,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2019-11-27 22:39:04,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-27 22:39:04,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1374 transitions. [2019-11-27 22:39:04,288 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1374 transitions. Word has length 125 [2019-11-27 22:39:04,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:04,288 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1374 transitions. [2019-11-27 22:39:04,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1374 transitions. [2019-11-27 22:39:04,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-27 22:39:04,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:04,293 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:04,293 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:04,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:04,294 INFO L82 PathProgramCache]: Analyzing trace with hash 891303243, now seen corresponding path program 1 times [2019-11-27 22:39:04,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:04,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681248665] [2019-11-27 22:39:04,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:04,365 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 22:39:04,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681248665] [2019-11-27 22:39:04,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:04,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:39:04,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091079505] [2019-11-27 22:39:04,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:04,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:04,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:04,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:04,368 INFO L87 Difference]: Start difference. First operand 1183 states and 1374 transitions. Second operand 3 states. [2019-11-27 22:39:04,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:04,945 INFO L93 Difference]: Finished difference Result 3150 states and 3674 transitions. [2019-11-27 22:39:04,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:04,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-11-27 22:39:04,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:04,955 INFO L225 Difference]: With dead ends: 3150 [2019-11-27 22:39:04,956 INFO L226 Difference]: Without dead ends: 1969 [2019-11-27 22:39:04,958 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:04,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-27 22:39:05,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1445. [2019-11-27 22:39:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-27 22:39:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1682 transitions. [2019-11-27 22:39:05,007 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1682 transitions. Word has length 129 [2019-11-27 22:39:05,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:05,008 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1682 transitions. [2019-11-27 22:39:05,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1682 transitions. [2019-11-27 22:39:05,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-27 22:39:05,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:05,012 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:05,013 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:05,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:05,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1514660785, now seen corresponding path program 1 times [2019-11-27 22:39:05,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:05,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036783423] [2019-11-27 22:39:05,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-27 22:39:05,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036783423] [2019-11-27 22:39:05,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:05,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:39:05,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854646607] [2019-11-27 22:39:05,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:05,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:05,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:05,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:05,116 INFO L87 Difference]: Start difference. First operand 1445 states and 1682 transitions. Second operand 3 states. [2019-11-27 22:39:05,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:05,574 INFO L93 Difference]: Finished difference Result 3019 states and 3514 transitions. [2019-11-27 22:39:05,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:05,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-11-27 22:39:05,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:05,583 INFO L225 Difference]: With dead ends: 3019 [2019-11-27 22:39:05,583 INFO L226 Difference]: Without dead ends: 1576 [2019-11-27 22:39:05,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:05,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-27 22:39:05,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2019-11-27 22:39:05,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-27 22:39:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1682 transitions. [2019-11-27 22:39:05,623 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1682 transitions. Word has length 131 [2019-11-27 22:39:05,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:05,623 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1682 transitions. [2019-11-27 22:39:05,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:05,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1682 transitions. [2019-11-27 22:39:05,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-27 22:39:05,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:05,628 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:05,628 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:05,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:05,633 INFO L82 PathProgramCache]: Analyzing trace with hash 263294258, now seen corresponding path program 1 times [2019-11-27 22:39:05,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:05,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925455738] [2019-11-27 22:39:05,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:39:05,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925455738] [2019-11-27 22:39:05,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:05,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:39:05,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402544989] [2019-11-27 22:39:05,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:05,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:05,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:05,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:05,693 INFO L87 Difference]: Start difference. First operand 1445 states and 1682 transitions. Second operand 3 states. [2019-11-27 22:39:06,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:06,163 INFO L93 Difference]: Finished difference Result 3281 states and 3792 transitions. [2019-11-27 22:39:06,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:06,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-11-27 22:39:06,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:06,172 INFO L225 Difference]: With dead ends: 3281 [2019-11-27 22:39:06,173 INFO L226 Difference]: Without dead ends: 1838 [2019-11-27 22:39:06,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:06,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-27 22:39:06,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2019-11-27 22:39:06,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-27 22:39:06,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1965 transitions. [2019-11-27 22:39:06,216 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1965 transitions. Word has length 132 [2019-11-27 22:39:06,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:06,217 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1965 transitions. [2019-11-27 22:39:06,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1965 transitions. [2019-11-27 22:39:06,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-27 22:39:06,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:06,222 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:06,222 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:06,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:06,222 INFO L82 PathProgramCache]: Analyzing trace with hash 294946666, now seen corresponding path program 1 times [2019-11-27 22:39:06,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:06,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861514640] [2019-11-27 22:39:06,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:39:06,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861514640] [2019-11-27 22:39:06,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:06,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-27 22:39:06,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680943945] [2019-11-27 22:39:06,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 22:39:06,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:06,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 22:39:06,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:39:06,478 INFO L87 Difference]: Start difference. First operand 1707 states and 1965 transitions. Second operand 8 states. [2019-11-27 22:39:07,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:07,618 INFO L93 Difference]: Finished difference Result 3582 states and 4117 transitions. [2019-11-27 22:39:07,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 22:39:07,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 136 [2019-11-27 22:39:07,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:07,627 INFO L225 Difference]: With dead ends: 3582 [2019-11-27 22:39:07,627 INFO L226 Difference]: Without dead ends: 2008 [2019-11-27 22:39:07,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:39:07,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2019-11-27 22:39:07,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1707. [2019-11-27 22:39:07,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-27 22:39:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1953 transitions. [2019-11-27 22:39:07,668 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1953 transitions. Word has length 136 [2019-11-27 22:39:07,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:07,668 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1953 transitions. [2019-11-27 22:39:07,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 22:39:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1953 transitions. [2019-11-27 22:39:07,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-27 22:39:07,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:07,673 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, 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] [2019-11-27 22:39:07,673 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:07,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:07,673 INFO L82 PathProgramCache]: Analyzing trace with hash 2118430365, now seen corresponding path program 1 times [2019-11-27 22:39:07,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:07,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702714283] [2019-11-27 22:39:07,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:07,803 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:39:07,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702714283] [2019-11-27 22:39:07,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:07,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:39:07,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626820838] [2019-11-27 22:39:07,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:07,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:07,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:07,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:07,814 INFO L87 Difference]: Start difference. First operand 1707 states and 1953 transitions. Second operand 3 states. [2019-11-27 22:39:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:08,275 INFO L93 Difference]: Finished difference Result 2102 states and 2422 transitions. [2019-11-27 22:39:08,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:08,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-11-27 22:39:08,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:08,289 INFO L225 Difference]: With dead ends: 2102 [2019-11-27 22:39:08,290 INFO L226 Difference]: Without dead ends: 2100 [2019-11-27 22:39:08,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:08,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-27 22:39:08,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1838. [2019-11-27 22:39:08,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-27 22:39:08,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2129 transitions. [2019-11-27 22:39:08,336 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2129 transitions. Word has length 162 [2019-11-27 22:39:08,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:08,336 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2129 transitions. [2019-11-27 22:39:08,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:08,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2129 transitions. [2019-11-27 22:39:08,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-27 22:39:08,348 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:08,348 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 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] [2019-11-27 22:39:08,348 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:08,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:08,349 INFO L82 PathProgramCache]: Analyzing trace with hash 172823534, now seen corresponding path program 1 times [2019-11-27 22:39:08,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:08,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444606673] [2019-11-27 22:39:08,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-27 22:39:08,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444606673] [2019-11-27 22:39:08,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:08,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:39:08,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422405783] [2019-11-27 22:39:08,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:08,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:08,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:08,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:08,441 INFO L87 Difference]: Start difference. First operand 1838 states and 2129 transitions. Second operand 3 states. [2019-11-27 22:39:08,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:08,974 INFO L93 Difference]: Finished difference Result 3674 states and 4254 transitions. [2019-11-27 22:39:08,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:08,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-11-27 22:39:08,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:08,987 INFO L225 Difference]: With dead ends: 3674 [2019-11-27 22:39:08,987 INFO L226 Difference]: Without dead ends: 1838 [2019-11-27 22:39:08,991 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:08,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-27 22:39:09,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-11-27 22:39:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-27 22:39:09,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2011 transitions. [2019-11-27 22:39:09,035 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2011 transitions. Word has length 167 [2019-11-27 22:39:09,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:09,041 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2011 transitions. [2019-11-27 22:39:09,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:09,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2011 transitions. [2019-11-27 22:39:09,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-27 22:39:09,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:09,047 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:09,048 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:09,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:09,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1369122589, now seen corresponding path program 1 times [2019-11-27 22:39:09,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:09,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688052203] [2019-11-27 22:39:09,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-27 22:39:09,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688052203] [2019-11-27 22:39:09,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:09,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:39:09,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41619911] [2019-11-27 22:39:09,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:09,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:09,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:09,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:09,185 INFO L87 Difference]: Start difference. First operand 1838 states and 2011 transitions. Second operand 3 states. [2019-11-27 22:39:09,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:09,639 INFO L93 Difference]: Finished difference Result 3674 states and 4020 transitions. [2019-11-27 22:39:09,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:09,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-11-27 22:39:09,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:09,648 INFO L225 Difference]: With dead ends: 3674 [2019-11-27 22:39:09,649 INFO L226 Difference]: Without dead ends: 1838 [2019-11-27 22:39:09,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:09,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-27 22:39:09,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2019-11-27 22:39:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-27 22:39:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1855 transitions. [2019-11-27 22:39:09,686 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1855 transitions. Word has length 197 [2019-11-27 22:39:09,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:09,686 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1855 transitions. [2019-11-27 22:39:09,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1855 transitions. [2019-11-27 22:39:09,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-27 22:39:09,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:09,692 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:09,692 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:09,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:09,693 INFO L82 PathProgramCache]: Analyzing trace with hash 2102385007, now seen corresponding path program 1 times [2019-11-27 22:39:09,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:09,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433343226] [2019-11-27 22:39:09,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:09,939 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 181 proven. 93 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-27 22:39:09,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433343226] [2019-11-27 22:39:09,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135438874] [2019-11-27 22:39:09,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:39:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:10,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:39:10,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:39:10,172 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-11-27 22:39:10,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:39:10,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-11-27 22:39:10,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101635155] [2019-11-27 22:39:10,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:10,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:10,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:10,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-27 22:39:10,175 INFO L87 Difference]: Start difference. First operand 1707 states and 1855 transitions. Second operand 3 states. [2019-11-27 22:39:10,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:10,597 INFO L93 Difference]: Finished difference Result 3410 states and 3720 transitions. [2019-11-27 22:39:10,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:10,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-11-27 22:39:10,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:10,599 INFO L225 Difference]: With dead ends: 3410 [2019-11-27 22:39:10,599 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:39:10,604 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 227 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-27 22:39:10,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:39:10,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:39:10,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:39:10,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:39:10,605 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 226 [2019-11-27 22:39:10,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:10,605 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:39:10,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:10,606 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:39:10,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:39:10,820 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:39:10,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:39:10,935 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 19 [2019-11-27 22:39:11,062 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-27 22:39:11,063 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-27 22:39:11,063 INFO L246 CegarLoopResult]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,063 INFO L246 CegarLoopResult]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,063 INFO L246 CegarLoopResult]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,063 INFO L246 CegarLoopResult]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,063 INFO L246 CegarLoopResult]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,063 INFO L246 CegarLoopResult]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,064 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-27 22:39:11,064 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-27 22:39:11,064 INFO L246 CegarLoopResult]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-27 22:39:11,064 INFO L246 CegarLoopResult]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-27 22:39:11,064 INFO L246 CegarLoopResult]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-27 22:39:11,064 INFO L246 CegarLoopResult]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-27 22:39:11,064 INFO L246 CegarLoopResult]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-27 22:39:11,066 INFO L246 CegarLoopResult]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-27 22:39:11,066 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-27 22:39:11,067 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-27 22:39:11,068 INFO L246 CegarLoopResult]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,068 INFO L246 CegarLoopResult]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,068 INFO L246 CegarLoopResult]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,068 INFO L246 CegarLoopResult]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,068 INFO L246 CegarLoopResult]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,069 INFO L246 CegarLoopResult]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,070 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-27 22:39:11,070 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-27 22:39:11,071 INFO L246 CegarLoopResult]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-27 22:39:11,074 INFO L246 CegarLoopResult]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-27 22:39:11,074 INFO L246 CegarLoopResult]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-27 22:39:11,074 INFO L246 CegarLoopResult]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-27 22:39:11,075 INFO L246 CegarLoopResult]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-27 22:39:11,075 INFO L246 CegarLoopResult]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-27 22:39:11,075 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-27 22:39:11,075 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-27 22:39:11,075 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-27 22:39:11,076 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-27 22:39:11,076 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-27 22:39:11,076 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-27 22:39:11,076 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-27 22:39:11,076 INFO L246 CegarLoopResult]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,078 INFO L246 CegarLoopResult]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,078 INFO L246 CegarLoopResult]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,078 INFO L246 CegarLoopResult]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,078 INFO L246 CegarLoopResult]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,078 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-27 22:39:11,079 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-27 22:39:11,080 INFO L246 CegarLoopResult]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-27 22:39:11,080 INFO L246 CegarLoopResult]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-27 22:39:11,080 INFO L246 CegarLoopResult]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-27 22:39:11,080 INFO L246 CegarLoopResult]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-27 22:39:11,081 INFO L246 CegarLoopResult]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-27 22:39:11,082 INFO L246 CegarLoopResult]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-27 22:39:11,082 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-27 22:39:11,083 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (not (= 15 ~a8~0)) (and (not (= 1 ~a7~0)) .cse0 (= ~a20~0 1)) (and .cse0 (<= ~a20~0 0)))) [2019-11-27 22:39:11,083 INFO L246 CegarLoopResult]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,083 INFO L246 CegarLoopResult]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,084 INFO L246 CegarLoopResult]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,084 INFO L246 CegarLoopResult]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,084 INFO L246 CegarLoopResult]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,084 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-27 22:39:11,084 INFO L246 CegarLoopResult]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-27 22:39:11,085 INFO L246 CegarLoopResult]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-27 22:39:11,085 INFO L246 CegarLoopResult]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-27 22:39:11,085 INFO L246 CegarLoopResult]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-27 22:39:11,085 INFO L246 CegarLoopResult]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-27 22:39:11,086 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-27 22:39:11,086 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-27 22:39:11,086 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-27 22:39:11,086 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-27 22:39:11,086 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-27 22:39:11,088 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-27 22:39:11,088 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-27 22:39:11,088 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-27 22:39:11,088 INFO L246 CegarLoopResult]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,088 INFO L246 CegarLoopResult]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,089 INFO L246 CegarLoopResult]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,089 INFO L246 CegarLoopResult]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,089 INFO L246 CegarLoopResult]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,089 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-27 22:39:11,089 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-27 22:39:11,090 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-27 22:39:11,090 INFO L246 CegarLoopResult]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-27 22:39:11,090 INFO L246 CegarLoopResult]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-27 22:39:11,090 INFO L246 CegarLoopResult]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-27 22:39:11,090 INFO L246 CegarLoopResult]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-27 22:39:11,090 INFO L246 CegarLoopResult]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-27 22:39:11,091 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-27 22:39:11,091 INFO L246 CegarLoopResult]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,091 INFO L246 CegarLoopResult]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,091 INFO L246 CegarLoopResult]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,091 INFO L246 CegarLoopResult]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,091 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-27 22:39:11,092 INFO L246 CegarLoopResult]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,092 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-27 22:39:11,092 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-27 22:39:11,092 INFO L246 CegarLoopResult]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-27 22:39:11,092 INFO L246 CegarLoopResult]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-27 22:39:11,092 INFO L246 CegarLoopResult]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-27 22:39:11,093 INFO L246 CegarLoopResult]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-27 22:39:11,093 INFO L246 CegarLoopResult]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-27 22:39:11,093 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:39:11,093 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-27 22:39:11,093 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-27 22:39:11,093 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-27 22:39:11,094 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-27 22:39:11,094 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-27 22:39:11,094 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-27 22:39:11,094 INFO L246 CegarLoopResult]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,096 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (not (= 15 ~a8~0)) (and (not (= 1 ~a7~0)) .cse0 (= ~a20~0 1)) (and .cse0 (<= ~a20~0 0)))) [2019-11-27 22:39:11,096 INFO L246 CegarLoopResult]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,096 INFO L246 CegarLoopResult]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,096 INFO L246 CegarLoopResult]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,097 INFO L246 CegarLoopResult]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,097 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-27 22:39:11,097 INFO L246 CegarLoopResult]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-27 22:39:11,097 INFO L246 CegarLoopResult]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-27 22:39:11,097 INFO L246 CegarLoopResult]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-27 22:39:11,097 INFO L246 CegarLoopResult]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-27 22:39:11,098 INFO L246 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-27 22:39:11,098 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-27 22:39:11,098 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-27 22:39:11,098 INFO L246 CegarLoopResult]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,098 INFO L246 CegarLoopResult]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,098 INFO L246 CegarLoopResult]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,098 INFO L246 CegarLoopResult]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,099 INFO L246 CegarLoopResult]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,099 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-27 22:39:11,099 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:39:11,099 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-27 22:39:11,099 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-27 22:39:11,100 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-27 22:39:11,100 INFO L246 CegarLoopResult]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-27 22:39:11,100 INFO L246 CegarLoopResult]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-27 22:39:11,100 INFO L246 CegarLoopResult]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-27 22:39:11,100 INFO L246 CegarLoopResult]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-27 22:39:11,100 INFO L246 CegarLoopResult]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-27 22:39:11,101 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-27 22:39:11,101 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-27 22:39:11,101 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-27 22:39:11,101 INFO L246 CegarLoopResult]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,101 INFO L246 CegarLoopResult]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,101 INFO L246 CegarLoopResult]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,102 INFO L246 CegarLoopResult]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,102 INFO L246 CegarLoopResult]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-27 22:39:11,102 INFO L246 CegarLoopResult]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,102 INFO L246 CegarLoopResult]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,102 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-27 22:39:11,103 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-27 22:39:11,103 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:39:11,103 INFO L246 CegarLoopResult]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-27 22:39:11,103 INFO L246 CegarLoopResult]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-27 22:39:11,103 INFO L246 CegarLoopResult]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-27 22:39:11,103 INFO L246 CegarLoopResult]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-27 22:39:11,104 INFO L246 CegarLoopResult]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-27 22:39:11,104 INFO L246 CegarLoopResult]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-27 22:39:11,104 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-27 22:39:11,104 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-27 22:39:11,104 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-27 22:39:11,105 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-27 22:39:11,105 INFO L246 CegarLoopResult]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,105 INFO L246 CegarLoopResult]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,105 INFO L246 CegarLoopResult]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,105 INFO L246 CegarLoopResult]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,106 INFO L246 CegarLoopResult]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,106 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-27 22:39:11,106 INFO L246 CegarLoopResult]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,106 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-27 22:39:11,106 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-27 22:39:11,107 INFO L246 CegarLoopResult]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-27 22:39:11,107 INFO L246 CegarLoopResult]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-27 22:39:11,107 INFO L246 CegarLoopResult]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-27 22:39:11,107 INFO L246 CegarLoopResult]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-27 22:39:11,107 INFO L246 CegarLoopResult]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-27 22:39:11,107 INFO L246 CegarLoopResult]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-27 22:39:11,108 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-27 22:39:11,108 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-27 22:39:11,108 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-27 22:39:11,108 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 22:39:11,108 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 485) no Hoare annotation was computed. [2019-11-27 22:39:11,109 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-27 22:39:11,109 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-27 22:39:11,109 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-27 22:39:11,109 INFO L246 CegarLoopResult]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,109 INFO L246 CegarLoopResult]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,109 INFO L246 CegarLoopResult]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,110 INFO L246 CegarLoopResult]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,110 INFO L246 CegarLoopResult]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,110 INFO L246 CegarLoopResult]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:11,110 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-27 22:39:11,110 INFO L246 CegarLoopResult]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-27 22:39:11,110 INFO L246 CegarLoopResult]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-27 22:39:11,111 INFO L246 CegarLoopResult]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-27 22:39:11,111 INFO L246 CegarLoopResult]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-27 22:39:11,111 INFO L246 CegarLoopResult]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-27 22:39:11,111 INFO L246 CegarLoopResult]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-27 22:39:11,111 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-27 22:39:11,111 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-27 22:39:11,112 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-27 22:39:11,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:39:11 BoogieIcfgContainer [2019-11-27 22:39:11,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:39:11,141 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:39:11,141 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:39:11,141 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:39:11,142 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:38:59" (3/4) ... [2019-11-27 22:39:11,146 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:39:11,188 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:39:11,190 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:39:11,499 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:39:11,499 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:39:11,502 INFO L168 Benchmark]: Toolchain (without parser) took 14608.99 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 410.0 MB). Free memory was 952.3 MB in the beginning and 870.2 MB in the end (delta: 82.2 MB). Peak memory consumption was 492.2 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:11,503 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:39:11,504 INFO L168 Benchmark]: CACSL2BoogieTranslator took 825.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:11,505 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:11,506 INFO L168 Benchmark]: Boogie Preprocessor took 90.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:11,507 INFO L168 Benchmark]: RCFGBuilder took 1272.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.7 MB in the end (delta: 112.3 MB). Peak memory consumption was 112.3 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:11,508 INFO L168 Benchmark]: TraceAbstraction took 11948.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 262.7 MB). Free memory was 995.7 MB in the beginning and 893.1 MB in the end (delta: 102.6 MB). Peak memory consumption was 365.3 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:11,508 INFO L168 Benchmark]: Witness Printer took 358.68 ms. Allocated memory is still 1.4 GB. Free memory was 893.1 MB in the beginning and 870.2 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:11,512 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.35 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 825.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 107.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1272.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.7 MB in the end (delta: 112.3 MB). Peak memory consumption was 112.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11948.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 262.7 MB). Free memory was 995.7 MB in the beginning and 893.1 MB in the end (delta: 102.6 MB). Peak memory consumption was 365.3 MB. Max. memory is 11.5 GB. * Witness Printer took 358.68 ms. Allocated memory is still 1.4 GB. Free memory was 893.1 MB in the beginning and 870.2 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 485]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (!(15 == a8) || ((!(1 == a7) && a21 == 1) && a20 == 1)) || (a21 == 1 && a20 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (!(15 == a8) || ((!(1 == a7) && a21 == 1) && a20 == 1)) || (a21 == 1 && a20 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 11.5s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 775 SDtfs, 1975 SDslu, 106 SDs, 0 SdLazy, 5458 SolverSat, 856 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 240 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=9, 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, 12 MinimizatonAttempts, 2135 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 40 NumberOfFragments, 47 HoareAnnotationTreeSize, 3 FomulaSimplifications, 20956 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1968 NumberOfCodeBlocks, 1968 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1955 ConstructedInterpolants, 0 QuantifiedInterpolants, 719614 SizeOfPredicates, 1 NumberOfNonLiveVariables, 432 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1058/1151 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...