./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label15.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label15.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 a36e59b73de737948c8406f65f182e859a67435b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:44:24,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:44:24,591 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:44:24,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:44:24,610 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:44:24,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:44:24,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:44:24,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:44:24,620 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:44:24,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:44:24,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:44:24,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:44:24,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:44:24,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:44:24,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:44:24,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:44:24,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:44:24,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:44:24,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:44:24,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:44:24,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:44:24,638 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:44:24,639 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:44:24,640 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:44:24,643 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:44:24,643 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:44:24,643 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:44:24,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:44:24,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:44:24,646 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:44:24,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:44:24,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:44:24,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:44:24,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:44:24,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:44:24,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:44:24,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:44:24,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:44:24,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:44:24,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:44:24,654 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:44:24,655 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:44:24,677 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:44:24,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:44:24,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:44:24,680 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:44:24,680 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:44:24,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:44:24,681 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:44:24,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:44:24,681 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:44:24,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:44:24,683 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:44:24,683 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:44:24,683 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:44:24,684 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:44:24,684 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:44:24,684 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:44:24,684 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:44:24,684 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:44:24,685 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:44:24,685 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:44:24,685 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:44:24,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:44:24,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:44:24,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:44:24,686 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:44:24,686 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:44:24,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:44:24,686 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:44:24,687 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:44:24,687 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 -> a36e59b73de737948c8406f65f182e859a67435b [2019-11-28 15:44:25,056 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:44:25,072 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:44:25,075 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:44:25,077 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:44:25,077 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:44:25,078 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label15.c [2019-11-28 15:44:25,138 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00ce5b209/3fe780808bea4693b320a801127372c8/FLAG762b443d7 [2019-11-28 15:44:25,692 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:44:25,693 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label15.c [2019-11-28 15:44:25,719 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00ce5b209/3fe780808bea4693b320a801127372c8/FLAG762b443d7 [2019-11-28 15:44:26,002 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00ce5b209/3fe780808bea4693b320a801127372c8 [2019-11-28 15:44:26,006 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:44:26,007 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:44:26,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:44:26,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:44:26,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:44:26,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:44:26" (1/1) ... [2019-11-28 15:44:26,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@286e58b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:26, skipping insertion in model container [2019-11-28 15:44:26,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:44:26" (1/1) ... [2019-11-28 15:44:26,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:44:26,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:44:26,579 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:44:26,589 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:44:26,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:44:26,734 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:44:26,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:26 WrapperNode [2019-11-28 15:44:26,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:44:26,736 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:44:26,736 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:44:26,736 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:44:26,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:26" (1/1) ... [2019-11-28 15:44:26,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:26" (1/1) ... [2019-11-28 15:44:26,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:44:26,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:44:26,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:44:26,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:44:26,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:26" (1/1) ... [2019-11-28 15:44:26,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:26" (1/1) ... [2019-11-28 15:44:26,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:26" (1/1) ... [2019-11-28 15:44:26,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:26" (1/1) ... [2019-11-28 15:44:26,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:26" (1/1) ... [2019-11-28 15:44:26,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:26" (1/1) ... [2019-11-28 15:44:26,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:26" (1/1) ... [2019-11-28 15:44:26,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:44:26,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:44:26,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:44:26,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:44:26,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:26" (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-28 15:44:27,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:44:27,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:44:28,365 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:44:28,366 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:44:28,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:44:28 BoogieIcfgContainer [2019-11-28 15:44:28,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:44:28,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:44:28,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:44:28,373 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:44:28,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:44:26" (1/3) ... [2019-11-28 15:44:28,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274a2ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:44:28, skipping insertion in model container [2019-11-28 15:44:28,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:26" (2/3) ... [2019-11-28 15:44:28,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274a2ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:44:28, skipping insertion in model container [2019-11-28 15:44:28,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:44:28" (3/3) ... [2019-11-28 15:44:28,377 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label15.c [2019-11-28 15:44:28,388 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:44:28,396 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:44:28,412 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:44:28,445 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:44:28,446 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:44:28,446 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:44:28,446 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:44:28,447 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:44:28,447 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:44:28,447 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:44:28,448 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:44:28,473 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-11-28 15:44:28,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-28 15:44:28,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:28,490 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:44:28,491 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:28,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:28,499 INFO L82 PathProgramCache]: Analyzing trace with hash -648019827, now seen corresponding path program 1 times [2019-11-28 15:44:28,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:28,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143381901] [2019-11-28 15:44:28,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:29,024 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-28 15:44:29,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143381901] [2019-11-28 15:44:29,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:29,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:44:29,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514392986] [2019-11-28 15:44:29,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:44:29,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:29,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:44:29,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:44:29,056 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-11-28 15:44:30,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:30,679 INFO L93 Difference]: Finished difference Result 789 states and 1377 transitions. [2019-11-28 15:44:30,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:44:30,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-11-28 15:44:30,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:30,700 INFO L225 Difference]: With dead ends: 789 [2019-11-28 15:44:30,700 INFO L226 Difference]: Without dead ends: 465 [2019-11-28 15:44:30,705 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-28 15:44:30,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-11-28 15:44:30,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 309. [2019-11-28 15:44:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-11-28 15:44:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 453 transitions. [2019-11-28 15:44:30,776 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 453 transitions. Word has length 130 [2019-11-28 15:44:30,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:30,777 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 453 transitions. [2019-11-28 15:44:30,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:44:30,777 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 453 transitions. [2019-11-28 15:44:30,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-28 15:44:30,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:30,781 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:44:30,781 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:30,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:30,782 INFO L82 PathProgramCache]: Analyzing trace with hash 208795960, now seen corresponding path program 1 times [2019-11-28 15:44:30,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:30,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962148354] [2019-11-28 15:44:30,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:44:31,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962148354] [2019-11-28 15:44:31,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:31,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:44:31,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278273805] [2019-11-28 15:44:31,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:44:31,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:31,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:44:31,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:44:31,005 INFO L87 Difference]: Start difference. First operand 309 states and 453 transitions. Second operand 4 states. [2019-11-28 15:44:31,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:31,840 INFO L93 Difference]: Finished difference Result 980 states and 1479 transitions. [2019-11-28 15:44:31,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:44:31,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-28 15:44:31,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:31,845 INFO L225 Difference]: With dead ends: 980 [2019-11-28 15:44:31,846 INFO L226 Difference]: Without dead ends: 590 [2019-11-28 15:44:31,849 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-28 15:44:31,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-11-28 15:44:31,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-11-28 15:44:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-11-28 15:44:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 788 transitions. [2019-11-28 15:44:31,896 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 788 transitions. Word has length 134 [2019-11-28 15:44:31,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:31,896 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 788 transitions. [2019-11-28 15:44:31,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:44:31,897 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 788 transitions. [2019-11-28 15:44:31,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-28 15:44:31,907 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:31,908 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:44:31,908 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:31,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:31,910 INFO L82 PathProgramCache]: Analyzing trace with hash -402206747, now seen corresponding path program 1 times [2019-11-28 15:44:31,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:31,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253416373] [2019-11-28 15:44:31,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:32,026 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 15:44:32,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253416373] [2019-11-28 15:44:32,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:32,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:44:32,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736393811] [2019-11-28 15:44:32,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:44:32,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:32,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:44:32,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:44:32,029 INFO L87 Difference]: Start difference. First operand 590 states and 788 transitions. Second operand 4 states. [2019-11-28 15:44:32,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:32,930 INFO L93 Difference]: Finished difference Result 2306 states and 3087 transitions. [2019-11-28 15:44:32,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:44:32,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-11-28 15:44:32,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:32,940 INFO L225 Difference]: With dead ends: 2306 [2019-11-28 15:44:32,941 INFO L226 Difference]: Without dead ends: 1718 [2019-11-28 15:44:32,942 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-28 15:44:32,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2019-11-28 15:44:32,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1572. [2019-11-28 15:44:32,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-11-28 15:44:32,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 1965 transitions. [2019-11-28 15:44:32,988 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 1965 transitions. Word has length 160 [2019-11-28 15:44:32,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:32,989 INFO L462 AbstractCegarLoop]: Abstraction has 1572 states and 1965 transitions. [2019-11-28 15:44:32,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:44:32,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 1965 transitions. [2019-11-28 15:44:32,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-28 15:44:32,994 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:32,995 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:44:32,995 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:32,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:32,996 INFO L82 PathProgramCache]: Analyzing trace with hash 864996295, now seen corresponding path program 1 times [2019-11-28 15:44:32,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:32,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099609259] [2019-11-28 15:44:32,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:33,107 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 15:44:33,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099609259] [2019-11-28 15:44:33,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:33,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:44:33,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151373212] [2019-11-28 15:44:33,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:44:33,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:33,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:44:33,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:44:33,111 INFO L87 Difference]: Start difference. First operand 1572 states and 1965 transitions. Second operand 4 states. [2019-11-28 15:44:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:34,092 INFO L93 Difference]: Finished difference Result 4277 states and 5403 transitions. [2019-11-28 15:44:34,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:44:34,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-11-28 15:44:34,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:34,106 INFO L225 Difference]: With dead ends: 4277 [2019-11-28 15:44:34,107 INFO L226 Difference]: Without dead ends: 2707 [2019-11-28 15:44:34,110 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-28 15:44:34,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2707 states. [2019-11-28 15:44:34,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2707 to 1855. [2019-11-28 15:44:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1855 states. [2019-11-28 15:44:34,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1855 states and 2281 transitions. [2019-11-28 15:44:34,161 INFO L78 Accepts]: Start accepts. Automaton has 1855 states and 2281 transitions. Word has length 168 [2019-11-28 15:44:34,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:34,161 INFO L462 AbstractCegarLoop]: Abstraction has 1855 states and 2281 transitions. [2019-11-28 15:44:34,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:44:34,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 2281 transitions. [2019-11-28 15:44:34,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-28 15:44:34,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:34,168 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:44:34,168 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:34,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:34,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1353288396, now seen corresponding path program 1 times [2019-11-28 15:44:34,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:34,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174559782] [2019-11-28 15:44:34,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:44:34,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174559782] [2019-11-28 15:44:34,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546402907] [2019-11-28 15:44:34,345 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-28 15:44:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:34,424 INFO L264 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:44:34,441 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:44:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-28 15:44:34,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:44:34,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2019-11-28 15:44:34,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291463129] [2019-11-28 15:44:34,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:44:34,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:34,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:44:34,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:44:34,550 INFO L87 Difference]: Start difference. First operand 1855 states and 2281 transitions. Second operand 3 states. [2019-11-28 15:44:35,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:35,285 INFO L93 Difference]: Finished difference Result 4267 states and 5231 transitions. [2019-11-28 15:44:35,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:44:35,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-11-28 15:44:35,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:35,300 INFO L225 Difference]: With dead ends: 4267 [2019-11-28 15:44:35,301 INFO L226 Difference]: Without dead ends: 2414 [2019-11-28 15:44:35,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:44:35,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-11-28 15:44:35,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 1994. [2019-11-28 15:44:35,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2019-11-28 15:44:35,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 2442 transitions. [2019-11-28 15:44:35,374 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 2442 transitions. Word has length 171 [2019-11-28 15:44:35,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:35,376 INFO L462 AbstractCegarLoop]: Abstraction has 1994 states and 2442 transitions. [2019-11-28 15:44:35,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:44:35,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2442 transitions. [2019-11-28 15:44:35,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-28 15:44:35,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:35,383 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:44:35,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:44:35,589 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:35,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:35,589 INFO L82 PathProgramCache]: Analyzing trace with hash 141468647, now seen corresponding path program 1 times [2019-11-28 15:44:35,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:35,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335021541] [2019-11-28 15:44:35,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 15:44:35,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335021541] [2019-11-28 15:44:35,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:35,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:44:35,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605052995] [2019-11-28 15:44:35,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:44:35,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:35,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:44:35,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:44:35,700 INFO L87 Difference]: Start difference. First operand 1994 states and 2442 transitions. Second operand 3 states. [2019-11-28 15:44:36,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:36,213 INFO L93 Difference]: Finished difference Result 4272 states and 5182 transitions. [2019-11-28 15:44:36,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:44:36,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-11-28 15:44:36,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:36,225 INFO L225 Difference]: With dead ends: 4272 [2019-11-28 15:44:36,225 INFO L226 Difference]: Without dead ends: 2140 [2019-11-28 15:44:36,229 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-28 15:44:36,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-11-28 15:44:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1994. [2019-11-28 15:44:36,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2019-11-28 15:44:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 2341 transitions. [2019-11-28 15:44:36,272 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 2341 transitions. Word has length 181 [2019-11-28 15:44:36,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:36,273 INFO L462 AbstractCegarLoop]: Abstraction has 1994 states and 2341 transitions. [2019-11-28 15:44:36,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:44:36,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2341 transitions. [2019-11-28 15:44:36,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-28 15:44:36,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:36,278 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:44:36,279 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:36,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:36,279 INFO L82 PathProgramCache]: Analyzing trace with hash -99265028, now seen corresponding path program 1 times [2019-11-28 15:44:36,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:36,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940890573] [2019-11-28 15:44:36,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:36,360 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 15:44:36,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940890573] [2019-11-28 15:44:36,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:36,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:44:36,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529770649] [2019-11-28 15:44:36,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:44:36,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:36,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:44:36,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:44:36,364 INFO L87 Difference]: Start difference. First operand 1994 states and 2341 transitions. Second operand 3 states. [2019-11-28 15:44:36,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:36,859 INFO L93 Difference]: Finished difference Result 4822 states and 5634 transitions. [2019-11-28 15:44:36,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:44:36,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-11-28 15:44:36,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:36,870 INFO L225 Difference]: With dead ends: 4822 [2019-11-28 15:44:36,871 INFO L226 Difference]: Without dead ends: 2129 [2019-11-28 15:44:36,874 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-28 15:44:36,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2019-11-28 15:44:36,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1989. [2019-11-28 15:44:36,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-11-28 15:44:36,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2227 transitions. [2019-11-28 15:44:36,910 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2227 transitions. Word has length 183 [2019-11-28 15:44:36,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:36,911 INFO L462 AbstractCegarLoop]: Abstraction has 1989 states and 2227 transitions. [2019-11-28 15:44:36,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:44:36,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2227 transitions. [2019-11-28 15:44:36,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-28 15:44:36,916 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:36,917 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:44:36,917 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:36,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:36,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1648518522, now seen corresponding path program 1 times [2019-11-28 15:44:36,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:36,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412256162] [2019-11-28 15:44:36,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:37,061 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 86 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-28 15:44:37,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412256162] [2019-11-28 15:44:37,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610186612] [2019-11-28 15:44:37,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:44:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:37,150 INFO L264 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:44:37,156 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:44:37,249 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-28 15:44:37,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:44:37,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2019-11-28 15:44:37,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210801907] [2019-11-28 15:44:37,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:44:37,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:37,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:44:37,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:44:37,263 INFO L87 Difference]: Start difference. First operand 1989 states and 2227 transitions. Second operand 3 states. [2019-11-28 15:44:37,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:37,502 INFO L93 Difference]: Finished difference Result 3545 states and 3921 transitions. [2019-11-28 15:44:37,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:44:37,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-28 15:44:37,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:37,508 INFO L225 Difference]: With dead ends: 3545 [2019-11-28 15:44:37,508 INFO L226 Difference]: Without dead ends: 1274 [2019-11-28 15:44:37,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:44:37,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-11-28 15:44:37,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1274. [2019-11-28 15:44:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-11-28 15:44:37,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1372 transitions. [2019-11-28 15:44:37,538 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1372 transitions. Word has length 198 [2019-11-28 15:44:37,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:37,539 INFO L462 AbstractCegarLoop]: Abstraction has 1274 states and 1372 transitions. [2019-11-28 15:44:37,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:44:37,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1372 transitions. [2019-11-28 15:44:37,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-28 15:44:37,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:37,544 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-28 15:44:37,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:44:37,748 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:37,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:37,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1576967456, now seen corresponding path program 1 times [2019-11-28 15:44:37,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:37,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061467884] [2019-11-28 15:44:37,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:37,964 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:44:37,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061467884] [2019-11-28 15:44:37,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:37,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 15:44:37,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064984077] [2019-11-28 15:44:37,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 15:44:37,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:37,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 15:44:37,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:44:37,968 INFO L87 Difference]: Start difference. First operand 1274 states and 1372 transitions. Second operand 7 states. [2019-11-28 15:44:39,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:39,187 INFO L93 Difference]: Finished difference Result 2710 states and 2934 transitions. [2019-11-28 15:44:39,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 15:44:39,187 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 203 [2019-11-28 15:44:39,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:39,193 INFO L225 Difference]: With dead ends: 2710 [2019-11-28 15:44:39,194 INFO L226 Difference]: Without dead ends: 1295 [2019-11-28 15:44:39,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-28 15:44:39,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2019-11-28 15:44:39,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1274. [2019-11-28 15:44:39,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-11-28 15:44:39,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1333 transitions. [2019-11-28 15:44:39,220 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1333 transitions. Word has length 203 [2019-11-28 15:44:39,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:39,220 INFO L462 AbstractCegarLoop]: Abstraction has 1274 states and 1333 transitions. [2019-11-28 15:44:39,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 15:44:39,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1333 transitions. [2019-11-28 15:44:39,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-28 15:44:39,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:39,225 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-28 15:44:39,226 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:39,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:39,226 INFO L82 PathProgramCache]: Analyzing trace with hash -473711658, now seen corresponding path program 1 times [2019-11-28 15:44:39,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:39,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332889019] [2019-11-28 15:44:39,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:44:39,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332889019] [2019-11-28 15:44:39,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:39,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:44:39,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012066726] [2019-11-28 15:44:39,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:44:39,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:39,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:44:39,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:44:39,372 INFO L87 Difference]: Start difference. First operand 1274 states and 1333 transitions. Second operand 4 states. [2019-11-28 15:44:40,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:40,121 INFO L93 Difference]: Finished difference Result 2688 states and 2810 transitions. [2019-11-28 15:44:40,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:44:40,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2019-11-28 15:44:40,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:40,128 INFO L225 Difference]: With dead ends: 2688 [2019-11-28 15:44:40,128 INFO L226 Difference]: Without dead ends: 1416 [2019-11-28 15:44:40,130 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-28 15:44:40,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2019-11-28 15:44:40,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1274. [2019-11-28 15:44:40,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-11-28 15:44:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1316 transitions. [2019-11-28 15:44:40,155 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1316 transitions. Word has length 207 [2019-11-28 15:44:40,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:40,156 INFO L462 AbstractCegarLoop]: Abstraction has 1274 states and 1316 transitions. [2019-11-28 15:44:40,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:44:40,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1316 transitions. [2019-11-28 15:44:40,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-28 15:44:40,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:40,162 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:44:40,162 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:40,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:40,163 INFO L82 PathProgramCache]: Analyzing trace with hash 283278328, now seen corresponding path program 1 times [2019-11-28 15:44:40,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:40,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807841769] [2019-11-28 15:44:40,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-28 15:44:40,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807841769] [2019-11-28 15:44:40,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:40,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:44:40,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483783589] [2019-11-28 15:44:40,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:44:40,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:40,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:44:40,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:44:40,369 INFO L87 Difference]: Start difference. First operand 1274 states and 1316 transitions. Second operand 4 states. [2019-11-28 15:44:41,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:41,199 INFO L93 Difference]: Finished difference Result 2543 states and 2631 transitions. [2019-11-28 15:44:41,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:44:41,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-11-28 15:44:41,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:41,201 INFO L225 Difference]: With dead ends: 2543 [2019-11-28 15:44:41,201 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:44:41,205 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-28 15:44:41,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:44:41,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:44:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:44:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:44:41,207 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 228 [2019-11-28 15:44:41,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:41,208 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:44:41,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:44:41,208 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:44:41,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:44:41,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:44:41,862 WARN L192 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2019-11-28 15:44:42,316 WARN L192 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2019-11-28 15:44:42,321 INFO L246 CegarLoopResult]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,321 INFO L246 CegarLoopResult]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,321 INFO L246 CegarLoopResult]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,322 INFO L246 CegarLoopResult]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-28 15:44:42,322 INFO L246 CegarLoopResult]: For program point L565(line 565) no Hoare annotation was computed. [2019-11-28 15:44:42,322 INFO L246 CegarLoopResult]: For program point L499(line 499) no Hoare annotation was computed. [2019-11-28 15:44:42,322 INFO L246 CegarLoopResult]: For program point L433(line 433) no Hoare annotation was computed. [2019-11-28 15:44:42,322 INFO L246 CegarLoopResult]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-28 15:44:42,322 INFO L246 CegarLoopResult]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-28 15:44:42,322 INFO L246 CegarLoopResult]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-28 15:44:42,322 INFO L246 CegarLoopResult]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,322 INFO L246 CegarLoopResult]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,323 INFO L246 CegarLoopResult]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,323 INFO L246 CegarLoopResult]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-28 15:44:42,323 INFO L246 CegarLoopResult]: For program point L568(line 568) no Hoare annotation was computed. [2019-11-28 15:44:42,323 INFO L246 CegarLoopResult]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-28 15:44:42,323 INFO L246 CegarLoopResult]: For program point L436(line 436) no Hoare annotation was computed. [2019-11-28 15:44:42,323 INFO L246 CegarLoopResult]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-11-28 15:44:42,323 INFO L246 CegarLoopResult]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-11-28 15:44:42,323 INFO L246 CegarLoopResult]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-28 15:44:42,323 INFO L246 CegarLoopResult]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,329 INFO L246 CegarLoopResult]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,329 INFO L246 CegarLoopResult]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,329 INFO L246 CegarLoopResult]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-28 15:44:42,329 INFO L246 CegarLoopResult]: For program point L571(line 571) no Hoare annotation was computed. [2019-11-28 15:44:42,329 INFO L246 CegarLoopResult]: For program point L505(line 505) no Hoare annotation was computed. [2019-11-28 15:44:42,330 INFO L246 CegarLoopResult]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-28 15:44:42,330 INFO L246 CegarLoopResult]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-28 15:44:42,330 INFO L246 CegarLoopResult]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,330 INFO L246 CegarLoopResult]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,330 INFO L246 CegarLoopResult]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,331 INFO L246 CegarLoopResult]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-28 15:44:42,331 INFO L246 CegarLoopResult]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-28 15:44:42,331 INFO L246 CegarLoopResult]: For program point L574(line 574) no Hoare annotation was computed. [2019-11-28 15:44:42,331 INFO L246 CegarLoopResult]: For program point L508(line 508) no Hoare annotation was computed. [2019-11-28 15:44:42,331 INFO L246 CegarLoopResult]: For program point L442(line 442) no Hoare annotation was computed. [2019-11-28 15:44:42,331 INFO L246 CegarLoopResult]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-28 15:44:42,332 INFO L246 CegarLoopResult]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-28 15:44:42,332 INFO L246 CegarLoopResult]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-28 15:44:42,332 INFO L246 CegarLoopResult]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,332 INFO L246 CegarLoopResult]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,332 INFO L246 CegarLoopResult]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,332 INFO L246 CegarLoopResult]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-28 15:44:42,333 INFO L246 CegarLoopResult]: For program point L577(line 577) no Hoare annotation was computed. [2019-11-28 15:44:42,333 INFO L246 CegarLoopResult]: For program point L511(line 511) no Hoare annotation was computed. [2019-11-28 15:44:42,333 INFO L246 CegarLoopResult]: For program point L445(line 445) no Hoare annotation was computed. [2019-11-28 15:44:42,333 INFO L246 CegarLoopResult]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-28 15:44:42,333 INFO L246 CegarLoopResult]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-28 15:44:42,333 INFO L246 CegarLoopResult]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-28 15:44:42,334 INFO L246 CegarLoopResult]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-28 15:44:42,334 INFO L246 CegarLoopResult]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,334 INFO L246 CegarLoopResult]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,334 INFO L246 CegarLoopResult]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,334 INFO L246 CegarLoopResult]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-11-28 15:44:42,334 INFO L246 CegarLoopResult]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-11-28 15:44:42,335 INFO L246 CegarLoopResult]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-11-28 15:44:42,335 INFO L246 CegarLoopResult]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-11-28 15:44:42,335 INFO L246 CegarLoopResult]: For program point L580(line 580) no Hoare annotation was computed. [2019-11-28 15:44:42,335 INFO L246 CegarLoopResult]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-28 15:44:42,336 INFO L246 CegarLoopResult]: For program point L448(line 448) no Hoare annotation was computed. [2019-11-28 15:44:42,336 INFO L246 CegarLoopResult]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-28 15:44:42,336 INFO L246 CegarLoopResult]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-28 15:44:42,336 INFO L246 CegarLoopResult]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,336 INFO L246 CegarLoopResult]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,337 INFO L246 CegarLoopResult]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,337 INFO L246 CegarLoopResult]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-28 15:44:42,337 INFO L246 CegarLoopResult]: For program point L583(line 583) no Hoare annotation was computed. [2019-11-28 15:44:42,337 INFO L246 CegarLoopResult]: For program point L517(line 517) no Hoare annotation was computed. [2019-11-28 15:44:42,337 INFO L246 CegarLoopResult]: For program point L451(line 451) no Hoare annotation was computed. [2019-11-28 15:44:42,338 INFO L246 CegarLoopResult]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-28 15:44:42,338 INFO L246 CegarLoopResult]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-28 15:44:42,338 INFO L246 CegarLoopResult]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,338 INFO L246 CegarLoopResult]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,338 INFO L246 CegarLoopResult]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,338 INFO L246 CegarLoopResult]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-28 15:44:42,339 INFO L246 CegarLoopResult]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-28 15:44:42,339 INFO L246 CegarLoopResult]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-28 15:44:42,339 INFO L246 CegarLoopResult]: For program point L520(line 520) no Hoare annotation was computed. [2019-11-28 15:44:42,339 INFO L246 CegarLoopResult]: For program point L454(line 454) no Hoare annotation was computed. [2019-11-28 15:44:42,339 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:44:42,339 INFO L246 CegarLoopResult]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-28 15:44:42,340 INFO L246 CegarLoopResult]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-28 15:44:42,340 INFO L246 CegarLoopResult]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-28 15:44:42,340 INFO L246 CegarLoopResult]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,340 INFO L246 CegarLoopResult]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,341 INFO L246 CegarLoopResult]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,341 INFO L246 CegarLoopResult]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-28 15:44:42,341 INFO L246 CegarLoopResult]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-28 15:44:42,342 INFO L246 CegarLoopResult]: For program point L457(line 457) no Hoare annotation was computed. [2019-11-28 15:44:42,342 INFO L246 CegarLoopResult]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-28 15:44:42,342 INFO L246 CegarLoopResult]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-28 15:44:42,342 INFO L246 CegarLoopResult]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,342 INFO L246 CegarLoopResult]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,342 INFO L246 CegarLoopResult]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,343 INFO L246 CegarLoopResult]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-28 15:44:42,343 INFO L246 CegarLoopResult]: For program point L592(line 592) no Hoare annotation was computed. [2019-11-28 15:44:42,343 INFO L246 CegarLoopResult]: For program point L526(line 526) no Hoare annotation was computed. [2019-11-28 15:44:42,343 INFO L246 CegarLoopResult]: For program point L460(line 460) no Hoare annotation was computed. [2019-11-28 15:44:42,343 INFO L246 CegarLoopResult]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-28 15:44:42,343 INFO L246 CegarLoopResult]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-28 15:44:42,344 INFO L246 CegarLoopResult]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-11-28 15:44:42,344 INFO L246 CegarLoopResult]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-11-28 15:44:42,344 INFO L246 CegarLoopResult]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-28 15:44:42,344 INFO L246 CegarLoopResult]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-28 15:44:42,344 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 15:44:42,345 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 562) no Hoare annotation was computed. [2019-11-28 15:44:42,345 INFO L246 CegarLoopResult]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-11-28 15:44:42,345 INFO L246 CegarLoopResult]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,345 INFO L246 CegarLoopResult]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,345 INFO L246 CegarLoopResult]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-28 15:44:42,345 INFO L246 CegarLoopResult]: For program point L595(line 595) no Hoare annotation was computed. [2019-11-28 15:44:42,346 INFO L246 CegarLoopResult]: For program point L529(line 529) no Hoare annotation was computed. [2019-11-28 15:44:42,346 INFO L246 CegarLoopResult]: For program point L463(line 463) no Hoare annotation was computed. [2019-11-28 15:44:42,346 INFO L246 CegarLoopResult]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-28 15:44:42,346 INFO L246 CegarLoopResult]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-28 15:44:42,346 INFO L246 CegarLoopResult]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-11-28 15:44:42,347 INFO L246 CegarLoopResult]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-11-28 15:44:42,347 INFO L246 CegarLoopResult]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-28 15:44:42,349 INFO L242 CegarLoopResult]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse7 (= ~a25~0 1)) (.cse5 (= ~a19~0 1))) (let ((.cse11 (= ~a28~0 9)) (.cse14 (= ~a28~0 10)) (.cse0 (not .cse5)) (.cse12 (not .cse7)) (.cse3 (not (= ~a28~0 11)))) (let ((.cse9 (or (and (<= ~a19~0 0) .cse12) (and .cse0 .cse12 .cse3))) (.cse13 (= ~a28~0 7)) (.cse4 (= ~a17~0 8)) (.cse6 (= ~a21~0 1)) (.cse10 (not .cse14)) (.cse1 (<= 8 ~a17~0)) (.cse8 (<= ~a17~0 8)) (.cse15 (not .cse11)) (.cse2 (= ~a11~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse4 .cse6) (and .cse4 .cse13 .cse6) (and .cse2 .cse9) (and .cse13 .cse8 .cse2) (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse14 .cse4 .cse5 .cse6) (and .cse12 .cse8 .cse2) (and .cse1 .cse8 .cse7 .cse15 .cse3 .cse10) (and .cse0 .cse1 .cse8 .cse7 .cse15 .cse3) (and .cse11 .cse0 .cse2 .cse3))))) [2019-11-28 15:44:42,349 INFO L246 CegarLoopResult]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,350 INFO L246 CegarLoopResult]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,350 INFO L246 CegarLoopResult]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-28 15:44:42,350 INFO L246 CegarLoopResult]: For program point L532(line 532) no Hoare annotation was computed. [2019-11-28 15:44:42,350 INFO L246 CegarLoopResult]: For program point L466(line 466) no Hoare annotation was computed. [2019-11-28 15:44:42,350 INFO L246 CegarLoopResult]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-28 15:44:42,350 INFO L246 CegarLoopResult]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-11-28 15:44:42,351 INFO L246 CegarLoopResult]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-11-28 15:44:42,351 INFO L249 CegarLoopResult]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-28 15:44:42,351 INFO L246 CegarLoopResult]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,351 INFO L246 CegarLoopResult]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,351 INFO L246 CegarLoopResult]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-28 15:44:42,352 INFO L246 CegarLoopResult]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-28 15:44:42,352 INFO L246 CegarLoopResult]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-28 15:44:42,352 INFO L246 CegarLoopResult]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-28 15:44:42,352 INFO L246 CegarLoopResult]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-28 15:44:42,352 INFO L246 CegarLoopResult]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-28 15:44:42,352 INFO L246 CegarLoopResult]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-28 15:44:42,353 INFO L246 CegarLoopResult]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-11-28 15:44:42,353 INFO L246 CegarLoopResult]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-28 15:44:42,353 INFO L246 CegarLoopResult]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,353 INFO L246 CegarLoopResult]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,353 INFO L246 CegarLoopResult]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-28 15:44:42,354 INFO L246 CegarLoopResult]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-11-28 15:44:42,354 INFO L246 CegarLoopResult]: For program point L538(line 538) no Hoare annotation was computed. [2019-11-28 15:44:42,354 INFO L246 CegarLoopResult]: For program point L472(line 472) no Hoare annotation was computed. [2019-11-28 15:44:42,354 INFO L246 CegarLoopResult]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-28 15:44:42,354 INFO L246 CegarLoopResult]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-28 15:44:42,355 INFO L242 CegarLoopResult]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse7 (= ~a25~0 1)) (.cse5 (= ~a19~0 1))) (let ((.cse11 (= ~a28~0 9)) (.cse14 (= ~a28~0 10)) (.cse0 (not .cse5)) (.cse12 (not .cse7)) (.cse3 (not (= ~a28~0 11)))) (let ((.cse9 (or (and (<= ~a19~0 0) .cse12) (and .cse0 .cse12 .cse3))) (.cse13 (= ~a28~0 7)) (.cse4 (= ~a17~0 8)) (.cse6 (= ~a21~0 1)) (.cse10 (not .cse14)) (.cse1 (<= 8 ~a17~0)) (.cse8 (<= ~a17~0 8)) (.cse15 (not .cse11)) (.cse2 (= ~a11~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse4 .cse6) (and .cse4 .cse13 .cse6) (and .cse2 .cse9) (and .cse13 .cse8 .cse2) (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse14 .cse4 .cse5 .cse6) (and .cse12 .cse8 .cse2) (and .cse1 .cse8 .cse7 .cse15 .cse3 .cse10) (and .cse0 .cse1 .cse8 .cse7 .cse15 .cse3) (and .cse11 .cse0 .cse2 .cse3))))) [2019-11-28 15:44:42,355 INFO L246 CegarLoopResult]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,356 INFO L246 CegarLoopResult]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,356 INFO L246 CegarLoopResult]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-28 15:44:42,356 INFO L246 CegarLoopResult]: For program point L541(line 541) no Hoare annotation was computed. [2019-11-28 15:44:42,356 INFO L246 CegarLoopResult]: For program point L475(line 475) no Hoare annotation was computed. [2019-11-28 15:44:42,356 INFO L246 CegarLoopResult]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-28 15:44:42,357 INFO L246 CegarLoopResult]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-28 15:44:42,357 INFO L246 CegarLoopResult]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,357 INFO L246 CegarLoopResult]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,357 INFO L246 CegarLoopResult]: For program point L544(line 544) no Hoare annotation was computed. [2019-11-28 15:44:42,357 INFO L246 CegarLoopResult]: For program point L478(line 478) no Hoare annotation was computed. [2019-11-28 15:44:42,358 INFO L246 CegarLoopResult]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-28 15:44:42,358 INFO L246 CegarLoopResult]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-28 15:44:42,358 INFO L246 CegarLoopResult]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-28 15:44:42,358 INFO L246 CegarLoopResult]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-28 15:44:42,359 INFO L246 CegarLoopResult]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-28 15:44:42,359 INFO L246 CegarLoopResult]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-11-28 15:44:42,359 INFO L246 CegarLoopResult]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-11-28 15:44:42,359 INFO L246 CegarLoopResult]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,359 INFO L246 CegarLoopResult]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,359 INFO L246 CegarLoopResult]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-28 15:44:42,360 INFO L246 CegarLoopResult]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,360 INFO L246 CegarLoopResult]: For program point L547(line 547) no Hoare annotation was computed. [2019-11-28 15:44:42,360 INFO L246 CegarLoopResult]: For program point L481(line 481) no Hoare annotation was computed. [2019-11-28 15:44:42,360 INFO L246 CegarLoopResult]: For program point L415(line 415) no Hoare annotation was computed. [2019-11-28 15:44:42,360 INFO L246 CegarLoopResult]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-28 15:44:42,360 INFO L246 CegarLoopResult]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-28 15:44:42,361 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:44:42,361 INFO L246 CegarLoopResult]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-28 15:44:42,361 INFO L246 CegarLoopResult]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,361 INFO L246 CegarLoopResult]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,361 INFO L246 CegarLoopResult]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,362 INFO L246 CegarLoopResult]: For program point L550(line 550) no Hoare annotation was computed. [2019-11-28 15:44:42,362 INFO L246 CegarLoopResult]: For program point L484(line 484) no Hoare annotation was computed. [2019-11-28 15:44:42,362 INFO L246 CegarLoopResult]: For program point L418(line 418) no Hoare annotation was computed. [2019-11-28 15:44:42,362 INFO L246 CegarLoopResult]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-28 15:44:42,362 INFO L246 CegarLoopResult]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-28 15:44:42,362 INFO L246 CegarLoopResult]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,363 INFO L246 CegarLoopResult]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,363 INFO L246 CegarLoopResult]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,363 INFO L246 CegarLoopResult]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-28 15:44:42,363 INFO L246 CegarLoopResult]: For program point L553(line 553) no Hoare annotation was computed. [2019-11-28 15:44:42,363 INFO L246 CegarLoopResult]: For program point L487(line 487) no Hoare annotation was computed. [2019-11-28 15:44:42,364 INFO L246 CegarLoopResult]: For program point L421(line 421) no Hoare annotation was computed. [2019-11-28 15:44:42,364 INFO L246 CegarLoopResult]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-28 15:44:42,364 INFO L246 CegarLoopResult]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-28 15:44:42,364 INFO L246 CegarLoopResult]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,365 INFO L246 CegarLoopResult]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,365 INFO L246 CegarLoopResult]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,365 INFO L246 CegarLoopResult]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-28 15:44:42,366 INFO L246 CegarLoopResult]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-28 15:44:42,366 INFO L246 CegarLoopResult]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-28 15:44:42,366 INFO L246 CegarLoopResult]: For program point L556(line 556) no Hoare annotation was computed. [2019-11-28 15:44:42,366 INFO L246 CegarLoopResult]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-28 15:44:42,367 INFO L246 CegarLoopResult]: For program point L424(line 424) no Hoare annotation was computed. [2019-11-28 15:44:42,367 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:44:42,367 INFO L246 CegarLoopResult]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-28 15:44:42,367 INFO L246 CegarLoopResult]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-28 15:44:42,368 INFO L246 CegarLoopResult]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,368 INFO L246 CegarLoopResult]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,368 INFO L246 CegarLoopResult]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,369 INFO L246 CegarLoopResult]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-28 15:44:42,369 INFO L246 CegarLoopResult]: For program point L559(line 559) no Hoare annotation was computed. [2019-11-28 15:44:42,369 INFO L246 CegarLoopResult]: For program point L493(line 493) no Hoare annotation was computed. [2019-11-28 15:44:42,369 INFO L246 CegarLoopResult]: For program point L427(line 427) no Hoare annotation was computed. [2019-11-28 15:44:42,370 INFO L246 CegarLoopResult]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-28 15:44:42,370 INFO L246 CegarLoopResult]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,370 INFO L246 CegarLoopResult]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,370 INFO L246 CegarLoopResult]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:42,371 INFO L246 CegarLoopResult]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-28 15:44:42,371 INFO L246 CegarLoopResult]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-28 15:44:42,371 INFO L246 CegarLoopResult]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-28 15:44:42,371 INFO L246 CegarLoopResult]: For program point L562(line 562) no Hoare annotation was computed. [2019-11-28 15:44:42,372 INFO L246 CegarLoopResult]: For program point L496(line 496) no Hoare annotation was computed. [2019-11-28 15:44:42,372 INFO L246 CegarLoopResult]: For program point L430(line 430) no Hoare annotation was computed. [2019-11-28 15:44:42,372 INFO L246 CegarLoopResult]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-11-28 15:44:42,373 INFO L246 CegarLoopResult]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-28 15:44:42,373 INFO L246 CegarLoopResult]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-11-28 15:44:42,373 INFO L246 CegarLoopResult]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-28 15:44:42,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:44:42 BoogieIcfgContainer [2019-11-28 15:44:42,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:44:42,431 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:44:42,431 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:44:42,431 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:44:42,432 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:44:28" (3/4) ... [2019-11-28 15:44:42,437 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:44:42,463 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 15:44:42,465 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:44:42,743 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:44:42,743 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:44:42,746 INFO L168 Benchmark]: Toolchain (without parser) took 16738.47 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 451.4 MB). Free memory was 952.3 MB in the beginning and 1.0 GB in the end (delta: -67.6 MB). Peak memory consumption was 383.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:42,746 INFO L168 Benchmark]: CDTParser took 0.22 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-28 15:44:42,748 INFO L168 Benchmark]: CACSL2BoogieTranslator took 727.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -165.4 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:42,749 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.90 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:42,749 INFO L168 Benchmark]: Boogie Preprocessor took 112.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:44:42,750 INFO L168 Benchmark]: RCFGBuilder took 1423.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.4 MB). Peak memory consumption was 103.4 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:42,751 INFO L168 Benchmark]: TraceAbstraction took 14061.13 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 301.5 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -36.3 MB). Peak memory consumption was 265.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:42,752 INFO L168 Benchmark]: Witness Printer took 312.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:42,755 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.22 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 727.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -165.4 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.90 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 112.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1423.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.4 MB). Peak memory consumption was 103.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14061.13 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 301.5 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -36.3 MB). Peak memory consumption was 265.1 MB. Max. memory is 11.5 GB. * Witness Printer took 312.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 562]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((((!(a19 == 1) && 8 <= a17) && a11 == 1) && !(a28 == 11)) || (((a17 == 8 && a19 == 1) && a21 == 1) && a25 == 1)) || ((a17 <= 8 && ((a19 <= 0 && !(a25 == 1)) || ((!(a19 == 1) && !(a25 == 1)) && !(a28 == 11)))) && !(a28 == 10))) || (((a28 == 9 && !(a25 == 1)) && a17 == 8) && a21 == 1)) || ((a17 == 8 && a28 == 7) && a21 == 1)) || (a11 == 1 && ((a19 <= 0 && !(a25 == 1)) || ((!(a19 == 1) && !(a25 == 1)) && !(a28 == 11))))) || ((a28 == 7 && a17 <= 8) && a11 == 1)) || ((((!(5 == input) && a28 == 10) && a17 == 8) && a19 == 1) && a21 == 1)) || ((!(a25 == 1) && a17 <= 8) && a11 == 1)) || (((((8 <= a17 && a17 <= 8) && a25 == 1) && !(a28 == 9)) && !(a28 == 11)) && !(a28 == 10))) || (((((!(a19 == 1) && 8 <= a17) && a17 <= 8) && a25 == 1) && !(a28 == 9)) && !(a28 == 11))) || (((a28 == 9 && !(a19 == 1)) && a11 == 1) && !(a28 == 11)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((((!(a19 == 1) && 8 <= a17) && a11 == 1) && !(a28 == 11)) || (((a17 == 8 && a19 == 1) && a21 == 1) && a25 == 1)) || ((a17 <= 8 && ((a19 <= 0 && !(a25 == 1)) || ((!(a19 == 1) && !(a25 == 1)) && !(a28 == 11)))) && !(a28 == 10))) || (((a28 == 9 && !(a25 == 1)) && a17 == 8) && a21 == 1)) || ((a17 == 8 && a28 == 7) && a21 == 1)) || (a11 == 1 && ((a19 <= 0 && !(a25 == 1)) || ((!(a19 == 1) && !(a25 == 1)) && !(a28 == 11))))) || ((a28 == 7 && a17 <= 8) && a11 == 1)) || ((((!(5 == input) && a28 == 10) && a17 == 8) && a19 == 1) && a21 == 1)) || ((!(a25 == 1) && a17 <= 8) && a11 == 1)) || (((((8 <= a17 && a17 <= 8) && a25 == 1) && !(a28 == 9)) && !(a28 == 11)) && !(a28 == 10))) || (((((!(a19 == 1) && 8 <= a17) && a17 <= 8) && a25 == 1) && !(a28 == 9)) && !(a28 == 11))) || (((a28 == 9 && !(a19 == 1)) && a11 == 1) && !(a28 == 11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 12.7s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, HoareTripleCheckerStatistics: 1262 SDtfs, 2480 SDslu, 295 SDs, 0 SdLazy, 6276 SolverSat, 996 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 417 GetRequests, 381 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1994occurred in iteration=5, 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, 11 MinimizatonAttempts, 2023 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 52 NumberOfFragments, 413 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2056 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1242 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2332 NumberOfCodeBlocks, 2332 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2319 ConstructedInterpolants, 0 QuantifiedInterpolants, 1339968 SizeOfPredicates, 1 NumberOfNonLiveVariables, 641 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 890/896 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...