./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_13e052b0-7c80-4c88-a335-8533d6baf56c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_13e052b0-7c80-4c88-a335-8533d6baf56c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_13e052b0-7c80-4c88-a335-8533d6baf56c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_13e052b0-7c80-4c88-a335-8533d6baf56c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label05.c -s /tmp/vcloud-vcloud-master/worker/run_dir_13e052b0-7c80-4c88-a335-8533d6baf56c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_13e052b0-7c80-4c88-a335-8533d6baf56c/bin/uautomizer --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 6893c9ea3ad65b75d2a8fdb58db378617d0e1a5f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:56:10,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:56:10,968 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:56:10,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:56:10,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:56:10,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:56:10,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:56:10,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:56:10,999 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:56:11,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:56:11,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:56:11,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:56:11,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:56:11,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:56:11,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:56:11,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:56:11,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:56:11,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:56:11,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:56:11,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:56:11,011 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:56:11,015 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:56:11,016 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:56:11,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:56:11,019 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:56:11,019 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:56:11,019 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:56:11,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:56:11,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:56:11,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:56:11,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:56:11,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:56:11,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:56:11,024 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:56:11,025 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:56:11,025 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:56:11,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:56:11,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:56:11,026 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:56:11,027 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:56:11,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:56:11,028 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_13e052b0-7c80-4c88-a335-8533d6baf56c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:56:11,055 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:56:11,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:56:11,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:56:11,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:56:11,057 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:56:11,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:56:11,057 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:56:11,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:56:11,058 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:56:11,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:56:11,059 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:56:11,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:56:11,059 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:56:11,060 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:56:11,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:56:11,060 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:56:11,060 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:56:11,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:56:11,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:56:11,061 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:56:11,061 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:56:11,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:56:11,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:56:11,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:56:11,062 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:56:11,062 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:56:11,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:56:11,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:56:11,063 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_13e052b0-7c80-4c88-a335-8533d6baf56c/bin/uautomizer 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 -> 6893c9ea3ad65b75d2a8fdb58db378617d0e1a5f [2019-11-25 08:56:11,199 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:56:11,210 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:56:11,213 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:56:11,214 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:56:11,215 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:56:11,216 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_13e052b0-7c80-4c88-a335-8533d6baf56c/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label05.c [2019-11-25 08:56:11,279 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_13e052b0-7c80-4c88-a335-8533d6baf56c/bin/uautomizer/data/a295e7d75/11fabab3e6c54d538cd646d20ed6ed04/FLAGacab3f8ff [2019-11-25 08:56:11,732 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:56:11,733 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_13e052b0-7c80-4c88-a335-8533d6baf56c/sv-benchmarks/c/eca-rers2012/Problem01_label05.c [2019-11-25 08:56:11,754 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_13e052b0-7c80-4c88-a335-8533d6baf56c/bin/uautomizer/data/a295e7d75/11fabab3e6c54d538cd646d20ed6ed04/FLAGacab3f8ff [2019-11-25 08:56:12,099 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_13e052b0-7c80-4c88-a335-8533d6baf56c/bin/uautomizer/data/a295e7d75/11fabab3e6c54d538cd646d20ed6ed04 [2019-11-25 08:56:12,101 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:56:12,102 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:56:12,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:56:12,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:56:12,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:56:12,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:56:12" (1/1) ... [2019-11-25 08:56:12,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50bd8770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12, skipping insertion in model container [2019-11-25 08:56:12,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:56:12" (1/1) ... [2019-11-25 08:56:12,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:56:12,173 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:56:12,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:56:12,589 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:56:12,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:56:12,733 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:56:12,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12 WrapperNode [2019-11-25 08:56:12,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:56:12,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:56:12,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:56:12,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:56:12,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12" (1/1) ... [2019-11-25 08:56:12,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12" (1/1) ... [2019-11-25 08:56:12,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:56:12,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:56:12,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:56:12,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:56:12,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12" (1/1) ... [2019-11-25 08:56:12,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12" (1/1) ... [2019-11-25 08:56:12,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12" (1/1) ... [2019-11-25 08:56:12,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12" (1/1) ... [2019-11-25 08:56:12,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12" (1/1) ... [2019-11-25 08:56:12,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12" (1/1) ... [2019-11-25 08:56:12,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12" (1/1) ... [2019-11-25 08:56:12,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:56:12,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:56:12,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:56:12,866 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:56:12,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_13e052b0-7c80-4c88-a335-8533d6baf56c/bin/uautomizer/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-25 08:56:12,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:56:12,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:56:14,079 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:56:14,080 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:56:14,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:14 BoogieIcfgContainer [2019-11-25 08:56:14,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:56:14,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:56:14,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:56:14,085 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:56:14,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:56:12" (1/3) ... [2019-11-25 08:56:14,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3943d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:56:14, skipping insertion in model container [2019-11-25 08:56:14,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12" (2/3) ... [2019-11-25 08:56:14,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3943d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:56:14, skipping insertion in model container [2019-11-25 08:56:14,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:14" (3/3) ... [2019-11-25 08:56:14,091 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label05.c [2019-11-25 08:56:14,100 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:56:14,107 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:56:14,118 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:56:14,153 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:56:14,153 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:56:14,154 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:56:14,154 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:56:14,154 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:56:14,154 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:56:14,154 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:56:14,156 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:56:14,177 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-25 08:56:14,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-25 08:56:14,186 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:14,187 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] [2019-11-25 08:56:14,187 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:14,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:14,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1877985287, now seen corresponding path program 1 times [2019-11-25 08:56:14,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:14,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61683375] [2019-11-25 08:56:14,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:14,579 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-25 08:56:14,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61683375] [2019-11-25 08:56:14,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:14,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:14,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629651995] [2019-11-25 08:56:14,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:56:14,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:14,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:56:14,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:56:14,604 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-25 08:56:16,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:16,060 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-25 08:56:16,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:56:16,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-25 08:56:16,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:16,086 INFO L225 Difference]: With dead ends: 662 [2019-11-25 08:56:16,086 INFO L226 Difference]: Without dead ends: 397 [2019-11-25 08:56:16,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:56:16,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-25 08:56:16,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-11-25 08:56:16,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-25 08:56:16,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-25 08:56:16,159 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 94 [2019-11-25 08:56:16,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:16,160 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-25 08:56:16,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:56:16,160 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-25 08:56:16,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-25 08:56:16,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:16,165 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:16,165 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:16,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:16,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1993122394, now seen corresponding path program 1 times [2019-11-25 08:56:16,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:16,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980997495] [2019-11-25 08:56:16,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:16,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:56:16,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980997495] [2019-11-25 08:56:16,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:16,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:16,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398710052] [2019-11-25 08:56:16,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:56:16,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:16,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:56:16,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:56:16,238 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-25 08:56:17,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:17,086 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-11-25 08:56:17,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:56:17,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-25 08:56:17,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:17,092 INFO L225 Difference]: With dead ends: 1054 [2019-11-25 08:56:17,092 INFO L226 Difference]: Without dead ends: 790 [2019-11-25 08:56:17,094 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-25 08:56:17,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-25 08:56:17,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-25 08:56:17,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-25 08:56:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1067 transitions. [2019-11-25 08:56:17,152 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1067 transitions. Word has length 100 [2019-11-25 08:56:17,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:17,154 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1067 transitions. [2019-11-25 08:56:17,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:56:17,155 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1067 transitions. [2019-11-25 08:56:17,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-25 08:56:17,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:17,162 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:17,162 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:17,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:17,162 INFO L82 PathProgramCache]: Analyzing trace with hash 2028903770, now seen corresponding path program 1 times [2019-11-25 08:56:17,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:17,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146054074] [2019-11-25 08:56:17,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:17,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-25 08:56:17,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146054074] [2019-11-25 08:56:17,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:17,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:17,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703564850] [2019-11-25 08:56:17,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:17,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:17,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:17,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:17,324 INFO L87 Difference]: Start difference. First operand 790 states and 1067 transitions. Second operand 3 states. [2019-11-25 08:56:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:17,862 INFO L93 Difference]: Finished difference Result 2102 states and 2831 transitions. [2019-11-25 08:56:17,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:17,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-25 08:56:17,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:17,877 INFO L225 Difference]: With dead ends: 2102 [2019-11-25 08:56:17,877 INFO L226 Difference]: Without dead ends: 1314 [2019-11-25 08:56:17,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:17,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-11-25 08:56:17,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1052. [2019-11-25 08:56:17,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-11-25 08:56:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1328 transitions. [2019-11-25 08:56:17,918 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1328 transitions. Word has length 101 [2019-11-25 08:56:17,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:17,920 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1328 transitions. [2019-11-25 08:56:17,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:17,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1328 transitions. [2019-11-25 08:56:17,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-25 08:56:17,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:17,936 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:17,936 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:17,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:17,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1582856459, now seen corresponding path program 1 times [2019-11-25 08:56:17,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:17,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168960034] [2019-11-25 08:56:17,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:18,060 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-25 08:56:18,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168960034] [2019-11-25 08:56:18,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:18,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:18,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315201289] [2019-11-25 08:56:18,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:18,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:18,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:18,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:18,065 INFO L87 Difference]: Start difference. First operand 1052 states and 1328 transitions. Second operand 3 states. [2019-11-25 08:56:18,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:18,635 INFO L93 Difference]: Finished difference Result 2364 states and 3019 transitions. [2019-11-25 08:56:18,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:18,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-11-25 08:56:18,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:18,645 INFO L225 Difference]: With dead ends: 2364 [2019-11-25 08:56:18,691 INFO L226 Difference]: Without dead ends: 1314 [2019-11-25 08:56:18,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:18,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-11-25 08:56:18,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2019-11-25 08:56:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-25 08:56:18,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1502 transitions. [2019-11-25 08:56:18,734 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1502 transitions. Word has length 128 [2019-11-25 08:56:18,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:18,734 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1502 transitions. [2019-11-25 08:56:18,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:18,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1502 transitions. [2019-11-25 08:56:18,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-25 08:56:18,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:18,740 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-25 08:56:18,740 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:18,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:18,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1986645786, now seen corresponding path program 1 times [2019-11-25 08:56:18,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:18,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431294089] [2019-11-25 08:56:18,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:18,860 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:56:18,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431294089] [2019-11-25 08:56:18,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:18,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:18,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889444280] [2019-11-25 08:56:18,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:18,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:18,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:18,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:18,863 INFO L87 Difference]: Start difference. First operand 1183 states and 1502 transitions. Second operand 3 states. [2019-11-25 08:56:19,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:19,410 INFO L93 Difference]: Finished difference Result 3150 states and 3980 transitions. [2019-11-25 08:56:19,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:19,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-25 08:56:19,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:19,422 INFO L225 Difference]: With dead ends: 3150 [2019-11-25 08:56:19,423 INFO L226 Difference]: Without dead ends: 1969 [2019-11-25 08:56:19,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:19,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-25 08:56:19,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-11-25 08:56:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-25 08:56:19,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2265 transitions. [2019-11-25 08:56:19,474 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2265 transitions. Word has length 152 [2019-11-25 08:56:19,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:19,475 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2265 transitions. [2019-11-25 08:56:19,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:19,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2265 transitions. [2019-11-25 08:56:19,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-25 08:56:19,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:19,481 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 08:56:19,481 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:19,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:19,482 INFO L82 PathProgramCache]: Analyzing trace with hash -27987931, now seen corresponding path program 1 times [2019-11-25 08:56:19,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:19,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541493240] [2019-11-25 08:56:19,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:19,555 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-25 08:56:19,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541493240] [2019-11-25 08:56:19,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:19,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:19,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838066421] [2019-11-25 08:56:19,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:19,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:19,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:19,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:19,558 INFO L87 Difference]: Start difference. First operand 1838 states and 2265 transitions. Second operand 3 states. [2019-11-25 08:56:20,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:20,019 INFO L93 Difference]: Finished difference Result 3674 states and 4528 transitions. [2019-11-25 08:56:20,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:20,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-25 08:56:20,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:20,028 INFO L225 Difference]: With dead ends: 3674 [2019-11-25 08:56:20,029 INFO L226 Difference]: Without dead ends: 1838 [2019-11-25 08:56:20,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:20,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-25 08:56:20,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2019-11-25 08:56:20,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-25 08:56:20,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2110 transitions. [2019-11-25 08:56:20,074 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2110 transitions. Word has length 157 [2019-11-25 08:56:20,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:20,074 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 2110 transitions. [2019-11-25 08:56:20,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:20,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2110 transitions. [2019-11-25 08:56:20,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-25 08:56:20,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:20,079 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, 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] [2019-11-25 08:56:20,079 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:20,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:20,080 INFO L82 PathProgramCache]: Analyzing trace with hash 639923582, now seen corresponding path program 1 times [2019-11-25 08:56:20,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:20,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277404159] [2019-11-25 08:56:20,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:20,171 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-25 08:56:20,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277404159] [2019-11-25 08:56:20,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:20,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:20,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045790578] [2019-11-25 08:56:20,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:20,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:20,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:20,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:20,178 INFO L87 Difference]: Start difference. First operand 1707 states and 2110 transitions. Second operand 3 states. [2019-11-25 08:56:20,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:20,561 INFO L93 Difference]: Finished difference Result 3543 states and 4361 transitions. [2019-11-25 08:56:20,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:20,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-11-25 08:56:20,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:20,570 INFO L225 Difference]: With dead ends: 3543 [2019-11-25 08:56:20,570 INFO L226 Difference]: Without dead ends: 1838 [2019-11-25 08:56:20,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:20,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-25 08:56:20,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-11-25 08:56:20,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-25 08:56:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2229 transitions. [2019-11-25 08:56:20,618 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2229 transitions. Word has length 177 [2019-11-25 08:56:20,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:20,619 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2229 transitions. [2019-11-25 08:56:20,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:20,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2229 transitions. [2019-11-25 08:56:20,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-25 08:56:20,625 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:20,625 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-25 08:56:20,625 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:20,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:20,626 INFO L82 PathProgramCache]: Analyzing trace with hash 502707782, now seen corresponding path program 1 times [2019-11-25 08:56:20,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:20,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963078342] [2019-11-25 08:56:20,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:20,881 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-25 08:56:20,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963078342] [2019-11-25 08:56:20,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:20,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:56:20,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351239222] [2019-11-25 08:56:20,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:56:20,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:20,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:56:20,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:56:20,883 INFO L87 Difference]: Start difference. First operand 1838 states and 2229 transitions. Second operand 8 states. [2019-11-25 08:56:21,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:21,834 INFO L93 Difference]: Finished difference Result 3844 states and 4632 transitions. [2019-11-25 08:56:21,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:56:21,835 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2019-11-25 08:56:21,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:21,847 INFO L225 Difference]: With dead ends: 3844 [2019-11-25 08:56:21,847 INFO L226 Difference]: Without dead ends: 2008 [2019-11-25 08:56:21,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:56:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2019-11-25 08:56:21,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1838. [2019-11-25 08:56:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-25 08:56:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2217 transitions. [2019-11-25 08:56:21,908 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2217 transitions. Word has length 181 [2019-11-25 08:56:21,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:21,909 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2217 transitions. [2019-11-25 08:56:21,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:56:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2217 transitions. [2019-11-25 08:56:21,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-25 08:56:21,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:21,914 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:21,915 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:21,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:21,915 INFO L82 PathProgramCache]: Analyzing trace with hash 997281865, now seen corresponding path program 1 times [2019-11-25 08:56:21,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:21,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725497066] [2019-11-25 08:56:21,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:22,105 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-11-25 08:56:22,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725497066] [2019-11-25 08:56:22,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:22,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:22,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192359954] [2019-11-25 08:56:22,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:22,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:22,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:22,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:22,112 INFO L87 Difference]: Start difference. First operand 1838 states and 2217 transitions. Second operand 3 states. [2019-11-25 08:56:22,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:22,627 INFO L93 Difference]: Finished difference Result 2364 states and 2826 transitions. [2019-11-25 08:56:22,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:22,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-25 08:56:22,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:22,640 INFO L225 Difference]: With dead ends: 2364 [2019-11-25 08:56:22,640 INFO L226 Difference]: Without dead ends: 2362 [2019-11-25 08:56:22,641 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-25 08:56:22,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2019-11-25 08:56:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1707. [2019-11-25 08:56:22,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-25 08:56:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2043 transitions. [2019-11-25 08:56:22,686 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2043 transitions. Word has length 198 [2019-11-25 08:56:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:22,687 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 2043 transitions. [2019-11-25 08:56:22,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2043 transitions. [2019-11-25 08:56:22,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-25 08:56:22,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:22,693 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-25 08:56:22,693 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:22,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:22,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1286042342, now seen corresponding path program 1 times [2019-11-25 08:56:22,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:22,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097612649] [2019-11-25 08:56:22,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 141 proven. 70 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-25 08:56:22,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097612649] [2019-11-25 08:56:22,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633201481] [2019-11-25 08:56:22,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_13e052b0-7c80-4c88-a335-8533d6baf56c/bin/uautomizer/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-25 08:56:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:23,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:56:23,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-25 08:56:23,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:56:23,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-25 08:56:23,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743901260] [2019-11-25 08:56:23,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:23,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:23,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:23,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:56:23,201 INFO L87 Difference]: Start difference. First operand 1707 states and 2043 transitions. Second operand 3 states. [2019-11-25 08:56:23,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:23,708 INFO L93 Difference]: Finished difference Result 3410 states and 4083 transitions. [2019-11-25 08:56:23,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:23,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-11-25 08:56:23,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:23,710 INFO L225 Difference]: With dead ends: 3410 [2019-11-25 08:56:23,710 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:56:23,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 218 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:56:23,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:56:23,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:56:23,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:56:23,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:56:23,714 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 216 [2019-11-25 08:56:23,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:23,715 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:56:23,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:23,715 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:56:23,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:56:23,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:23,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:56:24,246 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 28 [2019-11-25 08:56:24,389 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 28 [2019-11-25 08:56:24,392 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-25 08:56:24,392 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-25 08:56:24,392 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,392 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,392 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,392 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,392 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,392 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,393 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-25 08:56:24,393 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-25 08:56:24,393 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-25 08:56:24,393 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-25 08:56:24,393 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-25 08:56:24,393 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-25 08:56:24,393 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-25 08:56:24,393 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-25 08:56:24,393 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-25 08:56:24,394 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-25 08:56:24,394 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,394 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,394 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,394 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,394 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,394 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,394 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-25 08:56:24,394 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-25 08:56:24,395 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-25 08:56:24,395 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-25 08:56:24,395 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-25 08:56:24,395 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-25 08:56:24,395 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-25 08:56:24,396 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-25 08:56:24,396 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-25 08:56:24,396 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-25 08:56:24,396 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-25 08:56:24,396 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-25 08:56:24,396 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-25 08:56:24,396 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-25 08:56:24,396 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-25 08:56:24,396 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,397 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,397 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,397 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,397 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,397 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-25 08:56:24,397 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-25 08:56:24,397 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-25 08:56:24,397 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-25 08:56:24,397 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-25 08:56:24,397 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-25 08:56:24,398 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-25 08:56:24,398 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-25 08:56:24,398 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-25 08:56:24,400 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse3 (not (= 13 ~a8~0))) (.cse6 (= ~a17~0 1)) (.cse4 (<= ~a21~0 0)) (.cse1 (= ~a20~0 1)) (.cse5 (not (= ~a16~0 6))) (.cse0 (not (= 1 ~a7~0))) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse5 .cse2 .cse3) (and .cse6 .cse1 .cse2) (and .cse4 .cse1) (and .cse5 .cse0 .cse2))) [2019-11-25 08:56:24,400 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,401 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,401 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,401 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,402 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,402 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-25 08:56:24,402 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-25 08:56:24,402 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-25 08:56:24,402 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-25 08:56:24,402 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-25 08:56:24,402 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-25 08:56:24,402 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-25 08:56:24,402 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-25 08:56:24,403 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-25 08:56:24,403 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-25 08:56:24,403 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-25 08:56:24,403 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-25 08:56:24,403 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-25 08:56:24,403 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-25 08:56:24,403 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,403 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,403 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,403 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,404 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,404 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-25 08:56:24,404 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-25 08:56:24,404 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-25 08:56:24,404 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-25 08:56:24,404 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-25 08:56:24,404 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-25 08:56:24,404 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-25 08:56:24,404 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-25 08:56:24,405 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-25 08:56:24,405 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,405 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,405 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,406 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,406 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-25 08:56:24,406 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,406 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-25 08:56:24,406 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-25 08:56:24,406 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-25 08:56:24,407 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-25 08:56:24,407 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-25 08:56:24,407 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-25 08:56:24,407 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-25 08:56:24,407 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:56:24,407 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-25 08:56:24,407 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-25 08:56:24,407 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-25 08:56:24,407 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-25 08:56:24,407 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-25 08:56:24,408 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-25 08:56:24,408 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,409 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse3 (not (= 13 ~a8~0))) (.cse6 (= ~a17~0 1)) (.cse4 (<= ~a21~0 0)) (.cse1 (= ~a20~0 1)) (.cse5 (not (= ~a16~0 6))) (.cse0 (not (= 1 ~a7~0))) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse5 .cse2 .cse3) (and .cse6 .cse1 .cse2) (and .cse4 .cse1) (and .cse5 .cse0 .cse2))) [2019-11-25 08:56:24,409 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,409 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,409 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,409 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,409 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-25 08:56:24,409 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-25 08:56:24,409 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-25 08:56:24,409 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-25 08:56:24,410 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-25 08:56:24,410 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-25 08:56:24,410 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-25 08:56:24,410 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-25 08:56:24,410 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,410 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,410 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,410 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,410 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,411 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-25 08:56:24,411 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:56:24,411 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-25 08:56:24,411 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-25 08:56:24,411 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-25 08:56:24,411 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-25 08:56:24,411 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-25 08:56:24,411 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-25 08:56:24,411 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-25 08:56:24,411 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-25 08:56:24,412 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-25 08:56:24,412 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-25 08:56:24,412 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-25 08:56:24,412 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,412 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,412 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,412 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,412 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-25 08:56:24,412 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,413 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,413 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-25 08:56:24,413 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-25 08:56:24,413 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:56:24,413 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-25 08:56:24,413 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-25 08:56:24,413 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-25 08:56:24,413 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-25 08:56:24,413 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-25 08:56:24,413 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-25 08:56:24,414 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-25 08:56:24,414 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-25 08:56:24,414 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-25 08:56:24,414 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-25 08:56:24,414 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,414 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,414 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,414 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,414 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,415 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-25 08:56:24,415 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,415 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-25 08:56:24,415 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-25 08:56:24,415 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-25 08:56:24,415 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-25 08:56:24,415 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-25 08:56:24,415 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-25 08:56:24,415 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-25 08:56:24,415 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-25 08:56:24,416 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-25 08:56:24,416 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-25 08:56:24,416 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-25 08:56:24,416 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-25 08:56:24,416 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 458) no Hoare annotation was computed. [2019-11-25 08:56:24,416 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-25 08:56:24,416 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-25 08:56:24,416 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-25 08:56:24,417 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,417 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,417 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,417 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,417 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,417 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:24,417 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-25 08:56:24,417 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-25 08:56:24,417 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-25 08:56:24,417 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-25 08:56:24,418 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-25 08:56:24,418 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-25 08:56:24,418 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-25 08:56:24,418 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-25 08:56:24,418 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-25 08:56:24,418 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-25 08:56:24,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:56:24 BoogieIcfgContainer [2019-11-25 08:56:24,454 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:56:24,454 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:56:24,454 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:56:24,454 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:56:24,455 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:14" (3/4) ... [2019-11-25 08:56:24,458 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:56:24,485 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 08:56:24,487 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:56:24,663 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_13e052b0-7c80-4c88-a335-8533d6baf56c/bin/uautomizer/witness.graphml [2019-11-25 08:56:24,663 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:56:24,664 INFO L168 Benchmark]: Toolchain (without parser) took 12562.79 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 432.0 MB). Free memory was 942.1 MB in the beginning and 1.2 GB in the end (delta: -208.6 MB). Peak memory consumption was 223.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:24,665 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:56:24,666 INFO L168 Benchmark]: CACSL2BoogieTranslator took 631.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 942.1 MB in the beginning and 1.1 GB in the end (delta: -155.7 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:24,666 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.79 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-25 08:56:24,666 INFO L168 Benchmark]: Boogie Preprocessor took 59.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:24,667 INFO L168 Benchmark]: RCFGBuilder took 1215.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 981.2 MB in the end (delta: 109.8 MB). Peak memory consumption was 109.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:24,667 INFO L168 Benchmark]: TraceAbstraction took 10372.16 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 303.0 MB). Free memory was 981.2 MB in the beginning and 1.2 GB in the end (delta: -186.0 MB). Peak memory consumption was 117.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:24,668 INFO L168 Benchmark]: Witness Printer took 209.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:24,670 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 631.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 942.1 MB in the beginning and 1.1 GB in the end (delta: -155.7 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.79 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. * Boogie Preprocessor took 59.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1215.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 981.2 MB in the end (delta: 109.8 MB). Peak memory consumption was 109.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10372.16 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 303.0 MB). Free memory was 981.2 MB in the beginning and 1.2 GB in the end (delta: -186.0 MB). Peak memory consumption was 117.1 MB. Max. memory is 11.5 GB. * Witness Printer took 209.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 458]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((!(1 == a7) && a20 == 1) && a21 == 1) || ((!(1 == a7) && a21 == 1) && !(13 == a8))) || ((a21 <= 0 && !(a16 == 6)) && a17 == 1)) || ((!(a16 == 6) && a21 == 1) && !(13 == a8))) || ((a17 == 1 && a20 == 1) && a21 == 1)) || (a21 <= 0 && a20 == 1)) || ((!(a16 == 6) && !(1 == a7)) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((!(1 == a7) && a20 == 1) && a21 == 1) || ((!(1 == a7) && a21 == 1) && !(13 == a8))) || ((a21 <= 0 && !(a16 == 6)) && a17 == 1)) || ((!(a16 == 6) && a21 == 1) && !(13 == a8))) || ((a17 == 1 && a20 == 1) && a21 == 1)) || (a21 <= 0 && a20 == 1)) || ((!(a16 == 6) && !(1 == a7)) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 10.2s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 559 SDtfs, 1803 SDslu, 80 SDs, 0 SdLazy, 4248 SolverSat, 907 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 228 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred 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, 10 MinimizatonAttempts, 1611 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 32 NumberOfFragments, 153 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3250 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 328 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1720 NumberOfCodeBlocks, 1720 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1709 ConstructedInterpolants, 0 QuantifiedInterpolants, 712697 SizeOfPredicates, 1 NumberOfNonLiveVariables, 389 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 1003/1073 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...