./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_654180d0-9c48-4963-a489-54c5cef1843a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_654180d0-9c48-4963-a489-54c5cef1843a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_654180d0-9c48-4963-a489-54c5cef1843a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_654180d0-9c48-4963-a489-54c5cef1843a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label14.c -s /tmp/vcloud-vcloud-master/worker/run_dir_654180d0-9c48-4963-a489-54c5cef1843a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_654180d0-9c48-4963-a489-54c5cef1843a/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 bf623cbfa27d5f25c20ae418fc6508fd949965cd ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:51:12,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:51:12,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:51:13,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:51:13,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:51:13,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:51:13,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:51:13,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:51:13,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:51:13,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:51:13,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:51:13,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:51:13,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:51:13,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:51:13,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:51:13,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:51:13,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:51:13,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:51:13,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:51:13,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:51:13,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:51:13,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:51:13,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:51:13,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:51:13,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:51:13,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:51:13,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:51:13,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:51:13,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:51:13,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:51:13,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:51:13,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:51:13,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:51:13,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:51:13,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:51:13,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:51:13,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:51:13,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:51:13,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:51:13,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:51:13,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:51:13,036 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_654180d0-9c48-4963-a489-54c5cef1843a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:51:13,048 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:51:13,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:51:13,050 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:51:13,050 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:51:13,050 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:51:13,051 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:51:13,051 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:51:13,051 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:51:13,052 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:51:13,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:51:13,052 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:51:13,052 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:51:13,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:51:13,053 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:51:13,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:51:13,053 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:51:13,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:51:13,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:51:13,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:51:13,054 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:51:13,055 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:51:13,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:51:13,055 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:51:13,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:51:13,056 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:51:13,056 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:51:13,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:51:13,056 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:51:13,057 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_654180d0-9c48-4963-a489-54c5cef1843a/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 -> bf623cbfa27d5f25c20ae418fc6508fd949965cd [2019-11-15 20:51:13,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:51:13,096 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:51:13,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:51:13,103 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:51:13,103 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:51:13,104 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_654180d0-9c48-4963-a489-54c5cef1843a/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label14.c [2019-11-15 20:51:13,161 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_654180d0-9c48-4963-a489-54c5cef1843a/bin/uautomizer/data/b6f4b9936/c6bc1a701b994667a4c96f63b1a9db8d/FLAGbbd055c26 [2019-11-15 20:51:13,669 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:51:13,670 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_654180d0-9c48-4963-a489-54c5cef1843a/sv-benchmarks/c/eca-rers2012/Problem02_label14.c [2019-11-15 20:51:13,681 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_654180d0-9c48-4963-a489-54c5cef1843a/bin/uautomizer/data/b6f4b9936/c6bc1a701b994667a4c96f63b1a9db8d/FLAGbbd055c26 [2019-11-15 20:51:14,172 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_654180d0-9c48-4963-a489-54c5cef1843a/bin/uautomizer/data/b6f4b9936/c6bc1a701b994667a4c96f63b1a9db8d [2019-11-15 20:51:14,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:51:14,175 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:51:14,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:51:14,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:51:14,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:51:14,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:51:14" (1/1) ... [2019-11-15 20:51:14,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2258f497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14, skipping insertion in model container [2019-11-15 20:51:14,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:51:14" (1/1) ... [2019-11-15 20:51:14,191 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:51:14,247 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:51:14,720 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:51:14,724 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:51:14,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:51:14,817 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:51:14,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14 WrapperNode [2019-11-15 20:51:14,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:51:14,819 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:51:14,819 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:51:14,819 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:51:14,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14" (1/1) ... [2019-11-15 20:51:14,844 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14" (1/1) ... [2019-11-15 20:51:14,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:51:14,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:51:14,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:51:14,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:51:14,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14" (1/1) ... [2019-11-15 20:51:14,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14" (1/1) ... [2019-11-15 20:51:14,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14" (1/1) ... [2019-11-15 20:51:14,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14" (1/1) ... [2019-11-15 20:51:14,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14" (1/1) ... [2019-11-15 20:51:14,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14" (1/1) ... [2019-11-15 20:51:14,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14" (1/1) ... [2019-11-15 20:51:14,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:51:14,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:51:14,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:51:14,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:51:14,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_654180d0-9c48-4963-a489-54c5cef1843a/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-15 20:51:15,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:51:15,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:51:16,086 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:51:16,086 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:51:16,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:51:16 BoogieIcfgContainer [2019-11-15 20:51:16,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:51:16,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:51:16,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:51:16,091 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:51:16,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:51:14" (1/3) ... [2019-11-15 20:51:16,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ecec5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:51:16, skipping insertion in model container [2019-11-15 20:51:16,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14" (2/3) ... [2019-11-15 20:51:16,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ecec5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:51:16, skipping insertion in model container [2019-11-15 20:51:16,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:51:16" (3/3) ... [2019-11-15 20:51:16,096 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label14.c [2019-11-15 20:51:16,104 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:51:16,111 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:51:16,121 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:51:16,157 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:51:16,158 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:51:16,158 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:51:16,158 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:51:16,158 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:51:16,159 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:51:16,160 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:51:16,161 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:51:16,183 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-11-15 20:51:16,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-15 20:51:16,195 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:51:16,195 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:51:16,197 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:51:16,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:51:16,202 INFO L82 PathProgramCache]: Analyzing trace with hash 906683963, now seen corresponding path program 1 times [2019-11-15 20:51:16,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:51:16,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129080464] [2019-11-15 20:51:16,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:16,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:16,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:51:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:51:16,566 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-15 20:51:16,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129080464] [2019-11-15 20:51:16,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:51:16,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:51:16,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447593991] [2019-11-15 20:51:16,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:51:16,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:51:16,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:51:16,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:51:16,588 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-11-15 20:51:17,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:51:17,886 INFO L93 Difference]: Finished difference Result 739 states and 1311 transitions. [2019-11-15 20:51:17,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:51:17,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-15 20:51:17,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:51:17,914 INFO L225 Difference]: With dead ends: 739 [2019-11-15 20:51:17,914 INFO L226 Difference]: Without dead ends: 445 [2019-11-15 20:51:17,918 INFO L600 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-15 20:51:17,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-11-15 20:51:17,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2019-11-15 20:51:17,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-11-15 20:51:17,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 664 transitions. [2019-11-15 20:51:17,984 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 664 transitions. Word has length 117 [2019-11-15 20:51:17,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:51:17,989 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 664 transitions. [2019-11-15 20:51:17,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:51:17,990 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 664 transitions. [2019-11-15 20:51:17,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-15 20:51:17,994 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:51:17,995 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:51:17,995 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:51:17,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:51:17,995 INFO L82 PathProgramCache]: Analyzing trace with hash -904416550, now seen corresponding path program 1 times [2019-11-15 20:51:17,995 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:51:17,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866970838] [2019-11-15 20:51:17,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:17,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:17,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:51:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:51:18,119 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:51:18,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866970838] [2019-11-15 20:51:18,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:51:18,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:51:18,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317437320] [2019-11-15 20:51:18,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:51:18,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:51:18,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:51:18,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:51:18,124 INFO L87 Difference]: Start difference. First operand 445 states and 664 transitions. Second operand 4 states. [2019-11-15 20:51:19,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:51:19,030 INFO L93 Difference]: Finished difference Result 1470 states and 2193 transitions. [2019-11-15 20:51:19,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:51:19,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-11-15 20:51:19,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:51:19,037 INFO L225 Difference]: With dead ends: 1470 [2019-11-15 20:51:19,037 INFO L226 Difference]: Without dead ends: 1027 [2019-11-15 20:51:19,039 INFO L600 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-15 20:51:19,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2019-11-15 20:51:19,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 729. [2019-11-15 20:51:19,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2019-11-15 20:51:19,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1053 transitions. [2019-11-15 20:51:19,082 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1053 transitions. Word has length 135 [2019-11-15 20:51:19,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:51:19,083 INFO L462 AbstractCegarLoop]: Abstraction has 729 states and 1053 transitions. [2019-11-15 20:51:19,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:51:19,083 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1053 transitions. [2019-11-15 20:51:19,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-15 20:51:19,089 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:51:19,089 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:51:19,090 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:51:19,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:51:19,090 INFO L82 PathProgramCache]: Analyzing trace with hash 793603343, now seen corresponding path program 1 times [2019-11-15 20:51:19,090 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:51:19,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488004459] [2019-11-15 20:51:19,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:19,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:19,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:51:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:51:19,199 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:51:19,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488004459] [2019-11-15 20:51:19,201 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:51:19,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:51:19,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398852810] [2019-11-15 20:51:19,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:51:19,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:51:19,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:51:19,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:51:19,208 INFO L87 Difference]: Start difference. First operand 729 states and 1053 transitions. Second operand 4 states. [2019-11-15 20:51:20,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:51:20,160 INFO L93 Difference]: Finished difference Result 2582 states and 3716 transitions. [2019-11-15 20:51:20,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:51:20,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-11-15 20:51:20,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:51:20,172 INFO L225 Difference]: With dead ends: 2582 [2019-11-15 20:51:20,172 INFO L226 Difference]: Without dead ends: 1855 [2019-11-15 20:51:20,174 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:51:20,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2019-11-15 20:51:20,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1570. [2019-11-15 20:51:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2019-11-15 20:51:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2142 transitions. [2019-11-15 20:51:20,230 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2142 transitions. Word has length 139 [2019-11-15 20:51:20,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:51:20,231 INFO L462 AbstractCegarLoop]: Abstraction has 1570 states and 2142 transitions. [2019-11-15 20:51:20,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:51:20,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2142 transitions. [2019-11-15 20:51:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-15 20:51:20,236 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:51:20,237 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:51:20,237 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:51:20,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:51:20,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1415237092, now seen corresponding path program 1 times [2019-11-15 20:51:20,238 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:51:20,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971428081] [2019-11-15 20:51:20,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:20,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:20,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:51:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:51:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:51:20,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971428081] [2019-11-15 20:51:20,324 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:51:20,324 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:51:20,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413117960] [2019-11-15 20:51:20,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:51:20,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:51:20,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:51:20,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:51:20,325 INFO L87 Difference]: Start difference. First operand 1570 states and 2142 transitions. Second operand 3 states. [2019-11-15 20:51:20,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:51:20,928 INFO L93 Difference]: Finished difference Result 3840 states and 5195 transitions. [2019-11-15 20:51:20,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:51:20,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-11-15 20:51:20,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:51:20,939 INFO L225 Difference]: With dead ends: 3840 [2019-11-15 20:51:20,939 INFO L226 Difference]: Without dead ends: 2272 [2019-11-15 20:51:20,941 INFO L600 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-15 20:51:20,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2019-11-15 20:51:20,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 2132. [2019-11-15 20:51:20,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-11-15 20:51:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2655 transitions. [2019-11-15 20:51:20,985 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2655 transitions. Word has length 139 [2019-11-15 20:51:20,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:51:20,986 INFO L462 AbstractCegarLoop]: Abstraction has 2132 states and 2655 transitions. [2019-11-15 20:51:20,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:51:20,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2655 transitions. [2019-11-15 20:51:20,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-15 20:51:20,991 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:51:20,991 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:51:20,991 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:51:20,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:51:20,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1487828793, now seen corresponding path program 1 times [2019-11-15 20:51:20,992 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:51:20,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943047426] [2019-11-15 20:51:20,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:20,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:20,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:51:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:51:21,122 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 20:51:21,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943047426] [2019-11-15 20:51:21,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:51:21,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:51:21,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899313707] [2019-11-15 20:51:21,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:51:21,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:51:21,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:51:21,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:51:21,125 INFO L87 Difference]: Start difference. First operand 2132 states and 2655 transitions. Second operand 4 states. [2019-11-15 20:51:21,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:51:21,771 INFO L93 Difference]: Finished difference Result 4827 states and 6005 transitions. [2019-11-15 20:51:21,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:51:21,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-11-15 20:51:21,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:51:21,788 INFO L225 Difference]: With dead ends: 4827 [2019-11-15 20:51:21,788 INFO L226 Difference]: Without dead ends: 2273 [2019-11-15 20:51:21,791 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-15 20:51:21,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2019-11-15 20:51:21,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2270. [2019-11-15 20:51:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2019-11-15 20:51:21,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 2534 transitions. [2019-11-15 20:51:21,839 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 2534 transitions. Word has length 144 [2019-11-15 20:51:21,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:51:21,840 INFO L462 AbstractCegarLoop]: Abstraction has 2270 states and 2534 transitions. [2019-11-15 20:51:21,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:51:21,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 2534 transitions. [2019-11-15 20:51:21,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-15 20:51:21,846 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:51:21,847 INFO L380 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:51:21,847 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:51:21,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:51:21,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1645622840, now seen corresponding path program 1 times [2019-11-15 20:51:21,848 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:51:21,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109790048] [2019-11-15 20:51:21,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:21,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:21,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:51:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:51:21,912 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 20:51:21,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109790048] [2019-11-15 20:51:21,913 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:51:21,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:51:21,913 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317120567] [2019-11-15 20:51:21,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:51:21,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:51:21,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:51:21,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:51:21,915 INFO L87 Difference]: Start difference. First operand 2270 states and 2534 transitions. Second operand 3 states. [2019-11-15 20:51:22,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:51:22,431 INFO L93 Difference]: Finished difference Result 5376 states and 5995 transitions. [2019-11-15 20:51:22,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:51:22,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-15 20:51:22,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:51:22,443 INFO L225 Difference]: With dead ends: 5376 [2019-11-15 20:51:22,443 INFO L226 Difference]: Without dead ends: 3108 [2019-11-15 20:51:22,446 INFO L600 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-15 20:51:22,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3108 states. [2019-11-15 20:51:22,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3108 to 2128. [2019-11-15 20:51:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2128 states. [2019-11-15 20:51:22,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 2362 transitions. [2019-11-15 20:51:22,491 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 2362 transitions. Word has length 185 [2019-11-15 20:51:22,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:51:22,491 INFO L462 AbstractCegarLoop]: Abstraction has 2128 states and 2362 transitions. [2019-11-15 20:51:22,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:51:22,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 2362 transitions. [2019-11-15 20:51:22,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-15 20:51:22,497 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:51:22,497 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 20:51:22,497 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:51:22,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:51:22,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1280460365, now seen corresponding path program 1 times [2019-11-15 20:51:22,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:51:22,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477619021] [2019-11-15 20:51:22,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:22,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:22,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:51:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:51:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:51:22,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477619021] [2019-11-15 20:51:22,833 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:51:22,833 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:51:22,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683778270] [2019-11-15 20:51:22,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:51:22,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:51:22,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:51:22,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:51:22,834 INFO L87 Difference]: Start difference. First operand 2128 states and 2362 transitions. Second operand 7 states. [2019-11-15 20:51:23,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:51:23,880 INFO L93 Difference]: Finished difference Result 4693 states and 5195 transitions. [2019-11-15 20:51:23,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:51:23,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 185 [2019-11-15 20:51:23,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:51:23,893 INFO L225 Difference]: With dead ends: 4693 [2019-11-15 20:51:23,893 INFO L226 Difference]: Without dead ends: 2286 [2019-11-15 20:51:23,896 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:51:23,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2019-11-15 20:51:23,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2127. [2019-11-15 20:51:23,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2019-11-15 20:51:23,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 2354 transitions. [2019-11-15 20:51:23,941 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 2354 transitions. Word has length 185 [2019-11-15 20:51:23,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:51:23,941 INFO L462 AbstractCegarLoop]: Abstraction has 2127 states and 2354 transitions. [2019-11-15 20:51:23,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:51:23,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 2354 transitions. [2019-11-15 20:51:23,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-15 20:51:23,948 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:51:23,948 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:51:23,948 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:51:23,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:51:23,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1003780014, now seen corresponding path program 1 times [2019-11-15 20:51:23,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:51:23,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970198523] [2019-11-15 20:51:23,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:23,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:23,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:51:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:51:24,129 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:51:24,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970198523] [2019-11-15 20:51:24,130 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:51:24,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:51:24,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905449228] [2019-11-15 20:51:24,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:51:24,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:51:24,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:51:24,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:51:24,132 INFO L87 Difference]: Start difference. First operand 2127 states and 2354 transitions. Second operand 4 states. [2019-11-15 20:51:24,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:51:24,720 INFO L93 Difference]: Finished difference Result 3829 states and 4242 transitions. [2019-11-15 20:51:24,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:51:24,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-11-15 20:51:24,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:51:24,728 INFO L225 Difference]: With dead ends: 3829 [2019-11-15 20:51:24,728 INFO L226 Difference]: Without dead ends: 1564 [2019-11-15 20:51:24,731 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:51:24,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2019-11-15 20:51:24,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1563. [2019-11-15 20:51:24,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2019-11-15 20:51:24,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1686 transitions. [2019-11-15 20:51:24,754 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1686 transitions. Word has length 194 [2019-11-15 20:51:24,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:51:24,755 INFO L462 AbstractCegarLoop]: Abstraction has 1563 states and 1686 transitions. [2019-11-15 20:51:24,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:51:24,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1686 transitions. [2019-11-15 20:51:24,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-15 20:51:24,759 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:51:24,759 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:51:24,759 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:51:24,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:51:24,760 INFO L82 PathProgramCache]: Analyzing trace with hash 36518128, now seen corresponding path program 1 times [2019-11-15 20:51:24,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:51:24,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614207224] [2019-11-15 20:51:24,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:24,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:24,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:51:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:51:24,925 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-15 20:51:24,926 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614207224] [2019-11-15 20:51:24,926 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:51:24,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:51:24,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014067903] [2019-11-15 20:51:24,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:51:24,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:51:24,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:51:24,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:51:24,928 INFO L87 Difference]: Start difference. First operand 1563 states and 1686 transitions. Second operand 3 states. [2019-11-15 20:51:25,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:51:25,207 INFO L93 Difference]: Finished difference Result 3264 states and 3520 transitions. [2019-11-15 20:51:25,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:51:25,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-11-15 20:51:25,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:51:25,208 INFO L225 Difference]: With dead ends: 3264 [2019-11-15 20:51:25,208 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:51:25,211 INFO L600 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-15 20:51:25,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:51:25,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:51:25,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:51:25,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:51:25,211 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 215 [2019-11-15 20:51:25,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:51:25,212 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:51:25,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:51:25,212 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:51:25,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:51:25,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:51:25,450 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2019-11-15 20:51:25,612 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2019-11-15 20:51:25,614 INFO L443 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,614 INFO L443 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,614 INFO L443 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,614 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-15 20:51:25,614 INFO L443 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-11-15 20:51:25,614 INFO L443 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-11-15 20:51:25,614 INFO L443 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-11-15 20:51:25,614 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-15 20:51:25,615 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-15 20:51:25,615 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-15 20:51:25,615 INFO L443 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,615 INFO L443 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,615 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,615 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-15 20:51:25,615 INFO L443 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-11-15 20:51:25,615 INFO L443 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-15 20:51:25,615 INFO L443 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-11-15 20:51:25,615 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-11-15 20:51:25,615 INFO L443 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-11-15 20:51:25,615 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-15 20:51:25,615 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 523) no Hoare annotation was computed. [2019-11-15 20:51:25,615 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,615 INFO L443 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,616 INFO L443 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,616 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-15 20:51:25,616 INFO L443 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-11-15 20:51:25,616 INFO L443 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-11-15 20:51:25,616 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-15 20:51:25,616 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-15 20:51:25,616 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,616 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,616 INFO L443 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,616 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-15 20:51:25,616 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-15 20:51:25,616 INFO L443 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-11-15 20:51:25,616 INFO L443 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-11-15 20:51:25,617 INFO L443 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-11-15 20:51:25,617 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-15 20:51:25,617 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-15 20:51:25,617 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-15 20:51:25,617 INFO L443 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,617 INFO L443 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,617 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,617 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-15 20:51:25,617 INFO L443 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-11-15 20:51:25,617 INFO L443 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-11-15 20:51:25,617 INFO L443 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-11-15 20:51:25,617 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-15 20:51:25,617 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-15 20:51:25,618 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-15 20:51:25,618 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-15 20:51:25,618 INFO L443 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,618 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,618 INFO L443 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,618 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-11-15 20:51:25,618 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-11-15 20:51:25,618 INFO L443 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-11-15 20:51:25,618 INFO L443 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-11-15 20:51:25,618 INFO L443 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-11-15 20:51:25,618 INFO L443 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-15 20:51:25,618 INFO L443 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-11-15 20:51:25,618 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-15 20:51:25,619 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-15 20:51:25,619 INFO L443 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,619 INFO L443 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,619 INFO L443 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,619 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-15 20:51:25,619 INFO L443 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-11-15 20:51:25,619 INFO L443 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-11-15 20:51:25,619 INFO L443 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-11-15 20:51:25,619 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-15 20:51:25,619 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-15 20:51:25,619 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,620 INFO L443 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,620 INFO L443 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,620 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-15 20:51:25,620 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-15 20:51:25,620 INFO L443 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-15 20:51:25,620 INFO L443 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-11-15 20:51:25,620 INFO L443 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-11-15 20:51:25,620 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:51:25,620 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-15 20:51:25,620 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-15 20:51:25,620 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-15 20:51:25,620 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,620 INFO L443 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,621 INFO L443 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,621 INFO L443 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-15 20:51:25,621 INFO L443 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-15 20:51:25,621 INFO L443 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-11-15 20:51:25,621 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-15 20:51:25,621 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-15 20:51:25,621 INFO L443 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,621 INFO L443 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,622 INFO L443 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,622 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-15 20:51:25,622 INFO L443 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-11-15 20:51:25,622 INFO L443 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-11-15 20:51:25,622 INFO L443 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-11-15 20:51:25,622 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-15 20:51:25,622 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-15 20:51:25,622 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-11-15 20:51:25,623 INFO L443 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-11-15 20:51:25,623 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-15 20:51:25,623 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-15 20:51:25,623 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 20:51:25,623 INFO L443 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-11-15 20:51:25,623 INFO L443 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,623 INFO L443 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,623 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-15 20:51:25,624 INFO L443 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-11-15 20:51:25,624 INFO L443 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-11-15 20:51:25,624 INFO L443 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-11-15 20:51:25,624 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-15 20:51:25,624 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-15 20:51:25,624 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-11-15 20:51:25,624 INFO L443 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-11-15 20:51:25,624 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-15 20:51:25,625 INFO L439 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse8 (not .cse4)) (.cse1 (= ~a17~0 8)) (.cse9 (= 1 ~a11~0))) (let ((.cse2 (not (= ~a28~0 11))) (.cse0 (not .cse9)) (.cse6 (and .cse8 .cse1)) (.cse3 (= ~a19~0 1)) (.cse5 (= ~a28~0 9)) (.cse7 (= 10 ~a28~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse5) (and .cse6 .cse2) (and .cse3 .cse4 .cse2) (and .cse0 .cse6) (and .cse3 .cse7) (and .cse5 .cse4) (and .cse8 .cse9 .cse7))))) [2019-11-15 20:51:25,625 INFO L443 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,625 INFO L443 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,625 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-15 20:51:25,626 INFO L443 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-11-15 20:51:25,626 INFO L443 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-11-15 20:51:25,626 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-15 20:51:25,626 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-11-15 20:51:25,626 INFO L443 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-11-15 20:51:25,626 INFO L446 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-15 20:51:25,626 INFO L443 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,627 INFO L443 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,627 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-15 20:51:25,627 INFO L443 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-15 20:51:25,627 INFO L443 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-15 20:51:25,627 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-15 20:51:25,627 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-15 20:51:25,627 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-15 20:51:25,627 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-15 20:51:25,628 INFO L443 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-11-15 20:51:25,628 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-15 20:51:25,628 INFO L443 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,628 INFO L443 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,628 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-15 20:51:25,628 INFO L443 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-11-15 20:51:25,628 INFO L443 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-11-15 20:51:25,629 INFO L443 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-11-15 20:51:25,629 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-15 20:51:25,629 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-15 20:51:25,629 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1))) (let ((.cse8 (not .cse4)) (.cse1 (= ~a17~0 8)) (.cse9 (= 1 ~a11~0))) (let ((.cse2 (not (= ~a28~0 11))) (.cse0 (not .cse9)) (.cse6 (and .cse8 .cse1)) (.cse3 (= ~a19~0 1)) (.cse5 (= ~a28~0 9)) (.cse7 (= 10 ~a28~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse5) (and .cse6 .cse2) (and .cse3 .cse4 .cse2) (and .cse0 .cse6) (and .cse3 .cse7) (and .cse5 .cse4) (and .cse8 .cse9 .cse7))))) [2019-11-15 20:51:25,629 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,629 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,630 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-15 20:51:25,630 INFO L443 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-11-15 20:51:25,630 INFO L443 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-11-15 20:51:25,630 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-15 20:51:25,630 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-15 20:51:25,630 INFO L443 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,630 INFO L443 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,631 INFO L443 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-11-15 20:51:25,631 INFO L443 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-11-15 20:51:25,631 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-15 20:51:25,631 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-15 20:51:25,631 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-15 20:51:25,631 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-15 20:51:25,631 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-15 20:51:25,631 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-11-15 20:51:25,632 INFO L443 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-11-15 20:51:25,632 INFO L443 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,632 INFO L443 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,632 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-15 20:51:25,632 INFO L443 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,632 INFO L443 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-11-15 20:51:25,632 INFO L443 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-11-15 20:51:25,633 INFO L443 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-11-15 20:51:25,633 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-15 20:51:25,633 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-15 20:51:25,633 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:51:25,633 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-15 20:51:25,633 INFO L443 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,633 INFO L443 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,633 INFO L443 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,634 INFO L443 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-11-15 20:51:25,634 INFO L443 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-11-15 20:51:25,634 INFO L443 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-11-15 20:51:25,634 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-15 20:51:25,634 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-15 20:51:25,634 INFO L443 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,634 INFO L443 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,635 INFO L443 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,635 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-15 20:51:25,635 INFO L443 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-11-15 20:51:25,635 INFO L443 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-11-15 20:51:25,635 INFO L443 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-11-15 20:51:25,635 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-15 20:51:25,635 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-15 20:51:25,635 INFO L443 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,636 INFO L443 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,636 INFO L443 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,636 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-15 20:51:25,636 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-15 20:51:25,636 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-15 20:51:25,636 INFO L443 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-11-15 20:51:25,636 INFO L443 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-15 20:51:25,637 INFO L443 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-11-15 20:51:25,637 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:51:25,637 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-15 20:51:25,637 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-15 20:51:25,637 INFO L443 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,637 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,637 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,637 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-15 20:51:25,638 INFO L443 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-11-15 20:51:25,638 INFO L443 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-11-15 20:51:25,638 INFO L443 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-11-15 20:51:25,638 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-15 20:51:25,638 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,638 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,638 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 20:51:25,638 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-15 20:51:25,639 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-15 20:51:25,639 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-15 20:51:25,639 INFO L443 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-11-15 20:51:25,639 INFO L443 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-11-15 20:51:25,639 INFO L443 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-11-15 20:51:25,639 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-11-15 20:51:25,639 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-15 20:51:25,640 INFO L443 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-11-15 20:51:25,640 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-15 20:51:25,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:51:25 BoogieIcfgContainer [2019-11-15 20:51:25,657 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:51:25,657 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:51:25,657 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:51:25,658 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:51:25,658 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:51:16" (3/4) ... [2019-11-15 20:51:25,661 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 20:51:25,683 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 20:51:25,684 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 20:51:25,836 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_654180d0-9c48-4963-a489-54c5cef1843a/bin/uautomizer/witness.graphml [2019-11-15 20:51:25,836 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:51:25,838 INFO L168 Benchmark]: Toolchain (without parser) took 11662.19 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 425.7 MB). Free memory was 939.4 MB in the beginning and 1.4 GB in the end (delta: -431.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:51:25,838 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:51:25,838 INFO L168 Benchmark]: CACSL2BoogieTranslator took 642.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:51:25,839 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.82 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:51:25,839 INFO L168 Benchmark]: Boogie Preprocessor took 58.37 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:51:25,840 INFO L168 Benchmark]: RCFGBuilder took 1134.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.9 MB). Peak memory consumption was 103.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:51:25,840 INFO L168 Benchmark]: TraceAbstraction took 9568.47 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 280.0 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -394.9 MB). Peak memory consumption was 291.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:51:25,840 INFO L168 Benchmark]: Witness Printer took 179.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:51:25,843 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 642.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.82 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.37 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1134.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.9 MB). Peak memory consumption was 103.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9568.47 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 280.0 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -394.9 MB). Peak memory consumption was 291.3 MB. Max. memory is 11.5 GB. * Witness Printer took 179.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 523]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((!(1 == a11) && a17 == 8) && !(a28 == 11)) || ((!(1 == a11) && a19 == 1) && a25 == 1)) || (!(1 == a11) && a28 == 9)) || ((!(a25 == 1) && a17 == 8) && !(a28 == 11))) || ((a19 == 1 && a25 == 1) && !(a28 == 11))) || (!(1 == a11) && !(a25 == 1) && a17 == 8)) || (a19 == 1 && 10 == a28)) || (a28 == 9 && a25 == 1)) || ((!(a25 == 1) && 1 == a11) && 10 == a28) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((!(1 == a11) && a17 == 8) && !(a28 == 11)) || ((!(1 == a11) && a19 == 1) && a25 == 1)) || (!(1 == a11) && a28 == 9)) || ((!(a25 == 1) && a17 == 8) && !(a28 == 11))) || ((a19 == 1 && a25 == 1) && !(a28 == 11))) || (!(1 == a11) && !(a25 == 1) && a17 == 8)) || (a19 == 1 && 10 == a28)) || (a28 == 9 && a25 == 1)) || ((!(a25 == 1) && 1 == a11) && 10 == a28) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 9.4s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 893 SDtfs, 2186 SDslu, 285 SDs, 0 SdLazy, 5734 SolverSat, 861 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2270occurred 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.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1866 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 189 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2041 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 298 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1453 NumberOfCodeBlocks, 1453 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1444 ConstructedInterpolants, 0 QuantifiedInterpolants, 728663 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 463/463 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...