./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a2ea97dc-096a-409a-a6f0-00dc34459ca9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a2ea97dc-096a-409a-a6f0-00dc34459ca9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a2ea97dc-096a-409a-a6f0-00dc34459ca9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a2ea97dc-096a-409a-a6f0-00dc34459ca9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label10.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a2ea97dc-096a-409a-a6f0-00dc34459ca9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a2ea97dc-096a-409a-a6f0-00dc34459ca9/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 bbc1feb3ff32d0c91c18b795ac9c4037252af2bf ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:57:44,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:57:44,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:57:44,220 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:57:44,220 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:57:44,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:57:44,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:57:44,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:57:44,225 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:57:44,226 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:57:44,227 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:57:44,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:57:44,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:57:44,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:57:44,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:57:44,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:57:44,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:57:44,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:57:44,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:57:44,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:57:44,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:57:44,238 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:57:44,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:57:44,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:57:44,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:57:44,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:57:44,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:57:44,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:57:44,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:57:44,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:57:44,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:57:44,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:57:44,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:57:44,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:57:44,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:57:44,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:57:44,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:57:44,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:57:44,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:57:44,248 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:57:44,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:57:44,249 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a2ea97dc-096a-409a-a6f0-00dc34459ca9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:57:44,260 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:57:44,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:57:44,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:57:44,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:57:44,262 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:57:44,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:57:44,262 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:57:44,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:57:44,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:57:44,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:57:44,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:57:44,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:57:44,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:57:44,263 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:57:44,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:57:44,263 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:57:44,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:57:44,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:57:44,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:57:44,264 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:57:44,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:57:44,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:57:44,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:57:44,264 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:57:44,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:57:44,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:57:44,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:57:44,265 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:57:44,265 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:57:44,265 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_a2ea97dc-096a-409a-a6f0-00dc34459ca9/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 -> bbc1feb3ff32d0c91c18b795ac9c4037252af2bf [2019-12-07 17:57:44,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:57:44,382 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:57:44,385 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:57:44,386 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:57:44,387 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:57:44,387 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a2ea97dc-096a-409a-a6f0-00dc34459ca9/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label10.c [2019-12-07 17:57:44,434 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a2ea97dc-096a-409a-a6f0-00dc34459ca9/bin/uautomizer/data/4d16e1edf/8fe3a101f4b44fe7b84cd9652b3528cf/FLAGb27856d09 [2019-12-07 17:57:44,886 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:57:44,887 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a2ea97dc-096a-409a-a6f0-00dc34459ca9/sv-benchmarks/c/eca-rers2012/Problem03_label10.c [2019-12-07 17:57:44,899 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a2ea97dc-096a-409a-a6f0-00dc34459ca9/bin/uautomizer/data/4d16e1edf/8fe3a101f4b44fe7b84cd9652b3528cf/FLAGb27856d09 [2019-12-07 17:57:45,213 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a2ea97dc-096a-409a-a6f0-00dc34459ca9/bin/uautomizer/data/4d16e1edf/8fe3a101f4b44fe7b84cd9652b3528cf [2019-12-07 17:57:45,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:57:45,218 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:57:45,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:57:45,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:57:45,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:57:45,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:57:45" (1/1) ... [2019-12-07 17:57:45,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3272d5f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:45, skipping insertion in model container [2019-12-07 17:57:45,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:57:45" (1/1) ... [2019-12-07 17:57:45,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:57:45,283 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:57:45,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:57:45,688 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:57:45,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:57:45,850 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:57:45,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:45 WrapperNode [2019-12-07 17:57:45,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:57:45,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:57:45,851 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:57:45,851 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:57:45,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:45" (1/1) ... [2019-12-07 17:57:45,878 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:45" (1/1) ... [2019-12-07 17:57:45,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:57:45,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:57:45,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:57:45,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:57:45,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:45" (1/1) ... [2019-12-07 17:57:45,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:45" (1/1) ... [2019-12-07 17:57:45,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:45" (1/1) ... [2019-12-07 17:57:45,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:45" (1/1) ... [2019-12-07 17:57:45,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:45" (1/1) ... [2019-12-07 17:57:45,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:45" (1/1) ... [2019-12-07 17:57:45,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:45" (1/1) ... [2019-12-07 17:57:46,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:57:46,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:57:46,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:57:46,002 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:57:46,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2ea97dc-096a-409a-a6f0-00dc34459ca9/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-12-07 17:57:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:57:46,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:57:47,171 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:57:47,171 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 17:57:47,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:57:47 BoogieIcfgContainer [2019-12-07 17:57:47,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:57:47,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:57:47,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:57:47,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:57:47,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:57:45" (1/3) ... [2019-12-07 17:57:47,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4243e1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:57:47, skipping insertion in model container [2019-12-07 17:57:47,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:45" (2/3) ... [2019-12-07 17:57:47,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4243e1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:57:47, skipping insertion in model container [2019-12-07 17:57:47,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:57:47" (3/3) ... [2019-12-07 17:57:47,179 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label10.c [2019-12-07 17:57:47,188 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:57:47,195 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:57:47,205 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:57:47,229 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:57:47,229 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:57:47,229 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:57:47,230 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:57:47,230 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:57:47,230 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:57:47,230 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:57:47,230 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:57:47,248 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-12-07 17:57:47,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-12-07 17:57:47,260 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:47,261 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:57:47,261 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:47,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:47,265 INFO L82 PathProgramCache]: Analyzing trace with hash 991324555, now seen corresponding path program 1 times [2019-12-07 17:57:47,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:47,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92954516] [2019-12-07 17:57:47,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:47,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:47,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92954516] [2019-12-07 17:57:47,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:47,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:57:47,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411082669] [2019-12-07 17:57:47,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:47,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:47,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:47,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:47,690 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-12-07 17:57:48,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:48,881 INFO L93 Difference]: Finished difference Result 1075 states and 1929 transitions. [2019-12-07 17:57:48,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:48,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-12-07 17:57:48,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:48,896 INFO L225 Difference]: With dead ends: 1075 [2019-12-07 17:57:48,896 INFO L226 Difference]: Without dead ends: 677 [2019-12-07 17:57:48,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:48,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-12-07 17:57:48,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 451. [2019-12-07 17:57:48,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-12-07 17:57:48,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 700 transitions. [2019-12-07 17:57:48,946 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 700 transitions. Word has length 181 [2019-12-07 17:57:48,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:48,947 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 700 transitions. [2019-12-07 17:57:48,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:48,947 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 700 transitions. [2019-12-07 17:57:48,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-12-07 17:57:48,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:48,951 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:57:48,951 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:48,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:48,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1803921076, now seen corresponding path program 1 times [2019-12-07 17:57:48,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:48,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826452108] [2019-12-07 17:57:48,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:49,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:49,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826452108] [2019-12-07 17:57:49,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:49,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:57:49,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543682401] [2019-12-07 17:57:49,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:57:49,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:49,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:57:49,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:57:49,027 INFO L87 Difference]: Start difference. First operand 451 states and 700 transitions. Second operand 3 states. [2019-12-07 17:57:49,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:49,689 INFO L93 Difference]: Finished difference Result 1323 states and 2069 transitions. [2019-12-07 17:57:49,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:57:49,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-12-07 17:57:49,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:49,693 INFO L225 Difference]: With dead ends: 1323 [2019-12-07 17:57:49,694 INFO L226 Difference]: Without dead ends: 874 [2019-12-07 17:57:49,695 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:57:49,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-12-07 17:57:49,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 859. [2019-12-07 17:57:49,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-12-07 17:57:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1315 transitions. [2019-12-07 17:57:49,713 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1315 transitions. Word has length 189 [2019-12-07 17:57:49,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:49,713 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1315 transitions. [2019-12-07 17:57:49,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:57:49,713 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1315 transitions. [2019-12-07 17:57:49,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-12-07 17:57:49,716 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:49,717 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:57:49,717 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:49,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:49,717 INFO L82 PathProgramCache]: Analyzing trace with hash -716075313, now seen corresponding path program 1 times [2019-12-07 17:57:49,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:49,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726710251] [2019-12-07 17:57:49,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:49,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726710251] [2019-12-07 17:57:49,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:49,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:57:49,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516228906] [2019-12-07 17:57:49,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:57:49,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:49,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:57:49,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:57:49,771 INFO L87 Difference]: Start difference. First operand 859 states and 1315 transitions. Second operand 3 states. [2019-12-07 17:57:50,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:50,090 INFO L93 Difference]: Finished difference Result 1695 states and 2599 transitions. [2019-12-07 17:57:50,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:57:50,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-12-07 17:57:50,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:50,095 INFO L225 Difference]: With dead ends: 1695 [2019-12-07 17:57:50,096 INFO L226 Difference]: Without dead ends: 838 [2019-12-07 17:57:50,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:57:50,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-12-07 17:57:50,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-12-07 17:57:50,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-12-07 17:57:50,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1236 transitions. [2019-12-07 17:57:50,117 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1236 transitions. Word has length 194 [2019-12-07 17:57:50,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:50,117 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1236 transitions. [2019-12-07 17:57:50,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:57:50,118 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1236 transitions. [2019-12-07 17:57:50,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-12-07 17:57:50,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:50,121 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:57:50,121 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:50,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:50,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1122639935, now seen corresponding path program 1 times [2019-12-07 17:57:50,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:50,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108131726] [2019-12-07 17:57:50,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:50,191 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 17:57:50,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108131726] [2019-12-07 17:57:50,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:50,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:57:50,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250622825] [2019-12-07 17:57:50,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:50,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:50,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:50,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:50,192 INFO L87 Difference]: Start difference. First operand 838 states and 1236 transitions. Second operand 4 states. [2019-12-07 17:57:51,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:51,233 INFO L93 Difference]: Finished difference Result 3313 states and 4894 transitions. [2019-12-07 17:57:51,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:51,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-12-07 17:57:51,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:51,242 INFO L225 Difference]: With dead ends: 3313 [2019-12-07 17:57:51,242 INFO L226 Difference]: Without dead ends: 2477 [2019-12-07 17:57:51,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:51,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2019-12-07 17:57:51,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 1655. [2019-12-07 17:57:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2019-12-07 17:57:51,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2337 transitions. [2019-12-07 17:57:51,272 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2337 transitions. Word has length 195 [2019-12-07 17:57:51,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:51,273 INFO L462 AbstractCegarLoop]: Abstraction has 1655 states and 2337 transitions. [2019-12-07 17:57:51,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:51,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2337 transitions. [2019-12-07 17:57:51,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-12-07 17:57:51,275 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:51,276 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:57:51,276 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:51,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:51,276 INFO L82 PathProgramCache]: Analyzing trace with hash -331316582, now seen corresponding path program 1 times [2019-12-07 17:57:51,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:51,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094624664] [2019-12-07 17:57:51,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:51,326 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 17:57:51,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094624664] [2019-12-07 17:57:51,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:51,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:57:51,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136240136] [2019-12-07 17:57:51,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:57:51,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:51,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:57:51,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:57:51,327 INFO L87 Difference]: Start difference. First operand 1655 states and 2337 transitions. Second operand 3 states. [2019-12-07 17:57:51,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:51,898 INFO L93 Difference]: Finished difference Result 4133 states and 5815 transitions. [2019-12-07 17:57:51,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:57:51,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-12-07 17:57:51,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:51,907 INFO L225 Difference]: With dead ends: 4133 [2019-12-07 17:57:51,907 INFO L226 Difference]: Without dead ends: 2480 [2019-12-07 17:57:51,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:57:51,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2019-12-07 17:57:51,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2479. [2019-12-07 17:57:51,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2479 states. [2019-12-07 17:57:51,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 3454 transitions. [2019-12-07 17:57:51,949 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 3454 transitions. Word has length 198 [2019-12-07 17:57:51,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:51,949 INFO L462 AbstractCegarLoop]: Abstraction has 2479 states and 3454 transitions. [2019-12-07 17:57:51,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:57:51,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3454 transitions. [2019-12-07 17:57:51,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-12-07 17:57:51,954 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:51,954 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:57:51,955 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:51,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:51,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1798503547, now seen corresponding path program 1 times [2019-12-07 17:57:51,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:51,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731703911] [2019-12-07 17:57:51,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:52,038 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 17:57:52,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731703911] [2019-12-07 17:57:52,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:52,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:57:52,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5866364] [2019-12-07 17:57:52,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:57:52,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:52,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:57:52,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:57:52,040 INFO L87 Difference]: Start difference. First operand 2479 states and 3454 transitions. Second operand 3 states. [2019-12-07 17:57:52,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:52,295 INFO L93 Difference]: Finished difference Result 7424 states and 10346 transitions. [2019-12-07 17:57:52,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:57:52,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-12-07 17:57:52,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:52,311 INFO L225 Difference]: With dead ends: 7424 [2019-12-07 17:57:52,312 INFO L226 Difference]: Without dead ends: 4947 [2019-12-07 17:57:52,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:57:52,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4947 states. [2019-12-07 17:57:52,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4947 to 4945. [2019-12-07 17:57:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4945 states. [2019-12-07 17:57:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4945 states to 4945 states and 6884 transitions. [2019-12-07 17:57:52,370 INFO L78 Accepts]: Start accepts. Automaton has 4945 states and 6884 transitions. Word has length 201 [2019-12-07 17:57:52,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:52,370 INFO L462 AbstractCegarLoop]: Abstraction has 4945 states and 6884 transitions. [2019-12-07 17:57:52,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:57:52,370 INFO L276 IsEmpty]: Start isEmpty. Operand 4945 states and 6884 transitions. [2019-12-07 17:57:52,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-12-07 17:57:52,374 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:52,375 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:57:52,375 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:52,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:52,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1112433142, now seen corresponding path program 1 times [2019-12-07 17:57:52,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:52,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803993325] [2019-12-07 17:57:52,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 17:57:52,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803993325] [2019-12-07 17:57:52,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:52,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:57:52,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045877158] [2019-12-07 17:57:52,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:57:52,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:52,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:57:52,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:57:52,422 INFO L87 Difference]: Start difference. First operand 4945 states and 6884 transitions. Second operand 3 states. [2019-12-07 17:57:53,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:53,065 INFO L93 Difference]: Finished difference Result 14560 states and 20285 transitions. [2019-12-07 17:57:53,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:57:53,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-12-07 17:57:53,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:53,097 INFO L225 Difference]: With dead ends: 14560 [2019-12-07 17:57:53,097 INFO L226 Difference]: Without dead ends: 9617 [2019-12-07 17:57:53,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:57:53,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9617 states. [2019-12-07 17:57:53,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9617 to 9615. [2019-12-07 17:57:53,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9615 states. [2019-12-07 17:57:53,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9615 states to 9615 states and 12497 transitions. [2019-12-07 17:57:53,196 INFO L78 Accepts]: Start accepts. Automaton has 9615 states and 12497 transitions. Word has length 203 [2019-12-07 17:57:53,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:53,197 INFO L462 AbstractCegarLoop]: Abstraction has 9615 states and 12497 transitions. [2019-12-07 17:57:53,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:57:53,197 INFO L276 IsEmpty]: Start isEmpty. Operand 9615 states and 12497 transitions. [2019-12-07 17:57:53,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-12-07 17:57:53,203 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:53,203 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:57:53,203 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:53,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:53,203 INFO L82 PathProgramCache]: Analyzing trace with hash 579998981, now seen corresponding path program 2 times [2019-12-07 17:57:53,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:53,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734201251] [2019-12-07 17:57:53,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 17:57:53,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734201251] [2019-12-07 17:57:53,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:53,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:57:53,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664506165] [2019-12-07 17:57:53,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:57:53,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:53,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:57:53,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:57:53,287 INFO L87 Difference]: Start difference. First operand 9615 states and 12497 transitions. Second operand 3 states. [2019-12-07 17:57:53,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:53,983 INFO L93 Difference]: Finished difference Result 26540 states and 34570 transitions. [2019-12-07 17:57:53,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:57:53,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-12-07 17:57:53,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:54,015 INFO L225 Difference]: With dead ends: 26540 [2019-12-07 17:57:54,015 INFO L226 Difference]: Without dead ends: 16927 [2019-12-07 17:57:54,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:57:54,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16927 states. [2019-12-07 17:57:54,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16927 to 16923. [2019-12-07 17:57:54,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16923 states. [2019-12-07 17:57:54,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16923 states to 16923 states and 20100 transitions. [2019-12-07 17:57:54,166 INFO L78 Accepts]: Start accepts. Automaton has 16923 states and 20100 transitions. Word has length 205 [2019-12-07 17:57:54,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:54,166 INFO L462 AbstractCegarLoop]: Abstraction has 16923 states and 20100 transitions. [2019-12-07 17:57:54,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:57:54,166 INFO L276 IsEmpty]: Start isEmpty. Operand 16923 states and 20100 transitions. [2019-12-07 17:57:54,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-12-07 17:57:54,175 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:54,175 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:57:54,175 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:54,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:54,176 INFO L82 PathProgramCache]: Analyzing trace with hash -942107321, now seen corresponding path program 1 times [2019-12-07 17:57:54,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:54,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143505254] [2019-12-07 17:57:54,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:54,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143505254] [2019-12-07 17:57:54,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:54,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:54,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424133155] [2019-12-07 17:57:54,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:57:54,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:54,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:57:54,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:54,261 INFO L87 Difference]: Start difference. First operand 16923 states and 20100 transitions. Second operand 5 states. [2019-12-07 17:57:55,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:55,651 INFO L93 Difference]: Finished difference Result 35285 states and 41994 transitions. [2019-12-07 17:57:55,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:57:55,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 219 [2019-12-07 17:57:55,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:55,671 INFO L225 Difference]: With dead ends: 35285 [2019-12-07 17:57:55,671 INFO L226 Difference]: Without dead ends: 18364 [2019-12-07 17:57:55,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:55,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18364 states. [2019-12-07 17:57:55,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18364 to 17532. [2019-12-07 17:57:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17532 states. [2019-12-07 17:57:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17532 states to 17532 states and 20720 transitions. [2019-12-07 17:57:55,819 INFO L78 Accepts]: Start accepts. Automaton has 17532 states and 20720 transitions. Word has length 219 [2019-12-07 17:57:55,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:55,819 INFO L462 AbstractCegarLoop]: Abstraction has 17532 states and 20720 transitions. [2019-12-07 17:57:55,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:57:55,819 INFO L276 IsEmpty]: Start isEmpty. Operand 17532 states and 20720 transitions. [2019-12-07 17:57:55,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-12-07 17:57:55,828 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:55,828 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:57:55,828 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:55,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:55,829 INFO L82 PathProgramCache]: Analyzing trace with hash -765401032, now seen corresponding path program 1 times [2019-12-07 17:57:55,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:55,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628854957] [2019-12-07 17:57:55,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 17:57:55,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628854957] [2019-12-07 17:57:55,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:55,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:57:55,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509626817] [2019-12-07 17:57:55,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:55,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:55,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:55,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:55,899 INFO L87 Difference]: Start difference. First operand 17532 states and 20720 transitions. Second operand 4 states. [2019-12-07 17:57:56,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:56,604 INFO L93 Difference]: Finished difference Result 35064 states and 41442 transitions. [2019-12-07 17:57:56,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:57:56,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2019-12-07 17:57:56,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:56,619 INFO L225 Difference]: With dead ends: 35064 [2019-12-07 17:57:56,619 INFO L226 Difference]: Without dead ends: 17534 [2019-12-07 17:57:56,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:56,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17534 states. [2019-12-07 17:57:56,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17534 to 17532. [2019-12-07 17:57:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17532 states. [2019-12-07 17:57:56,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17532 states to 17532 states and 20181 transitions. [2019-12-07 17:57:56,797 INFO L78 Accepts]: Start accepts. Automaton has 17532 states and 20181 transitions. Word has length 223 [2019-12-07 17:57:56,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:56,797 INFO L462 AbstractCegarLoop]: Abstraction has 17532 states and 20181 transitions. [2019-12-07 17:57:56,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:56,797 INFO L276 IsEmpty]: Start isEmpty. Operand 17532 states and 20181 transitions. [2019-12-07 17:57:56,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-12-07 17:57:56,805 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:56,806 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:57:56,806 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:56,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:56,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1099774521, now seen corresponding path program 1 times [2019-12-07 17:57:56,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:56,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718431076] [2019-12-07 17:57:56,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:56,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718431076] [2019-12-07 17:57:56,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144508687] [2019-12-07 17:57:56,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2ea97dc-096a-409a-a6f0-00dc34459ca9/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:57:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:57,031 INFO L264 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:57:57,041 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:57:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 17:57:57,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:57:57,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-12-07 17:57:57,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728569455] [2019-12-07 17:57:57,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:57:57,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:57,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:57:57,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:57:57,103 INFO L87 Difference]: Start difference. First operand 17532 states and 20181 transitions. Second operand 3 states. [2019-12-07 17:57:57,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:57,681 INFO L93 Difference]: Finished difference Result 34660 states and 39922 transitions. [2019-12-07 17:57:57,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:57:57,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-12-07 17:57:57,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:57,695 INFO L225 Difference]: With dead ends: 34660 [2019-12-07 17:57:57,696 INFO L226 Difference]: Without dead ends: 17130 [2019-12-07 17:57:57,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:57:57,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17130 states. [2019-12-07 17:57:57,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17130 to 16314. [2019-12-07 17:57:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16314 states. [2019-12-07 17:57:57,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16314 states to 16314 states and 18381 transitions. [2019-12-07 17:57:57,826 INFO L78 Accepts]: Start accepts. Automaton has 16314 states and 18381 transitions. Word has length 229 [2019-12-07 17:57:57,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:57,826 INFO L462 AbstractCegarLoop]: Abstraction has 16314 states and 18381 transitions. [2019-12-07 17:57:57,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:57:57,827 INFO L276 IsEmpty]: Start isEmpty. Operand 16314 states and 18381 transitions. [2019-12-07 17:57:57,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-12-07 17:57:57,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:57,836 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:58,037 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:57:58,037 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:58,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:58,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1221063350, now seen corresponding path program 1 times [2019-12-07 17:57:58,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:58,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137699512] [2019-12-07 17:57:58,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 76 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 17:57:58,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137699512] [2019-12-07 17:57:58,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343603885] [2019-12-07 17:57:58,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2ea97dc-096a-409a-a6f0-00dc34459ca9/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:57:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:58,327 INFO L264 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:57:58,331 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:57:58,370 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 17:57:58,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:57:58,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2019-12-07 17:57:58,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373940261] [2019-12-07 17:57:58,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:57:58,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:58,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:57:58,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:58,372 INFO L87 Difference]: Start difference. First operand 16314 states and 18381 transitions. Second operand 3 states. [2019-12-07 17:57:58,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:58,736 INFO L93 Difference]: Finished difference Result 47676 states and 53681 transitions. [2019-12-07 17:57:58,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:57:58,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-12-07 17:57:58,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:58,758 INFO L225 Difference]: With dead ends: 47676 [2019-12-07 17:57:58,758 INFO L226 Difference]: Without dead ends: 31364 [2019-12-07 17:57:58,766 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:58,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31364 states. [2019-12-07 17:57:58,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31364 to 31362. [2019-12-07 17:57:58,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31362 states. [2019-12-07 17:57:59,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31362 states to 31362 states and 35287 transitions. [2019-12-07 17:57:59,012 INFO L78 Accepts]: Start accepts. Automaton has 31362 states and 35287 transitions. Word has length 258 [2019-12-07 17:57:59,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:59,012 INFO L462 AbstractCegarLoop]: Abstraction has 31362 states and 35287 transitions. [2019-12-07 17:57:59,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:57:59,012 INFO L276 IsEmpty]: Start isEmpty. Operand 31362 states and 35287 transitions. [2019-12-07 17:57:59,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-12-07 17:57:59,031 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:59,031 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 17:57:59,232 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:57:59,232 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:59,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:59,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1710674889, now seen corresponding path program 1 times [2019-12-07 17:57:59,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:59,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734595516] [2019-12-07 17:57:59,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:59,369 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 17:57:59,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734595516] [2019-12-07 17:57:59,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:59,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:57:59,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153723711] [2019-12-07 17:57:59,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:59,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:59,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:59,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:59,371 INFO L87 Difference]: Start difference. First operand 31362 states and 35287 transitions. Second operand 4 states. [2019-12-07 17:58:00,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:00,338 INFO L93 Difference]: Finished difference Result 88385 states and 99396 transitions. [2019-12-07 17:58:00,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:00,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 281 [2019-12-07 17:58:00,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:00,382 INFO L225 Difference]: With dead ends: 88385 [2019-12-07 17:58:00,382 INFO L226 Difference]: Without dead ends: 57025 [2019-12-07 17:58:00,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:00,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57025 states. [2019-12-07 17:58:00,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57025 to 57023. [2019-12-07 17:58:00,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57023 states. [2019-12-07 17:58:00,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57023 states to 57023 states and 64060 transitions. [2019-12-07 17:58:00,873 INFO L78 Accepts]: Start accepts. Automaton has 57023 states and 64060 transitions. Word has length 281 [2019-12-07 17:58:00,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:00,874 INFO L462 AbstractCegarLoop]: Abstraction has 57023 states and 64060 transitions. [2019-12-07 17:58:00,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 57023 states and 64060 transitions. [2019-12-07 17:58:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-12-07 17:58:00,895 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:00,896 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:00,896 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:00,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:00,896 INFO L82 PathProgramCache]: Analyzing trace with hash -625354885, now seen corresponding path program 1 times [2019-12-07 17:58:00,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:00,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357479680] [2019-12-07 17:58:00,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:01,040 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 17:58:01,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357479680] [2019-12-07 17:58:01,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:01,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:58:01,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414668828] [2019-12-07 17:58:01,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:58:01,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:01,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:58:01,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:58:01,042 INFO L87 Difference]: Start difference. First operand 57023 states and 64060 transitions. Second operand 3 states. [2019-12-07 17:58:01,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:01,635 INFO L93 Difference]: Finished difference Result 150649 states and 168878 transitions. [2019-12-07 17:58:01,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:58:01,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-12-07 17:58:01,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:01,715 INFO L225 Difference]: With dead ends: 150649 [2019-12-07 17:58:01,716 INFO L226 Difference]: Without dead ends: 93628 [2019-12-07 17:58:01,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:58:01,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93628 states. [2019-12-07 17:58:02,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93628 to 93626. [2019-12-07 17:58:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93626 states. [2019-12-07 17:58:02,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93626 states to 93626 states and 104802 transitions. [2019-12-07 17:58:02,515 INFO L78 Accepts]: Start accepts. Automaton has 93626 states and 104802 transitions. Word has length 332 [2019-12-07 17:58:02,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:02,515 INFO L462 AbstractCegarLoop]: Abstraction has 93626 states and 104802 transitions. [2019-12-07 17:58:02,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:58:02,515 INFO L276 IsEmpty]: Start isEmpty. Operand 93626 states and 104802 transitions. [2019-12-07 17:58:02,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-12-07 17:58:02,545 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:02,545 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:02,545 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:02,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:02,545 INFO L82 PathProgramCache]: Analyzing trace with hash -2069549447, now seen corresponding path program 1 times [2019-12-07 17:58:02,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:02,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502264321] [2019-12-07 17:58:02,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-12-07 17:58:02,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502264321] [2019-12-07 17:58:02,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:02,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:58:02,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440489105] [2019-12-07 17:58:02,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:02,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:02,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:02,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:02,634 INFO L87 Difference]: Start difference. First operand 93626 states and 104802 transitions. Second operand 4 states. [2019-12-07 17:58:03,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:03,968 INFO L93 Difference]: Finished difference Result 206331 states and 232381 transitions. [2019-12-07 17:58:03,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:03,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 344 [2019-12-07 17:58:03,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:04,065 INFO L225 Difference]: With dead ends: 206331 [2019-12-07 17:58:04,065 INFO L226 Difference]: Without dead ends: 112707 [2019-12-07 17:58:04,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:04,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112707 states. [2019-12-07 17:58:05,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112707 to 112691. [2019-12-07 17:58:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112691 states. [2019-12-07 17:58:05,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112691 states to 112691 states and 123941 transitions. [2019-12-07 17:58:05,348 INFO L78 Accepts]: Start accepts. Automaton has 112691 states and 123941 transitions. Word has length 344 [2019-12-07 17:58:05,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:05,349 INFO L462 AbstractCegarLoop]: Abstraction has 112691 states and 123941 transitions. [2019-12-07 17:58:05,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:05,349 INFO L276 IsEmpty]: Start isEmpty. Operand 112691 states and 123941 transitions. [2019-12-07 17:58:05,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-12-07 17:58:05,384 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:05,385 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:58:05,385 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:05,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:05,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1140434467, now seen corresponding path program 1 times [2019-12-07 17:58:05,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:05,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561477357] [2019-12-07 17:58:05,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-12-07 17:58:05,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561477357] [2019-12-07 17:58:05,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:05,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:58:05,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854656932] [2019-12-07 17:58:05,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:58:05,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:05,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:58:05,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:58:05,604 INFO L87 Difference]: Start difference. First operand 112691 states and 123941 transitions. Second operand 3 states. [2019-12-07 17:58:06,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:06,599 INFO L93 Difference]: Finished difference Result 244323 states and 269032 transitions. [2019-12-07 17:58:06,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:58:06,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 408 [2019-12-07 17:58:06,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:06,600 INFO L225 Difference]: With dead ends: 244323 [2019-12-07 17:58:06,600 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 17:58:06,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:58:06,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 17:58:06,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 17:58:06,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 17:58:06,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 17:58:06,654 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 408 [2019-12-07 17:58:06,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:06,654 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:58:06,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:58:06,654 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:58:06,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 17:58:06,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 17:58:07,830 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 672 DAG size of output: 172 [2019-12-07 17:58:08,750 WARN L192 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 672 DAG size of output: 172 [2019-12-07 17:58:09,931 WARN L192 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 172 DAG size of output: 86 [2019-12-07 17:58:11,312 WARN L192 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 172 DAG size of output: 86 [2019-12-07 17:58:11,314 INFO L246 CegarLoopResult]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-12-07 17:58:11,315 INFO L246 CegarLoopResult]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-12-07 17:58:11,315 INFO L246 CegarLoopResult]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,315 INFO L246 CegarLoopResult]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,315 INFO L246 CegarLoopResult]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,315 INFO L246 CegarLoopResult]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,315 INFO L246 CegarLoopResult]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,315 INFO L246 CegarLoopResult]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,315 INFO L246 CegarLoopResult]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,315 INFO L246 CegarLoopResult]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-12-07 17:58:11,315 INFO L246 CegarLoopResult]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,315 INFO L246 CegarLoopResult]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-12-07 17:58:11,315 INFO L246 CegarLoopResult]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-12-07 17:58:11,315 INFO L246 CegarLoopResult]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,315 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,315 INFO L246 CegarLoopResult]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,315 INFO L246 CegarLoopResult]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,316 INFO L246 CegarLoopResult]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-12-07 17:58:11,316 INFO L246 CegarLoopResult]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-12-07 17:58:11,316 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,316 INFO L246 CegarLoopResult]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,316 INFO L246 CegarLoopResult]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,316 INFO L246 CegarLoopResult]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,316 INFO L246 CegarLoopResult]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,316 INFO L246 CegarLoopResult]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,316 INFO L246 CegarLoopResult]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,316 INFO L246 CegarLoopResult]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,316 INFO L246 CegarLoopResult]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,316 INFO L246 CegarLoopResult]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,316 INFO L246 CegarLoopResult]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-12-07 17:58:11,316 INFO L246 CegarLoopResult]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-12-07 17:58:11,316 INFO L246 CegarLoopResult]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-12-07 17:58:11,316 INFO L246 CegarLoopResult]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,317 INFO L246 CegarLoopResult]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,317 INFO L246 CegarLoopResult]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,317 INFO L246 CegarLoopResult]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,317 INFO L246 CegarLoopResult]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,317 INFO L246 CegarLoopResult]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,317 INFO L246 CegarLoopResult]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-12-07 17:58:11,317 INFO L246 CegarLoopResult]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-12-07 17:58:11,317 INFO L246 CegarLoopResult]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-12-07 17:58:11,317 INFO L246 CegarLoopResult]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,317 INFO L246 CegarLoopResult]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,317 INFO L246 CegarLoopResult]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,317 INFO L246 CegarLoopResult]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,317 INFO L246 CegarLoopResult]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,317 INFO L246 CegarLoopResult]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,317 INFO L246 CegarLoopResult]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-12-07 17:58:11,317 INFO L246 CegarLoopResult]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-12-07 17:58:11,317 INFO L246 CegarLoopResult]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-12-07 17:58:11,318 INFO L246 CegarLoopResult]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,318 INFO L246 CegarLoopResult]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,318 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,318 INFO L246 CegarLoopResult]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-12-07 17:58:11,318 INFO L246 CegarLoopResult]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,318 INFO L246 CegarLoopResult]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-12-07 17:58:11,318 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,318 INFO L246 CegarLoopResult]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,318 INFO L246 CegarLoopResult]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-12-07 17:58:11,318 INFO L246 CegarLoopResult]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-12-07 17:58:11,318 INFO L246 CegarLoopResult]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,318 INFO L246 CegarLoopResult]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,318 INFO L246 CegarLoopResult]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,318 INFO L246 CegarLoopResult]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,318 INFO L246 CegarLoopResult]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,318 INFO L246 CegarLoopResult]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,318 INFO L246 CegarLoopResult]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,319 INFO L246 CegarLoopResult]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-12-07 17:58:11,319 INFO L246 CegarLoopResult]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-12-07 17:58:11,319 INFO L246 CegarLoopResult]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-12-07 17:58:11,319 INFO L246 CegarLoopResult]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-12-07 17:58:11,319 INFO L246 CegarLoopResult]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-12-07 17:58:11,319 INFO L246 CegarLoopResult]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,319 INFO L246 CegarLoopResult]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,319 INFO L246 CegarLoopResult]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,319 INFO L246 CegarLoopResult]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,319 INFO L246 CegarLoopResult]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,319 INFO L246 CegarLoopResult]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,319 INFO L246 CegarLoopResult]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,319 INFO L246 CegarLoopResult]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,319 INFO L246 CegarLoopResult]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,319 INFO L246 CegarLoopResult]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,319 INFO L246 CegarLoopResult]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-12-07 17:58:11,319 INFO L246 CegarLoopResult]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-12-07 17:58:11,320 INFO L246 CegarLoopResult]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-12-07 17:58:11,320 INFO L246 CegarLoopResult]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,320 INFO L246 CegarLoopResult]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,320 INFO L246 CegarLoopResult]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,320 INFO L246 CegarLoopResult]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,320 INFO L246 CegarLoopResult]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,320 INFO L246 CegarLoopResult]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,320 INFO L246 CegarLoopResult]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,320 INFO L246 CegarLoopResult]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,320 INFO L246 CegarLoopResult]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,320 INFO L246 CegarLoopResult]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-12-07 17:58:11,320 INFO L246 CegarLoopResult]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-12-07 17:58:11,320 INFO L246 CegarLoopResult]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-12-07 17:58:11,320 INFO L246 CegarLoopResult]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-12-07 17:58:11,320 INFO L246 CegarLoopResult]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-12-07 17:58:11,320 INFO L246 CegarLoopResult]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,320 INFO L246 CegarLoopResult]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,321 INFO L246 CegarLoopResult]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,321 INFO L246 CegarLoopResult]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,321 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,321 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 17:58:11,321 INFO L246 CegarLoopResult]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,321 INFO L246 CegarLoopResult]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,321 INFO L246 CegarLoopResult]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,321 INFO L246 CegarLoopResult]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-12-07 17:58:11,321 INFO L246 CegarLoopResult]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-12-07 17:58:11,321 INFO L246 CegarLoopResult]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-12-07 17:58:11,321 INFO L246 CegarLoopResult]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,321 INFO L246 CegarLoopResult]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,321 INFO L246 CegarLoopResult]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,321 INFO L246 CegarLoopResult]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-12-07 17:58:11,321 INFO L246 CegarLoopResult]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-12-07 17:58:11,321 INFO L246 CegarLoopResult]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,321 INFO L246 CegarLoopResult]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,322 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,322 INFO L246 CegarLoopResult]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-12-07 17:58:11,322 INFO L246 CegarLoopResult]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,322 INFO L246 CegarLoopResult]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-12-07 17:58:11,322 INFO L246 CegarLoopResult]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,322 INFO L246 CegarLoopResult]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-12-07 17:58:11,322 INFO L246 CegarLoopResult]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,322 INFO L246 CegarLoopResult]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,322 INFO L246 CegarLoopResult]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-12-07 17:58:11,322 INFO L246 CegarLoopResult]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-12-07 17:58:11,322 INFO L246 CegarLoopResult]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-12-07 17:58:11,322 INFO L246 CegarLoopResult]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-12-07 17:58:11,322 INFO L246 CegarLoopResult]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-12-07 17:58:11,322 INFO L246 CegarLoopResult]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-12-07 17:58:11,322 INFO L246 CegarLoopResult]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-12-07 17:58:11,322 INFO L246 CegarLoopResult]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,322 INFO L246 CegarLoopResult]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,323 INFO L246 CegarLoopResult]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,323 INFO L242 CegarLoopResult]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse13 (= 1 ~a6~0)) (.cse7 (= ~a27~0 1))) (let ((.cse14 (= 1 ~a4~0)) (.cse6 (<= ~a27~0 0)) (.cse10 (= 1 ~a3~0)) (.cse15 (not .cse7)) (.cse4 (= 1 ~a0~0)) (.cse12 (<= ~a3~0 0)) (.cse9 (<= ~a11~0 0)) (.cse5 (= ~a16~0 1)) (.cse0 (= 1 ~a5~0)) (.cse11 (not (= ~a12~0 1))) (.cse8 (not (= 1 ~a7~0))) (.cse2 (not .cse13)) (.cse1 (= ~a11~0 1)) (.cse3 (= ~a26~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse9 .cse4) (and .cse7 .cse10 .cse0 .cse11 .cse9 .cse3) (and .cse12 .cse7 .cse0 .cse2 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse0 .cse7 .cse11 .cse9 .cse2 .cse3) (and .cse0 .cse13 .cse11 .cse9 .cse4) (and .cse0 .cse13 .cse8 .cse9 .cse4 .cse5 .cse14 .cse6) (and .cse0 .cse13 .cse11 .cse1 .cse3) (and .cse7 .cse0 .cse13 .cse1 .cse3 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse9 .cse4 .cse5 .cse6) (and .cse10 .cse0 .cse7 .cse11 .cse8 .cse2 .cse1 .cse5) (and .cse0 .cse9 .cse2 .cse3 .cse14) (and .cse0 .cse15 .cse8 .cse11 .cse1 .cse2 .cse5) (and .cse0 .cse8 .cse11 .cse1 .cse2 .cse4) (and .cse7 .cse0 .cse13 .cse11 .cse8 .cse9) (and .cse7 .cse0 .cse9 .cse4 .cse5) (and .cse0 .cse11 .cse8 .cse9 .cse3) (and .cse12 .cse0 .cse8 .cse1 .cse3 .cse4) (and .cse0 .cse13 .cse11 .cse9 .cse14) (and .cse12 .cse7 .cse0 .cse13 .cse1 .cse4) (and .cse12 .cse0 .cse1 .cse3 .cse5 .cse14) (and .cse7 .cse0 .cse13 .cse9 .cse14) (and .cse7 .cse0 .cse13 .cse8 .cse1 .cse5 .cse14) (and .cse12 .cse0 .cse7 .cse11 .cse2 .cse1 .cse3 .cse5) (and .cse0 .cse9 .cse3 .cse4 .cse5 .cse14) (and .cse0 .cse9 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse15 .cse1 .cse2 .cse5 .cse3) (and .cse0 .cse1 .cse2 .cse3 .cse14) (and .cse10 .cse0 .cse8 .cse9 .cse4 .cse14) (and .cse10 .cse0 .cse13 .cse8 .cse1 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse14) (and .cse0 .cse8 .cse9 .cse3 .cse14) (and .cse7 .cse0 .cse9 .cse2 .cse4) (and .cse12 .cse0 .cse7 .cse11 .cse2 .cse1 .cse14) (and .cse0 .cse7 .cse11 .cse2 .cse1 .cse4) (and .cse0 .cse8 .cse9 .cse3 .cse4) (and .cse12 .cse7 .cse0 .cse13 .cse1 .cse3) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse0 .cse8 .cse2 .cse1 .cse3 .cse5) (and .cse10 .cse0 .cse9 .cse2 .cse4) (and .cse12 .cse0 .cse9 .cse2) (and .cse0 .cse8 .cse9 .cse2 .cse3) (and .cse12 .cse7 .cse0 .cse13 .cse11 .cse1) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse15 .cse11 .cse1 .cse2 .cse5 .cse4) (and .cse12 .cse7 .cse0 .cse9 .cse3 .cse5) (and .cse0 .cse7 .cse11 .cse8 .cse2 .cse1 .cse3)))) [2019-12-07 17:58:11,323 INFO L246 CegarLoopResult]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,324 INFO L246 CegarLoopResult]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,324 INFO L246 CegarLoopResult]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,324 INFO L246 CegarLoopResult]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-12-07 17:58:11,324 INFO L246 CegarLoopResult]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-12-07 17:58:11,324 INFO L246 CegarLoopResult]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,324 INFO L246 CegarLoopResult]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,324 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 17:58:11,324 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1578) no Hoare annotation was computed. [2019-12-07 17:58:11,324 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,324 INFO L249 CegarLoopResult]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-12-07 17:58:11,324 INFO L246 CegarLoopResult]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,324 INFO L246 CegarLoopResult]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,324 INFO L246 CegarLoopResult]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,324 INFO L246 CegarLoopResult]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,324 INFO L246 CegarLoopResult]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,324 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,325 INFO L246 CegarLoopResult]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-12-07 17:58:11,325 INFO L246 CegarLoopResult]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-12-07 17:58:11,325 INFO L246 CegarLoopResult]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,325 INFO L246 CegarLoopResult]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,325 INFO L246 CegarLoopResult]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,325 INFO L246 CegarLoopResult]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,325 INFO L246 CegarLoopResult]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,325 INFO L246 CegarLoopResult]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,325 INFO L246 CegarLoopResult]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,325 INFO L246 CegarLoopResult]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,325 INFO L246 CegarLoopResult]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,325 INFO L246 CegarLoopResult]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-12-07 17:58:11,325 INFO L246 CegarLoopResult]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-12-07 17:58:11,325 INFO L246 CegarLoopResult]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,325 INFO L246 CegarLoopResult]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,325 INFO L246 CegarLoopResult]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-12-07 17:58:11,325 INFO L246 CegarLoopResult]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-12-07 17:58:11,326 INFO L246 CegarLoopResult]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,326 INFO L242 CegarLoopResult]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse13 (= 1 ~a6~0)) (.cse7 (= ~a27~0 1))) (let ((.cse14 (= 1 ~a4~0)) (.cse6 (<= ~a27~0 0)) (.cse10 (= 1 ~a3~0)) (.cse15 (not .cse7)) (.cse4 (= 1 ~a0~0)) (.cse12 (<= ~a3~0 0)) (.cse9 (<= ~a11~0 0)) (.cse5 (= ~a16~0 1)) (.cse0 (= 1 ~a5~0)) (.cse11 (not (= ~a12~0 1))) (.cse8 (not (= 1 ~a7~0))) (.cse2 (not .cse13)) (.cse1 (= ~a11~0 1)) (.cse3 (= ~a26~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse9 .cse4) (and .cse7 .cse10 .cse0 .cse11 .cse9 .cse3) (and .cse12 .cse7 .cse0 .cse2 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse0 .cse7 .cse11 .cse9 .cse2 .cse3) (and .cse0 .cse13 .cse11 .cse9 .cse4) (and .cse0 .cse13 .cse8 .cse9 .cse4 .cse5 .cse14 .cse6) (and .cse0 .cse13 .cse11 .cse1 .cse3) (and .cse7 .cse0 .cse13 .cse1 .cse3 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse9 .cse4 .cse5 .cse6) (and .cse10 .cse0 .cse7 .cse11 .cse8 .cse2 .cse1 .cse5) (and .cse0 .cse9 .cse2 .cse3 .cse14) (and .cse0 .cse15 .cse8 .cse11 .cse1 .cse2 .cse5) (and .cse0 .cse8 .cse11 .cse1 .cse2 .cse4) (and .cse7 .cse0 .cse13 .cse11 .cse8 .cse9) (and .cse7 .cse0 .cse9 .cse4 .cse5) (and .cse0 .cse11 .cse8 .cse9 .cse3) (and .cse12 .cse0 .cse8 .cse1 .cse3 .cse4) (and .cse0 .cse13 .cse11 .cse9 .cse14) (and .cse12 .cse7 .cse0 .cse13 .cse1 .cse4) (and .cse12 .cse0 .cse1 .cse3 .cse5 .cse14) (and .cse7 .cse0 .cse13 .cse9 .cse14) (and .cse7 .cse0 .cse13 .cse8 .cse1 .cse5 .cse14) (and .cse12 .cse0 .cse7 .cse11 .cse2 .cse1 .cse3 .cse5) (and .cse0 .cse9 .cse3 .cse4 .cse5 .cse14) (and .cse0 .cse9 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse15 .cse1 .cse2 .cse5 .cse3) (and .cse0 .cse1 .cse2 .cse3 .cse14) (and .cse10 .cse0 .cse8 .cse9 .cse4 .cse14) (and .cse10 .cse0 .cse13 .cse8 .cse1 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse14) (and .cse0 .cse8 .cse9 .cse3 .cse14) (and .cse7 .cse0 .cse9 .cse2 .cse4) (and .cse12 .cse0 .cse7 .cse11 .cse2 .cse1 .cse14) (and .cse0 .cse7 .cse11 .cse2 .cse1 .cse4) (and .cse0 .cse8 .cse9 .cse3 .cse4) (and .cse12 .cse7 .cse0 .cse13 .cse1 .cse3) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse0 .cse8 .cse2 .cse1 .cse3 .cse5) (and .cse10 .cse0 .cse9 .cse2 .cse4) (and .cse12 .cse0 .cse9 .cse2) (and .cse0 .cse8 .cse9 .cse2 .cse3) (and .cse12 .cse7 .cse0 .cse13 .cse11 .cse1) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse15 .cse11 .cse1 .cse2 .cse5 .cse4) (and .cse12 .cse7 .cse0 .cse9 .cse3 .cse5) (and .cse0 .cse7 .cse11 .cse8 .cse2 .cse1 .cse3)))) [2019-12-07 17:58:11,326 INFO L246 CegarLoopResult]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,326 INFO L246 CegarLoopResult]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,326 INFO L246 CegarLoopResult]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,326 INFO L246 CegarLoopResult]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,326 INFO L246 CegarLoopResult]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-12-07 17:58:11,326 INFO L246 CegarLoopResult]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-12-07 17:58:11,326 INFO L246 CegarLoopResult]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,326 INFO L246 CegarLoopResult]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,327 INFO L246 CegarLoopResult]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,327 INFO L246 CegarLoopResult]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,327 INFO L246 CegarLoopResult]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,327 INFO L246 CegarLoopResult]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,327 INFO L246 CegarLoopResult]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,327 INFO L246 CegarLoopResult]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,327 INFO L246 CegarLoopResult]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-12-07 17:58:11,327 INFO L246 CegarLoopResult]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-12-07 17:58:11,327 INFO L246 CegarLoopResult]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-12-07 17:58:11,327 INFO L246 CegarLoopResult]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,327 INFO L246 CegarLoopResult]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-12-07 17:58:11,327 INFO L246 CegarLoopResult]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,327 INFO L246 CegarLoopResult]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,327 INFO L246 CegarLoopResult]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-12-07 17:58:11,327 INFO L246 CegarLoopResult]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,327 INFO L246 CegarLoopResult]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,327 INFO L246 CegarLoopResult]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,327 INFO L246 CegarLoopResult]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,328 INFO L246 CegarLoopResult]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,328 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-12-07 17:58:11,328 INFO L246 CegarLoopResult]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,328 INFO L246 CegarLoopResult]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-12-07 17:58:11,328 INFO L246 CegarLoopResult]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-12-07 17:58:11,328 INFO L246 CegarLoopResult]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-12-07 17:58:11,328 INFO L246 CegarLoopResult]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,328 INFO L246 CegarLoopResult]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,328 INFO L246 CegarLoopResult]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,328 INFO L246 CegarLoopResult]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,328 INFO L246 CegarLoopResult]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,328 INFO L246 CegarLoopResult]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,328 INFO L246 CegarLoopResult]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,328 INFO L246 CegarLoopResult]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,328 INFO L246 CegarLoopResult]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-12-07 17:58:11,328 INFO L246 CegarLoopResult]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-12-07 17:58:11,328 INFO L246 CegarLoopResult]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,329 INFO L246 CegarLoopResult]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,329 INFO L246 CegarLoopResult]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-12-07 17:58:11,329 INFO L246 CegarLoopResult]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-12-07 17:58:11,329 INFO L246 CegarLoopResult]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-12-07 17:58:11,329 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,329 INFO L246 CegarLoopResult]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,329 INFO L246 CegarLoopResult]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,329 INFO L246 CegarLoopResult]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,329 INFO L246 CegarLoopResult]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,329 INFO L246 CegarLoopResult]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,329 INFO L246 CegarLoopResult]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,329 INFO L246 CegarLoopResult]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,329 INFO L246 CegarLoopResult]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,329 INFO L246 CegarLoopResult]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,329 INFO L246 CegarLoopResult]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,329 INFO L246 CegarLoopResult]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-12-07 17:58:11,329 INFO L246 CegarLoopResult]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-12-07 17:58:11,330 INFO L246 CegarLoopResult]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-12-07 17:58:11,330 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 17:58:11,330 INFO L246 CegarLoopResult]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,330 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,330 INFO L246 CegarLoopResult]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,330 INFO L246 CegarLoopResult]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,330 INFO L246 CegarLoopResult]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,330 INFO L246 CegarLoopResult]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,330 INFO L246 CegarLoopResult]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,330 INFO L246 CegarLoopResult]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-12-07 17:58:11,330 INFO L246 CegarLoopResult]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-12-07 17:58:11,330 INFO L246 CegarLoopResult]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,330 INFO L246 CegarLoopResult]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-12-07 17:58:11,330 INFO L246 CegarLoopResult]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-12-07 17:58:11,330 INFO L246 CegarLoopResult]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-12-07 17:58:11,330 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,330 INFO L246 CegarLoopResult]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,331 INFO L246 CegarLoopResult]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,331 INFO L246 CegarLoopResult]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,331 INFO L246 CegarLoopResult]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,331 INFO L246 CegarLoopResult]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-12-07 17:58:11,331 INFO L246 CegarLoopResult]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-12-07 17:58:11,331 INFO L246 CegarLoopResult]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,331 INFO L246 CegarLoopResult]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,331 INFO L246 CegarLoopResult]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,331 INFO L246 CegarLoopResult]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-12-07 17:58:11,331 INFO L246 CegarLoopResult]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-12-07 17:58:11,331 INFO L246 CegarLoopResult]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,331 INFO L246 CegarLoopResult]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-12-07 17:58:11,331 INFO L246 CegarLoopResult]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,331 INFO L246 CegarLoopResult]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,331 INFO L246 CegarLoopResult]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,331 INFO L246 CegarLoopResult]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,331 INFO L246 CegarLoopResult]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,332 INFO L246 CegarLoopResult]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,332 INFO L246 CegarLoopResult]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,332 INFO L246 CegarLoopResult]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,332 INFO L246 CegarLoopResult]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,332 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,332 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 17:58:11,332 INFO L246 CegarLoopResult]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-12-07 17:58:11,332 INFO L246 CegarLoopResult]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-12-07 17:58:11,332 INFO L246 CegarLoopResult]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-12-07 17:58:11,332 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,332 INFO L246 CegarLoopResult]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-12-07 17:58:11,332 INFO L246 CegarLoopResult]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-12-07 17:58:11,332 INFO L246 CegarLoopResult]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,332 INFO L246 CegarLoopResult]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,332 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,332 INFO L246 CegarLoopResult]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,332 INFO L246 CegarLoopResult]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,332 INFO L246 CegarLoopResult]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,333 INFO L246 CegarLoopResult]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,333 INFO L246 CegarLoopResult]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,333 INFO L246 CegarLoopResult]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,333 INFO L246 CegarLoopResult]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-12-07 17:58:11,333 INFO L246 CegarLoopResult]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-12-07 17:58:11,333 INFO L246 CegarLoopResult]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-12-07 17:58:11,333 INFO L246 CegarLoopResult]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,333 INFO L246 CegarLoopResult]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,333 INFO L246 CegarLoopResult]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,333 INFO L246 CegarLoopResult]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,333 INFO L246 CegarLoopResult]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:58:11,333 INFO L246 CegarLoopResult]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,333 INFO L246 CegarLoopResult]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-12-07 17:58:11,333 INFO L246 CegarLoopResult]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-12-07 17:58:11,333 INFO L246 CegarLoopResult]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,333 INFO L246 CegarLoopResult]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-12-07 17:58:11,333 INFO L246 CegarLoopResult]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-12-07 17:58:11,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:58:11 BoogieIcfgContainer [2019-12-07 17:58:11,368 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:58:11,368 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:58:11,368 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:58:11,368 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:58:11,369 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:57:47" (3/4) ... [2019-12-07 17:58:11,371 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 17:58:11,393 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 17:58:11,396 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 17:58:11,541 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a2ea97dc-096a-409a-a6f0-00dc34459ca9/bin/uautomizer/witness.graphml [2019-12-07 17:58:11,541 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:58:11,542 INFO L168 Benchmark]: Toolchain (without parser) took 26324.97 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 938.2 MB in the beginning and 1.9 GB in the end (delta: -944.4 MB). Peak memory consumption was 910.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:58:11,542 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:58:11,543 INFO L168 Benchmark]: CACSL2BoogieTranslator took 631.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -123.9 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:58:11,543 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.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: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:58:11,543 INFO L168 Benchmark]: Boogie Preprocessor took 70.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:58:11,543 INFO L168 Benchmark]: RCFGBuilder took 1170.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.4 MB). Peak memory consumption was 196.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:58:11,544 INFO L168 Benchmark]: TraceAbstraction took 24194.19 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -946.7 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-12-07 17:58:11,544 INFO L168 Benchmark]: Witness Printer took 173.25 ms. Allocated memory is still 2.9 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 79.7 MB). Peak memory consumption was 79.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:58:11,545 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 631.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -123.9 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.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: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1170.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.4 MB). Peak memory consumption was 196.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24194.19 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -946.7 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 173.25 ms. Allocated memory is still 2.9 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 79.7 MB). Peak memory consumption was 79.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1578]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((1 == a5 && a11 == 1) && !(1 == a6)) && a26 == 1) && 1 == a0) && a16 == 1) && a27 <= 0) || ((((a27 == 1 && 1 == a5) && !(1 == a7)) && a11 <= 0) && 1 == a0)) || (((((a27 == 1 && 1 == a3) && 1 == a5) && !(a12 == 1)) && a11 <= 0) && a26 == 1)) || (((((((a3 <= 0 && a27 == 1) && 1 == a5) && !(1 == a6)) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || ((((1 == a5 && a11 <= 0) && !(1 == a6)) && a26 == 1) && 1 == a0)) || (((((1 == a5 && a27 == 1) && !(a12 == 1)) && a11 <= 0) && !(1 == a6)) && a26 == 1)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 <= 0) && 1 == a0)) || (((((((1 == a5 && 1 == a6) && !(1 == a7)) && a11 <= 0) && 1 == a0) && a16 == 1) && 1 == a4) && a27 <= 0)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 == 1) && a26 == 1)) || ((((((a27 == 1 && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || ((((((a3 <= 0 && 1 == a5) && !(1 == a7)) && a11 <= 0) && 1 == a0) && a16 == 1) && a27 <= 0)) || (((((((1 == a3 && 1 == a5) && a27 == 1) && !(a12 == 1)) && !(1 == a7)) && !(1 == a6)) && a11 == 1) && a16 == 1)) || ((((1 == a5 && a11 <= 0) && !(1 == a6)) && a26 == 1) && 1 == a4)) || ((((((1 == a5 && !(a27 == 1)) && !(1 == a7)) && !(a12 == 1)) && a11 == 1) && !(1 == a6)) && a16 == 1)) || (((((1 == a5 && !(1 == a7)) && !(a12 == 1)) && a11 == 1) && !(1 == a6)) && 1 == a0)) || (((((a27 == 1 && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(1 == a7)) && a11 <= 0)) || ((((a27 == 1 && 1 == a5) && a11 <= 0) && 1 == a0) && a16 == 1)) || ((((1 == a5 && !(a12 == 1)) && !(1 == a7)) && a11 <= 0) && a26 == 1)) || (((((a3 <= 0 && 1 == a5) && !(1 == a7)) && a11 == 1) && a26 == 1) && 1 == a0)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 <= 0) && 1 == a4)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a11 == 1) && 1 == a0)) || (((((a3 <= 0 && 1 == a5) && a11 == 1) && a26 == 1) && a16 == 1) && 1 == a4)) || ((((a27 == 1 && 1 == a5) && 1 == a6) && a11 <= 0) && 1 == a4)) || ((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 == 1) && a16 == 1) && 1 == a4)) || (((((((a3 <= 0 && 1 == a5) && a27 == 1) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && a26 == 1) && a16 == 1)) || (((((1 == a5 && a11 <= 0) && a26 == 1) && 1 == a0) && a16 == 1) && 1 == a4)) || (((((1 == a5 && a11 <= 0) && a26 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || ((((((a3 <= 0 && 1 == a5) && !(a27 == 1)) && a11 == 1) && !(1 == a6)) && a16 == 1) && a26 == 1)) || ((((1 == a5 && a11 == 1) && !(1 == a6)) && a26 == 1) && 1 == a4)) || (((((1 == a3 && 1 == a5) && !(1 == a7)) && a11 <= 0) && 1 == a0) && 1 == a4)) || ((((((1 == a3 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 == 1) && a16 == 1) && a27 <= 0)) || (((((a3 <= 0 && 1 == a5) && a11 == 1) && a26 == 1) && 1 == a0) && 1 == a4)) || ((((1 == a5 && !(1 == a7)) && a11 <= 0) && a26 == 1) && 1 == a4)) || ((((a27 == 1 && 1 == a5) && a11 <= 0) && !(1 == a6)) && 1 == a0)) || ((((((a3 <= 0 && 1 == a5) && a27 == 1) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && 1 == a4)) || (((((1 == a5 && a27 == 1) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && 1 == a0)) || ((((1 == a5 && !(1 == a7)) && a11 <= 0) && a26 == 1) && 1 == a0)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1)) || ((((((a3 <= 0 && 1 == a5) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || (((((((a3 <= 0 && a27 == 1) && 1 == a5) && !(1 == a7)) && !(1 == a6)) && a11 == 1) && a26 == 1) && a16 == 1)) || ((((1 == a3 && 1 == a5) && a11 <= 0) && !(1 == a6)) && 1 == a0)) || (((a3 <= 0 && 1 == a5) && a11 <= 0) && !(1 == a6))) || ((((1 == a5 && !(1 == a7)) && a11 <= 0) && !(1 == a6)) && a26 == 1)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 == 1)) || (((((1 == a5 && !(1 == a7)) && a11 == 1) && !(1 == a6)) && a26 == 1) && 1 == a0)) || ((((((1 == a5 && !(a27 == 1)) && !(a12 == 1)) && a11 == 1) && !(1 == a6)) && a16 == 1) && 1 == a0)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && a11 <= 0) && a26 == 1) && a16 == 1)) || ((((((1 == a5 && a27 == 1) && !(a12 == 1)) && !(1 == a7)) && !(1 == a6)) && a11 == 1) && a26 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((1 == a5 && a11 == 1) && !(1 == a6)) && a26 == 1) && 1 == a0) && a16 == 1) && a27 <= 0) || ((((a27 == 1 && 1 == a5) && !(1 == a7)) && a11 <= 0) && 1 == a0)) || (((((a27 == 1 && 1 == a3) && 1 == a5) && !(a12 == 1)) && a11 <= 0) && a26 == 1)) || (((((((a3 <= 0 && a27 == 1) && 1 == a5) && !(1 == a6)) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || ((((1 == a5 && a11 <= 0) && !(1 == a6)) && a26 == 1) && 1 == a0)) || (((((1 == a5 && a27 == 1) && !(a12 == 1)) && a11 <= 0) && !(1 == a6)) && a26 == 1)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 <= 0) && 1 == a0)) || (((((((1 == a5 && 1 == a6) && !(1 == a7)) && a11 <= 0) && 1 == a0) && a16 == 1) && 1 == a4) && a27 <= 0)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 == 1) && a26 == 1)) || ((((((a27 == 1 && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || ((((((a3 <= 0 && 1 == a5) && !(1 == a7)) && a11 <= 0) && 1 == a0) && a16 == 1) && a27 <= 0)) || (((((((1 == a3 && 1 == a5) && a27 == 1) && !(a12 == 1)) && !(1 == a7)) && !(1 == a6)) && a11 == 1) && a16 == 1)) || ((((1 == a5 && a11 <= 0) && !(1 == a6)) && a26 == 1) && 1 == a4)) || ((((((1 == a5 && !(a27 == 1)) && !(1 == a7)) && !(a12 == 1)) && a11 == 1) && !(1 == a6)) && a16 == 1)) || (((((1 == a5 && !(1 == a7)) && !(a12 == 1)) && a11 == 1) && !(1 == a6)) && 1 == a0)) || (((((a27 == 1 && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(1 == a7)) && a11 <= 0)) || ((((a27 == 1 && 1 == a5) && a11 <= 0) && 1 == a0) && a16 == 1)) || ((((1 == a5 && !(a12 == 1)) && !(1 == a7)) && a11 <= 0) && a26 == 1)) || (((((a3 <= 0 && 1 == a5) && !(1 == a7)) && a11 == 1) && a26 == 1) && 1 == a0)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 <= 0) && 1 == a4)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a11 == 1) && 1 == a0)) || (((((a3 <= 0 && 1 == a5) && a11 == 1) && a26 == 1) && a16 == 1) && 1 == a4)) || ((((a27 == 1 && 1 == a5) && 1 == a6) && a11 <= 0) && 1 == a4)) || ((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 == 1) && a16 == 1) && 1 == a4)) || (((((((a3 <= 0 && 1 == a5) && a27 == 1) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && a26 == 1) && a16 == 1)) || (((((1 == a5 && a11 <= 0) && a26 == 1) && 1 == a0) && a16 == 1) && 1 == a4)) || (((((1 == a5 && a11 <= 0) && a26 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || ((((((a3 <= 0 && 1 == a5) && !(a27 == 1)) && a11 == 1) && !(1 == a6)) && a16 == 1) && a26 == 1)) || ((((1 == a5 && a11 == 1) && !(1 == a6)) && a26 == 1) && 1 == a4)) || (((((1 == a3 && 1 == a5) && !(1 == a7)) && a11 <= 0) && 1 == a0) && 1 == a4)) || ((((((1 == a3 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 == 1) && a16 == 1) && a27 <= 0)) || (((((a3 <= 0 && 1 == a5) && a11 == 1) && a26 == 1) && 1 == a0) && 1 == a4)) || ((((1 == a5 && !(1 == a7)) && a11 <= 0) && a26 == 1) && 1 == a4)) || ((((a27 == 1 && 1 == a5) && a11 <= 0) && !(1 == a6)) && 1 == a0)) || ((((((a3 <= 0 && 1 == a5) && a27 == 1) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && 1 == a4)) || (((((1 == a5 && a27 == 1) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && 1 == a0)) || ((((1 == a5 && !(1 == a7)) && a11 <= 0) && a26 == 1) && 1 == a0)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1)) || ((((((a3 <= 0 && 1 == a5) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || (((((((a3 <= 0 && a27 == 1) && 1 == a5) && !(1 == a7)) && !(1 == a6)) && a11 == 1) && a26 == 1) && a16 == 1)) || ((((1 == a3 && 1 == a5) && a11 <= 0) && !(1 == a6)) && 1 == a0)) || (((a3 <= 0 && 1 == a5) && a11 <= 0) && !(1 == a6))) || ((((1 == a5 && !(1 == a7)) && a11 <= 0) && !(1 == a6)) && a26 == 1)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 == 1)) || (((((1 == a5 && !(1 == a7)) && a11 == 1) && !(1 == a6)) && a26 == 1) && 1 == a0)) || ((((((1 == a5 && !(a27 == 1)) && !(a12 == 1)) && a11 == 1) && !(1 == a6)) && a16 == 1) && 1 == a0)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && a11 <= 0) && a26 == 1) && a16 == 1)) || ((((((1 == a5 && a27 == 1) && !(a12 == 1)) && !(1 == a7)) && !(1 == a6)) && a11 == 1) && a26 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 19.4s, OverallIterations: 16, TraceHistogramMax: 4, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.6s, HoareTripleCheckerStatistics: 2855 SDtfs, 5400 SDslu, 1187 SDs, 0 SdLazy, 9799 SolverSat, 2103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 535 GetRequests, 502 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112691occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 2744 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 1202 NumberOfFragments, 1967 HoareAnnotationTreeSize, 3 FomulaSimplifications, 44514 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 7816 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 4347 NumberOfCodeBlocks, 4347 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4329 ConstructedInterpolants, 0 QuantifiedInterpolants, 1998649 SizeOfPredicates, 0 NumberOfNonLiveVariables, 862 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 1360/1367 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...