./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label28.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_06afb68f-8e75-4e56-b904-a400ab4052c4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_06afb68f-8e75-4e56-b904-a400ab4052c4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_06afb68f-8e75-4e56-b904-a400ab4052c4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_06afb68f-8e75-4e56-b904-a400ab4052c4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label28.c -s /tmp/vcloud-vcloud-master/worker/run_dir_06afb68f-8e75-4e56-b904-a400ab4052c4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_06afb68f-8e75-4e56-b904-a400ab4052c4/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 3b05d579dd12f755368a6bf22b0fd6149bd3ba2b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:49:25,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:49:25,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:49:25,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:49:25,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:49:25,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:49:25,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:49:25,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:49:25,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:49:25,456 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:49:25,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:49:25,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:49:25,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:49:25,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:49:25,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:49:25,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:49:25,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:49:25,465 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:49:25,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:49:25,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:49:25,475 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:49:25,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:49:25,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:49:25,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:49:25,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:49:25,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:49:25,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:49:25,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:49:25,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:49:25,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:49:25,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:49:25,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:49:25,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:49:25,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:49:25,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:49:25,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:49:25,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:49:25,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:49:25,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:49:25,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:49:25,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:49:25,494 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_06afb68f-8e75-4e56-b904-a400ab4052c4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:49:25,518 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:49:25,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:49:25,529 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:49:25,529 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:49:25,530 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:49:25,530 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:49:25,530 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:49:25,530 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:49:25,530 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:49:25,531 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:49:25,531 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:49:25,531 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:49:25,531 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:49:25,531 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:49:25,532 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:49:25,532 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:49:25,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:49:25,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:49:25,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:49:25,534 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:49:25,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:49:25,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:49:25,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:49:25,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:49:25,535 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:49:25,535 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:49:25,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:49:25,535 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:49:25,536 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_06afb68f-8e75-4e56-b904-a400ab4052c4/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 -> 3b05d579dd12f755368a6bf22b0fd6149bd3ba2b [2019-11-25 08:49:25,670 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:49:25,681 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:49:25,683 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:49:25,685 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:49:25,685 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:49:25,686 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_06afb68f-8e75-4e56-b904-a400ab4052c4/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label28.c [2019-11-25 08:49:25,743 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_06afb68f-8e75-4e56-b904-a400ab4052c4/bin/uautomizer/data/4d0b9a926/6161fa3e49aa43a5a98c9ce493cc63ee/FLAGadfc76dd2 [2019-11-25 08:49:26,202 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:49:26,210 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_06afb68f-8e75-4e56-b904-a400ab4052c4/sv-benchmarks/c/eca-rers2012/Problem01_label28.c [2019-11-25 08:49:26,219 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_06afb68f-8e75-4e56-b904-a400ab4052c4/bin/uautomizer/data/4d0b9a926/6161fa3e49aa43a5a98c9ce493cc63ee/FLAGadfc76dd2 [2019-11-25 08:49:26,481 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_06afb68f-8e75-4e56-b904-a400ab4052c4/bin/uautomizer/data/4d0b9a926/6161fa3e49aa43a5a98c9ce493cc63ee [2019-11-25 08:49:26,483 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:49:26,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:49:26,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:26,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:49:26,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:49:26,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:26" (1/1) ... [2019-11-25 08:49:26,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6247f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:26, skipping insertion in model container [2019-11-25 08:49:26,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:26" (1/1) ... [2019-11-25 08:49:26,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:49:26,559 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:49:27,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:49:27,072 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:49:27,193 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:49:27,211 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:49:27,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:27 WrapperNode [2019-11-25 08:49:27,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:27,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:27,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:49:27,213 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:49:27,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:27" (1/1) ... [2019-11-25 08:49:27,246 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:27" (1/1) ... [2019-11-25 08:49:27,308 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:27,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:49:27,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:49:27,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:49:27,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:27" (1/1) ... [2019-11-25 08:49:27,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:27" (1/1) ... [2019-11-25 08:49:27,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:27" (1/1) ... [2019-11-25 08:49:27,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:27" (1/1) ... [2019-11-25 08:49:27,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:27" (1/1) ... [2019-11-25 08:49:27,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:27" (1/1) ... [2019-11-25 08:49:27,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:27" (1/1) ... [2019-11-25 08:49:27,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:49:27,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:49:27,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:49:27,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:49:27,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06afb68f-8e75-4e56-b904-a400ab4052c4/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:49:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:49:27,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:49:28,573 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:49:28,574 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:49:28,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:28 BoogieIcfgContainer [2019-11-25 08:49:28,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:49:28,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:49:28,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:49:28,579 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:49:28,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:49:26" (1/3) ... [2019-11-25 08:49:28,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce8e19a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:49:28, skipping insertion in model container [2019-11-25 08:49:28,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:27" (2/3) ... [2019-11-25 08:49:28,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce8e19a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:49:28, skipping insertion in model container [2019-11-25 08:49:28,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:28" (3/3) ... [2019-11-25 08:49:28,582 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label28.c [2019-11-25 08:49:28,591 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:49:28,597 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:49:28,607 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:49:28,632 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:49:28,632 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:49:28,633 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:49:28,633 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:49:28,633 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:49:28,633 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:49:28,633 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:49:28,634 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:49:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-25 08:49:28,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-25 08:49:28,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:28,670 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] [2019-11-25 08:49:28,670 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:28,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:28,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1601987962, now seen corresponding path program 1 times [2019-11-25 08:49:28,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:28,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36036421] [2019-11-25 08:49:28,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:29,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:29,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36036421] [2019-11-25 08:49:29,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:29,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:29,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271313957] [2019-11-25 08:49:29,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:29,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:29,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:29,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:29,103 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-11-25 08:49:30,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:30,015 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-11-25 08:49:30,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:30,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-25 08:49:30,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:30,030 INFO L225 Difference]: With dead ends: 528 [2019-11-25 08:49:30,031 INFO L226 Difference]: Without dead ends: 266 [2019-11-25 08:49:30,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:30,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-25 08:49:30,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-11-25 08:49:30,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-25 08:49:30,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-25 08:49:30,088 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 93 [2019-11-25 08:49:30,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:30,088 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-25 08:49:30,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:30,089 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-25 08:49:30,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:49:30,093 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:30,093 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:30,094 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:30,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:30,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1168423854, now seen corresponding path program 1 times [2019-11-25 08:49:30,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:30,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293619574] [2019-11-25 08:49:30,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:30,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:30,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293619574] [2019-11-25 08:49:30,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:30,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:30,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061466954] [2019-11-25 08:49:30,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:30,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:30,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:30,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:30,168 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-25 08:49:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:30,807 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2019-11-25 08:49:30,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:30,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-25 08:49:30,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:30,812 INFO L225 Difference]: With dead ends: 792 [2019-11-25 08:49:30,812 INFO L226 Difference]: Without dead ends: 528 [2019-11-25 08:49:30,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:30,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-25 08:49:30,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-11-25 08:49:30,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-25 08:49:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 721 transitions. [2019-11-25 08:49:30,849 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 721 transitions. Word has length 98 [2019-11-25 08:49:30,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:30,849 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 721 transitions. [2019-11-25 08:49:30,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:30,850 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 721 transitions. [2019-11-25 08:49:30,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-25 08:49:30,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:30,856 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:49:30,856 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:30,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:30,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1574089224, now seen corresponding path program 1 times [2019-11-25 08:49:30,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:30,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689262525] [2019-11-25 08:49:30,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:30,928 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:30,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689262525] [2019-11-25 08:49:30,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:30,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:30,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670846372] [2019-11-25 08:49:30,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:30,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:30,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:30,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:30,933 INFO L87 Difference]: Start difference. First operand 528 states and 721 transitions. Second operand 4 states. [2019-11-25 08:49:31,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:31,760 INFO L93 Difference]: Finished difference Result 2102 states and 2876 transitions. [2019-11-25 08:49:31,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:49:31,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-25 08:49:31,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:31,770 INFO L225 Difference]: With dead ends: 2102 [2019-11-25 08:49:31,770 INFO L226 Difference]: Without dead ends: 1576 [2019-11-25 08:49:31,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:31,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-25 08:49:31,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2019-11-25 08:49:31,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-25 08:49:31,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2045 transitions. [2019-11-25 08:49:31,812 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2045 transitions. Word has length 102 [2019-11-25 08:49:31,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:31,813 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 2045 transitions. [2019-11-25 08:49:31,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:31,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2045 transitions. [2019-11-25 08:49:31,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-25 08:49:31,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:31,818 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-11-25 08:49:31,819 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:31,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:31,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1573040001, now seen corresponding path program 1 times [2019-11-25 08:49:31,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:31,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567932218] [2019-11-25 08:49:31,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:31,867 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-25 08:49:31,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567932218] [2019-11-25 08:49:31,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:31,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:31,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129445142] [2019-11-25 08:49:31,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:31,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:31,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:31,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:31,870 INFO L87 Difference]: Start difference. First operand 1576 states and 2045 transitions. Second operand 3 states. [2019-11-25 08:49:32,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:32,419 INFO L93 Difference]: Finished difference Result 3412 states and 4452 transitions. [2019-11-25 08:49:32,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:32,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-25 08:49:32,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:32,430 INFO L225 Difference]: With dead ends: 3412 [2019-11-25 08:49:32,430 INFO L226 Difference]: Without dead ends: 1838 [2019-11-25 08:49:32,433 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:32,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-25 08:49:32,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1314. [2019-11-25 08:49:32,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-25 08:49:32,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1699 transitions. [2019-11-25 08:49:32,470 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1699 transitions. Word has length 105 [2019-11-25 08:49:32,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:32,470 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1699 transitions. [2019-11-25 08:49:32,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:32,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1699 transitions. [2019-11-25 08:49:32,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-25 08:49:32,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:32,473 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:49:32,474 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:32,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:32,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1954141031, now seen corresponding path program 1 times [2019-11-25 08:49:32,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:32,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946920493] [2019-11-25 08:49:32,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:32,655 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:32,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946920493] [2019-11-25 08:49:32,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:32,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:32,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283866898] [2019-11-25 08:49:32,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:32,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:32,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:32,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:32,658 INFO L87 Difference]: Start difference. First operand 1314 states and 1699 transitions. Second operand 4 states. [2019-11-25 08:49:33,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:33,304 INFO L93 Difference]: Finished difference Result 2762 states and 3550 transitions. [2019-11-25 08:49:33,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:49:33,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-25 08:49:33,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:33,313 INFO L225 Difference]: With dead ends: 2762 [2019-11-25 08:49:33,313 INFO L226 Difference]: Without dead ends: 1450 [2019-11-25 08:49:33,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:33,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-11-25 08:49:33,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1445. [2019-11-25 08:49:33,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-25 08:49:33,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1836 transitions. [2019-11-25 08:49:33,352 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1836 transitions. Word has length 108 [2019-11-25 08:49:33,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:33,353 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1836 transitions. [2019-11-25 08:49:33,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:33,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1836 transitions. [2019-11-25 08:49:33,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-25 08:49:33,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:33,357 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:33,357 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:33,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:33,358 INFO L82 PathProgramCache]: Analyzing trace with hash -376310369, now seen corresponding path program 1 times [2019-11-25 08:49:33,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:33,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954775448] [2019-11-25 08:49:33,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:33,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954775448] [2019-11-25 08:49:33,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:33,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:49:33,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576185022] [2019-11-25 08:49:33,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:49:33,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:33,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:49:33,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:33,469 INFO L87 Difference]: Start difference. First operand 1445 states and 1836 transitions. Second operand 5 states. [2019-11-25 08:49:34,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:34,377 INFO L93 Difference]: Finished difference Result 2757 states and 3533 transitions. [2019-11-25 08:49:34,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:49:34,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-11-25 08:49:34,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:34,387 INFO L225 Difference]: With dead ends: 2757 [2019-11-25 08:49:34,387 INFO L226 Difference]: Without dead ends: 1445 [2019-11-25 08:49:34,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:34,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-25 08:49:34,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-25 08:49:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-25 08:49:34,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1806 transitions. [2019-11-25 08:49:34,417 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1806 transitions. Word has length 112 [2019-11-25 08:49:34,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:34,418 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1806 transitions. [2019-11-25 08:49:34,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:49:34,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1806 transitions. [2019-11-25 08:49:34,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-25 08:49:34,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:34,421 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-25 08:49:34,421 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:34,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:34,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1702667398, now seen corresponding path program 1 times [2019-11-25 08:49:34,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:34,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034230171] [2019-11-25 08:49:34,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:34,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034230171] [2019-11-25 08:49:34,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:34,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:34,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502084979] [2019-11-25 08:49:34,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:34,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:34,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:34,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:34,463 INFO L87 Difference]: Start difference. First operand 1445 states and 1806 transitions. Second operand 3 states. [2019-11-25 08:49:34,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:34,873 INFO L93 Difference]: Finished difference Result 3150 states and 3956 transitions. [2019-11-25 08:49:34,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:34,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-11-25 08:49:34,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:34,882 INFO L225 Difference]: With dead ends: 3150 [2019-11-25 08:49:34,882 INFO L226 Difference]: Without dead ends: 1707 [2019-11-25 08:49:34,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:34,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-25 08:49:34,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2019-11-25 08:49:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-25 08:49:34,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1665 transitions. [2019-11-25 08:49:34,917 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1665 transitions. Word has length 115 [2019-11-25 08:49:34,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:34,917 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1665 transitions. [2019-11-25 08:49:34,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:34,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1665 transitions. [2019-11-25 08:49:34,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-25 08:49:34,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:34,949 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:34,949 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:34,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:34,949 INFO L82 PathProgramCache]: Analyzing trace with hash 970685544, now seen corresponding path program 1 times [2019-11-25 08:49:34,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:34,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144357867] [2019-11-25 08:49:34,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-25 08:49:34,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144357867] [2019-11-25 08:49:34,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:34,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:34,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898895581] [2019-11-25 08:49:34,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:34,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:34,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:34,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:35,000 INFO L87 Difference]: Start difference. First operand 1445 states and 1665 transitions. Second operand 3 states. [2019-11-25 08:49:35,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:35,379 INFO L93 Difference]: Finished difference Result 2888 states and 3326 transitions. [2019-11-25 08:49:35,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:35,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-25 08:49:35,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:35,385 INFO L225 Difference]: With dead ends: 2888 [2019-11-25 08:49:35,385 INFO L226 Difference]: Without dead ends: 1445 [2019-11-25 08:49:35,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:35,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-25 08:49:35,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-25 08:49:35,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-25 08:49:35,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1593 transitions. [2019-11-25 08:49:35,414 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1593 transitions. Word has length 123 [2019-11-25 08:49:35,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:35,414 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1593 transitions. [2019-11-25 08:49:35,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:35,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1593 transitions. [2019-11-25 08:49:35,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-25 08:49:35,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:35,417 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:35,417 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:35,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:35,418 INFO L82 PathProgramCache]: Analyzing trace with hash 2027458046, now seen corresponding path program 1 times [2019-11-25 08:49:35,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:35,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505238267] [2019-11-25 08:49:35,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:36,122 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:36,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505238267] [2019-11-25 08:49:36,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:36,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-25 08:49:36,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744476145] [2019-11-25 08:49:36,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 08:49:36,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:36,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:49:36,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:49:36,125 INFO L87 Difference]: Start difference. First operand 1445 states and 1593 transitions. Second operand 12 states. [2019-11-25 08:49:37,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:37,388 INFO L93 Difference]: Finished difference Result 3260 states and 3653 transitions. [2019-11-25 08:49:37,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-25 08:49:37,389 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2019-11-25 08:49:37,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:37,398 INFO L225 Difference]: With dead ends: 3260 [2019-11-25 08:49:37,399 INFO L226 Difference]: Without dead ends: 1914 [2019-11-25 08:49:37,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:49:37,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2019-11-25 08:49:37,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1742. [2019-11-25 08:49:37,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-11-25 08:49:37,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1908 transitions. [2019-11-25 08:49:37,434 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1908 transitions. Word has length 130 [2019-11-25 08:49:37,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:37,435 INFO L462 AbstractCegarLoop]: Abstraction has 1742 states and 1908 transitions. [2019-11-25 08:49:37,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 08:49:37,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1908 transitions. [2019-11-25 08:49:37,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-25 08:49:37,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:37,442 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:37,442 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:37,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:37,443 INFO L82 PathProgramCache]: Analyzing trace with hash 591091391, now seen corresponding path program 1 times [2019-11-25 08:49:37,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:37,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937760758] [2019-11-25 08:49:37,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:37,600 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-25 08:49:37,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937760758] [2019-11-25 08:49:37,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:37,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:49:37,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131244185] [2019-11-25 08:49:37,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:37,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:37,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:37,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:37,602 INFO L87 Difference]: Start difference. First operand 1742 states and 1908 transitions. Second operand 4 states. [2019-11-25 08:49:38,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:38,345 INFO L93 Difference]: Finished difference Result 3613 states and 3988 transitions. [2019-11-25 08:49:38,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:49:38,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-11-25 08:49:38,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:38,356 INFO L225 Difference]: With dead ends: 3613 [2019-11-25 08:49:38,358 INFO L226 Difference]: Without dead ends: 1873 [2019-11-25 08:49:38,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:38,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2019-11-25 08:49:38,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1742. [2019-11-25 08:49:38,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-11-25 08:49:38,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1878 transitions. [2019-11-25 08:49:38,392 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1878 transitions. Word has length 200 [2019-11-25 08:49:38,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:38,394 INFO L462 AbstractCegarLoop]: Abstraction has 1742 states and 1878 transitions. [2019-11-25 08:49:38,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:38,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1878 transitions. [2019-11-25 08:49:38,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-25 08:49:38,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:38,399 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-25 08:49:38,400 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:38,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:38,401 INFO L82 PathProgramCache]: Analyzing trace with hash 490719990, now seen corresponding path program 1 times [2019-11-25 08:49:38,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:38,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994758863] [2019-11-25 08:49:38,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:38,573 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-25 08:49:38,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994758863] [2019-11-25 08:49:38,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:38,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:38,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321324440] [2019-11-25 08:49:38,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:38,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:38,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:38,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:38,576 INFO L87 Difference]: Start difference. First operand 1742 states and 1878 transitions. Second operand 3 states. [2019-11-25 08:49:38,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:38,943 INFO L93 Difference]: Finished difference Result 1744 states and 1879 transitions. [2019-11-25 08:49:38,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:38,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-11-25 08:49:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:38,952 INFO L225 Difference]: With dead ends: 1744 [2019-11-25 08:49:38,952 INFO L226 Difference]: Without dead ends: 1742 [2019-11-25 08:49:38,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:38,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2019-11-25 08:49:38,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1742. [2019-11-25 08:49:38,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-11-25 08:49:38,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1877 transitions. [2019-11-25 08:49:38,987 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1877 transitions. Word has length 208 [2019-11-25 08:49:38,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:38,988 INFO L462 AbstractCegarLoop]: Abstraction has 1742 states and 1877 transitions. [2019-11-25 08:49:38,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:38,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1877 transitions. [2019-11-25 08:49:38,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-11-25 08:49:38,994 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:38,994 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:38,994 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:38,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:38,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1524272564, now seen corresponding path program 1 times [2019-11-25 08:49:38,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:38,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959405704] [2019-11-25 08:49:38,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:40,142 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 351 proven. 8 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-25 08:49:40,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959405704] [2019-11-25 08:49:40,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750511024] [2019-11-25 08:49:40,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06afb68f-8e75-4e56-b904-a400ab4052c4/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:40,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:49:40,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:40,431 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-11-25 08:49:40,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:49:40,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2019-11-25 08:49:40,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330508727] [2019-11-25 08:49:40,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:40,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:40,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:40,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:49:40,433 INFO L87 Difference]: Start difference. First operand 1742 states and 1877 transitions. Second operand 3 states. [2019-11-25 08:49:40,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:40,832 INFO L93 Difference]: Finished difference Result 1742 states and 1877 transitions. [2019-11-25 08:49:40,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:40,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2019-11-25 08:49:40,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:40,834 INFO L225 Difference]: With dead ends: 1742 [2019-11-25 08:49:40,834 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:49:40,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 287 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:49:40,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:49:40,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:49:40,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:49:40,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:49:40,836 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 283 [2019-11-25 08:49:40,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:40,836 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:49:40,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:40,837 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:49:40,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:49:41,044 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:41,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:49:41,252 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-11-25 08:49:41,430 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-11-25 08:49:41,433 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-25 08:49:41,433 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-25 08:49:41,433 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,433 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,433 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,433 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,433 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,433 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,434 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-25 08:49:41,434 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-25 08:49:41,434 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-25 08:49:41,434 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-25 08:49:41,434 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-25 08:49:41,434 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-25 08:49:41,434 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-25 08:49:41,434 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-25 08:49:41,434 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-25 08:49:41,434 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-25 08:49:41,434 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,435 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,435 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,435 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,435 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,435 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,435 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-25 08:49:41,435 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-25 08:49:41,435 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-25 08:49:41,435 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-25 08:49:41,435 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-25 08:49:41,435 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-25 08:49:41,436 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-25 08:49:41,436 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-25 08:49:41,436 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-25 08:49:41,436 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-25 08:49:41,436 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-25 08:49:41,436 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-25 08:49:41,436 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-25 08:49:41,436 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-25 08:49:41,436 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-25 08:49:41,436 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,436 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,436 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,437 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,437 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,437 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-25 08:49:41,437 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-25 08:49:41,437 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-25 08:49:41,437 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-25 08:49:41,440 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-25 08:49:41,440 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-25 08:49:41,440 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-25 08:49:41,440 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-25 08:49:41,440 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-25 08:49:41,441 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= 1 ~a7~0))) (let ((.cse1 (<= ~a21~0 0)) (.cse2 (not (= ~a16~0 6))) (.cse3 (= ~a17~0 1)) (.cse5 (= ~a16~0 4)) (.cse6 (not .cse0)) (.cse4 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 (= ~a12~0 8) (= ~a20~0 1)) (and .cse2 .cse3 .cse4) (and .cse5 (<= ~a17~0 0) .cse4) (and .cse4 (= ~a16~0 5)) (and .cse6 .cse4 (= 15 ~a8~0)) (and .cse6 .cse3 .cse4) (and .cse5 .cse6 .cse4)))) [2019-11-25 08:49:41,441 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,441 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,441 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,441 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,442 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,442 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-25 08:49:41,442 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-25 08:49:41,442 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-25 08:49:41,442 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-25 08:49:41,442 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-25 08:49:41,442 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-25 08:49:41,443 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-25 08:49:41,443 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-25 08:49:41,443 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-25 08:49:41,443 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-25 08:49:41,443 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-25 08:49:41,443 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-25 08:49:41,443 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-25 08:49:41,444 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-25 08:49:41,444 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,444 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,444 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,444 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,444 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,444 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-25 08:49:41,445 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-25 08:49:41,445 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-25 08:49:41,445 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-25 08:49:41,445 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-25 08:49:41,445 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-25 08:49:41,445 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-25 08:49:41,445 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-25 08:49:41,446 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-25 08:49:41,446 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,446 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,446 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,446 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,446 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-25 08:49:41,446 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,447 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-25 08:49:41,447 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-25 08:49:41,447 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-25 08:49:41,447 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-25 08:49:41,447 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-25 08:49:41,447 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-25 08:49:41,447 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-25 08:49:41,447 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:49:41,448 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-25 08:49:41,448 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-25 08:49:41,448 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-25 08:49:41,448 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-25 08:49:41,448 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-25 08:49:41,448 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-25 08:49:41,448 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,449 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= 1 ~a7~0))) (let ((.cse1 (<= ~a21~0 0)) (.cse2 (not (= ~a16~0 6))) (.cse3 (= ~a17~0 1)) (.cse5 (= ~a16~0 4)) (.cse6 (not .cse0)) (.cse4 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 (= ~a12~0 8) (= ~a20~0 1)) (and .cse2 .cse3 .cse4) (and .cse5 (<= ~a17~0 0) .cse4) (and .cse4 (= ~a16~0 5)) (and .cse6 .cse4 (= 15 ~a8~0)) (and .cse6 .cse3 .cse4) (and .cse5 .cse6 .cse4)))) [2019-11-25 08:49:41,449 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,449 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,449 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,449 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,450 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-25 08:49:41,450 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-25 08:49:41,450 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-25 08:49:41,450 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-25 08:49:41,450 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-25 08:49:41,450 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-25 08:49:41,450 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-25 08:49:41,450 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-25 08:49:41,451 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,451 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,451 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,451 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,451 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,451 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-25 08:49:41,451 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:49:41,452 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-25 08:49:41,452 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-25 08:49:41,452 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-25 08:49:41,452 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-25 08:49:41,452 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-25 08:49:41,452 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-25 08:49:41,452 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-25 08:49:41,453 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-25 08:49:41,453 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-25 08:49:41,453 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-25 08:49:41,453 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-25 08:49:41,453 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,453 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,453 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,454 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,454 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-25 08:49:41,454 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,454 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,454 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-25 08:49:41,454 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-25 08:49:41,454 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:49:41,455 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-25 08:49:41,455 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-25 08:49:41,455 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-25 08:49:41,455 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-25 08:49:41,455 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-25 08:49:41,455 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-25 08:49:41,455 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-25 08:49:41,456 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-25 08:49:41,456 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-25 08:49:41,456 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-25 08:49:41,456 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,456 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,456 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,456 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,457 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,457 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-25 08:49:41,457 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,457 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-25 08:49:41,457 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-25 08:49:41,457 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-25 08:49:41,457 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-25 08:49:41,458 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-25 08:49:41,458 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-25 08:49:41,458 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-25 08:49:41,458 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-25 08:49:41,458 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-25 08:49:41,458 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-25 08:49:41,458 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-25 08:49:41,458 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-25 08:49:41,459 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 455) no Hoare annotation was computed. [2019-11-25 08:49:41,459 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-25 08:49:41,459 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-25 08:49:41,459 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-25 08:49:41,459 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,459 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,460 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,460 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,460 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,460 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:41,460 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-25 08:49:41,460 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-25 08:49:41,460 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-25 08:49:41,461 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-25 08:49:41,461 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-25 08:49:41,461 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-25 08:49:41,461 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-25 08:49:41,461 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-25 08:49:41,461 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-25 08:49:41,461 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-25 08:49:41,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:49:41 BoogieIcfgContainer [2019-11-25 08:49:41,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:49:41,479 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:49:41,479 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:49:41,480 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:49:41,480 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:28" (3/4) ... [2019-11-25 08:49:41,491 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:49:41,510 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 08:49:41,511 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:49:41,676 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_06afb68f-8e75-4e56-b904-a400ab4052c4/bin/uautomizer/witness.graphml [2019-11-25 08:49:41,676 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:49:41,678 INFO L168 Benchmark]: Toolchain (without parser) took 15193.74 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 528.5 MB). Free memory was 944.7 MB in the beginning and 1.5 GB in the end (delta: -520.4 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:41,678 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:49:41,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 728.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -210.0 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:41,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:41,680 INFO L168 Benchmark]: Boogie Preprocessor took 56.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:49:41,680 INFO L168 Benchmark]: RCFGBuilder took 1208.39 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: 106.7 MB). Peak memory consumption was 106.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:41,680 INFO L168 Benchmark]: TraceAbstraction took 12902.93 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 337.1 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -453.8 MB). Peak memory consumption was 403.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:41,681 INFO L168 Benchmark]: Witness Printer took 197.17 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:41,683 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 728.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -210.0 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1208.39 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: 106.7 MB). Peak memory consumption was 106.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12902.93 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 337.1 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -453.8 MB). Peak memory consumption was 403.5 MB. Max. memory is 11.5 GB. * Witness Printer took 197.17 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 455]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((1 == a7 && a21 <= 0) && !(a16 == 6)) || (((1 == a7 && a21 <= 0) && a12 == 8) && a20 == 1)) || ((!(a16 == 6) && a17 == 1) && a21 == 1)) || ((a16 == 4 && a17 <= 0) && a21 == 1)) || (a21 == 1 && a16 == 5)) || ((!(1 == a7) && a21 == 1) && 15 == a8)) || ((!(1 == a7) && a17 == 1) && a21 == 1)) || ((a16 == 4 && !(1 == a7)) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((1 == a7 && a21 <= 0) && !(a16 == 6)) || (((1 == a7 && a21 <= 0) && a12 == 8) && a20 == 1)) || ((!(a16 == 6) && a17 == 1) && a21 == 1)) || ((a16 == 4 && a17 <= 0) && a21 == 1)) || (a21 == 1 && a16 == 5)) || ((!(1 == a7) && a21 == 1) && 15 == a8)) || ((!(1 == a7) && a17 == 1) && a21 == 1)) || ((a16 == 4 && !(1 == a7)) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 12.8s, OverallIterations: 12, TraceHistogramMax: 7, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 887 SDtfs, 2590 SDslu, 128 SDs, 0 SdLazy, 5907 SolverSat, 779 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 306 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1742occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 1094 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 39 NumberOfFragments, 173 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1622 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 120 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1960 NumberOfCodeBlocks, 1960 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1947 ConstructedInterpolants, 0 QuantifiedInterpolants, 1696138 SizeOfPredicates, 1 NumberOfNonLiveVariables, 514 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1511/1519 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...