./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label18.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_035fd684-3908-460f-9f61-0b401368a829/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_035fd684-3908-460f-9f61-0b401368a829/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_035fd684-3908-460f-9f61-0b401368a829/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_035fd684-3908-460f-9f61-0b401368a829/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label18.c -s /tmp/vcloud-vcloud-master/worker/run_dir_035fd684-3908-460f-9f61-0b401368a829/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_035fd684-3908-460f-9f61-0b401368a829/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 ed29b44a6f9564cbed38c70bbb18181a8a1a6c41 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:23:54,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:23:54,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:23:54,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:23:54,366 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:23:54,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:23:54,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:23:54,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:23:54,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:23:54,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:23:54,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:23:54,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:23:54,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:23:54,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:23:54,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:23:54,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:23:54,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:23:54,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:23:54,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:23:54,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:23:54,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:23:54,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:23:54,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:23:54,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:23:54,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:23:54,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:23:54,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:23:54,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:23:54,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:23:54,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:23:54,413 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:23:54,414 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:23:54,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:23:54,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:23:54,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:23:54,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:23:54,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:23:54,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:23:54,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:23:54,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:23:54,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:23:54,420 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_035fd684-3908-460f-9f61-0b401368a829/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:23:54,444 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:23:54,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:23:54,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:23:54,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:23:54,450 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:23:54,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:23:54,451 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:23:54,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:23:54,451 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:23:54,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:23:54,451 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:23:54,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:23:54,452 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:23:54,452 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:23:54,452 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:23:54,452 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:23:54,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:23:54,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:23:54,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:23:54,453 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:23:54,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:23:54,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:23:54,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:23:54,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:23:54,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:23:54,455 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:23:54,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:23:54,455 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:23:54,455 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_035fd684-3908-460f-9f61-0b401368a829/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 -> ed29b44a6f9564cbed38c70bbb18181a8a1a6c41 [2019-11-15 20:23:54,480 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:23:54,490 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:23:54,492 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:23:54,493 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:23:54,494 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:23:54,494 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_035fd684-3908-460f-9f61-0b401368a829/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem10_label18.c [2019-11-15 20:23:54,539 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_035fd684-3908-460f-9f61-0b401368a829/bin/uautomizer/data/904a34772/c8f44f0f07ef4124bcb36e7c85248a45/FLAG961ff9bfb [2019-11-15 20:23:55,041 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:23:55,042 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_035fd684-3908-460f-9f61-0b401368a829/sv-benchmarks/c/eca-rers2012/Problem10_label18.c [2019-11-15 20:23:55,052 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_035fd684-3908-460f-9f61-0b401368a829/bin/uautomizer/data/904a34772/c8f44f0f07ef4124bcb36e7c85248a45/FLAG961ff9bfb [2019-11-15 20:23:55,268 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_035fd684-3908-460f-9f61-0b401368a829/bin/uautomizer/data/904a34772/c8f44f0f07ef4124bcb36e7c85248a45 [2019-11-15 20:23:55,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:23:55,272 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:23:55,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:23:55,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:23:55,275 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:23:55,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:23:55" (1/1) ... [2019-11-15 20:23:55,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f8ce32a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55, skipping insertion in model container [2019-11-15 20:23:55,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:23:55" (1/1) ... [2019-11-15 20:23:55,283 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:23:55,325 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:23:55,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:23:55,702 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:23:55,855 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:23:55,869 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:23:55,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55 WrapperNode [2019-11-15 20:23:55,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:23:55,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:23:55,871 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:23:55,871 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:23:55,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55" (1/1) ... [2019-11-15 20:23:55,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55" (1/1) ... [2019-11-15 20:23:55,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:23:55,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:23:55,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:23:55,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:23:55,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55" (1/1) ... [2019-11-15 20:23:55,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55" (1/1) ... [2019-11-15 20:23:56,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55" (1/1) ... [2019-11-15 20:23:56,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55" (1/1) ... [2019-11-15 20:23:56,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55" (1/1) ... [2019-11-15 20:23:56,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55" (1/1) ... [2019-11-15 20:23:56,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55" (1/1) ... [2019-11-15 20:23:56,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:23:56,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:23:56,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:23:56,069 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:23:56,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_035fd684-3908-460f-9f61-0b401368a829/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:23:56,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:23:56,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:23:57,530 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:23:57,530 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:23:57,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:23:57 BoogieIcfgContainer [2019-11-15 20:23:57,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:23:57,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:23:57,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:23:57,535 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:23:57,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:23:55" (1/3) ... [2019-11-15 20:23:57,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eef40dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:23:57, skipping insertion in model container [2019-11-15 20:23:57,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55" (2/3) ... [2019-11-15 20:23:57,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eef40dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:23:57, skipping insertion in model container [2019-11-15 20:23:57,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:23:57" (3/3) ... [2019-11-15 20:23:57,541 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label18.c [2019-11-15 20:23:57,549 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:23:57,559 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:23:57,569 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:23:57,606 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:23:57,606 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:23:57,606 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:23:57,607 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:23:57,607 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:23:57,607 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:23:57,607 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:23:57,608 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:23:57,631 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-11-15 20:23:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 20:23:57,642 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:57,643 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:23:57,644 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:57,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:57,650 INFO L82 PathProgramCache]: Analyzing trace with hash -2074400678, now seen corresponding path program 1 times [2019-11-15 20:23:57,657 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:57,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263643380] [2019-11-15 20:23:57,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:57,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:57,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:23:58,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263643380] [2019-11-15 20:23:58,021 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:58,021 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:23:58,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055332287] [2019-11-15 20:23:58,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:23:58,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:58,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:23:58,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:23:58,041 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 4 states. [2019-11-15 20:23:59,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:59,503 INFO L93 Difference]: Finished difference Result 694 states and 1246 transitions. [2019-11-15 20:23:59,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:23:59,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-15 20:23:59,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:59,527 INFO L225 Difference]: With dead ends: 694 [2019-11-15 20:23:59,527 INFO L226 Difference]: Without dead ends: 421 [2019-11-15 20:23:59,534 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:23:59,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-15 20:23:59,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 282. [2019-11-15 20:23:59,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-15 20:23:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2019-11-15 20:23:59,605 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 58 [2019-11-15 20:23:59,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:23:59,606 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2019-11-15 20:23:59,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:23:59,607 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2019-11-15 20:23:59,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-15 20:23:59,616 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:59,616 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:23:59,617 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:59,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:59,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1489536592, now seen corresponding path program 1 times [2019-11-15 20:23:59,617 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:59,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353892124] [2019-11-15 20:23:59,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:59,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:59,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:24:00,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353892124] [2019-11-15 20:24:00,210 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:00,210 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:24:00,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846494965] [2019-11-15 20:24:00,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:24:00,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:00,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:24:00,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:24:00,214 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand 8 states. [2019-11-15 20:24:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:01,533 INFO L93 Difference]: Finished difference Result 715 states and 1090 transitions. [2019-11-15 20:24:01,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:24:01,534 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 173 [2019-11-15 20:24:01,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:01,538 INFO L225 Difference]: With dead ends: 715 [2019-11-15 20:24:01,538 INFO L226 Difference]: Without dead ends: 435 [2019-11-15 20:24:01,539 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:24:01,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-15 20:24:01,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 421. [2019-11-15 20:24:01,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-15 20:24:01,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 576 transitions. [2019-11-15 20:24:01,565 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 576 transitions. Word has length 173 [2019-11-15 20:24:01,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:01,566 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 576 transitions. [2019-11-15 20:24:01,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:24:01,566 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 576 transitions. [2019-11-15 20:24:01,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-15 20:24:01,575 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:01,575 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:24:01,575 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:01,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:01,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1006637764, now seen corresponding path program 1 times [2019-11-15 20:24:01,576 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:01,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068770940] [2019-11-15 20:24:01,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:01,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:01,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-15 20:24:01,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068770940] [2019-11-15 20:24:01,931 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:01,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:01,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641059421] [2019-11-15 20:24:01,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:01,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:01,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:01,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:01,933 INFO L87 Difference]: Start difference. First operand 421 states and 576 transitions. Second operand 4 states. [2019-11-15 20:24:02,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:02,801 INFO L93 Difference]: Finished difference Result 1257 states and 1864 transitions. [2019-11-15 20:24:02,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:02,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-11-15 20:24:02,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:02,808 INFO L225 Difference]: With dead ends: 1257 [2019-11-15 20:24:02,808 INFO L226 Difference]: Without dead ends: 977 [2019-11-15 20:24:02,809 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:02,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-11-15 20:24:02,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 699. [2019-11-15 20:24:02,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2019-11-15 20:24:02,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 934 transitions. [2019-11-15 20:24:02,839 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 934 transitions. Word has length 239 [2019-11-15 20:24:02,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:02,839 INFO L462 AbstractCegarLoop]: Abstraction has 699 states and 934 transitions. [2019-11-15 20:24:02,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:02,840 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 934 transitions. [2019-11-15 20:24:02,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-11-15 20:24:02,846 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:02,847 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:24:02,847 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:02,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:02,847 INFO L82 PathProgramCache]: Analyzing trace with hash 6793205, now seen corresponding path program 1 times [2019-11-15 20:24:02,848 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:02,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365331995] [2019-11-15 20:24:02,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:02,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:02,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-15 20:24:03,008 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365331995] [2019-11-15 20:24:03,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:03,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:24:03,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177050344] [2019-11-15 20:24:03,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:03,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:03,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:03,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:03,011 INFO L87 Difference]: Start difference. First operand 699 states and 934 transitions. Second operand 4 states. [2019-11-15 20:24:03,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:03,863 INFO L93 Difference]: Finished difference Result 1813 states and 2498 transitions. [2019-11-15 20:24:03,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:03,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2019-11-15 20:24:03,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:03,871 INFO L225 Difference]: With dead ends: 1813 [2019-11-15 20:24:03,871 INFO L226 Difference]: Without dead ends: 1255 [2019-11-15 20:24:03,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:03,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2019-11-15 20:24:03,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 838. [2019-11-15 20:24:03,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-15 20:24:03,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1063 transitions. [2019-11-15 20:24:03,903 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1063 transitions. Word has length 245 [2019-11-15 20:24:03,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:03,905 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1063 transitions. [2019-11-15 20:24:03,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:03,905 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1063 transitions. [2019-11-15 20:24:03,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-11-15 20:24:03,919 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:03,919 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:24:03,920 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:03,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:03,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1710958450, now seen corresponding path program 1 times [2019-11-15 20:24:03,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:03,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765560456] [2019-11-15 20:24:03,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:03,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:03,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:04,128 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-15 20:24:04,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765560456] [2019-11-15 20:24:04,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:04,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:24:04,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385522525] [2019-11-15 20:24:04,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:24:04,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:04,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:24:04,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:24:04,131 INFO L87 Difference]: Start difference. First operand 838 states and 1063 transitions. Second operand 3 states. [2019-11-15 20:24:04,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:04,639 INFO L93 Difference]: Finished difference Result 1674 states and 2159 transitions. [2019-11-15 20:24:04,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:24:04,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-11-15 20:24:04,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:04,644 INFO L225 Difference]: With dead ends: 1674 [2019-11-15 20:24:04,645 INFO L226 Difference]: Without dead ends: 977 [2019-11-15 20:24:04,646 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:24:04,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-11-15 20:24:04,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2019-11-15 20:24:04,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-11-15 20:24:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1212 transitions. [2019-11-15 20:24:04,671 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1212 transitions. Word has length 313 [2019-11-15 20:24:04,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:04,671 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1212 transitions. [2019-11-15 20:24:04,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:24:04,672 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1212 transitions. [2019-11-15 20:24:04,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-11-15 20:24:04,677 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:04,677 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:24:04,677 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:04,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:04,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1321369600, now seen corresponding path program 1 times [2019-11-15 20:24:04,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:04,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290396899] [2019-11-15 20:24:04,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:04,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:04,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-15 20:24:04,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290396899] [2019-11-15 20:24:04,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:04,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:24:04,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678247262] [2019-11-15 20:24:04,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:24:04,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:04,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:24:04,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:24:04,863 INFO L87 Difference]: Start difference. First operand 977 states and 1212 transitions. Second operand 5 states. [2019-11-15 20:24:06,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:06,135 INFO L93 Difference]: Finished difference Result 2647 states and 3277 transitions. [2019-11-15 20:24:06,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:24:06,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 322 [2019-11-15 20:24:06,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:06,140 INFO L225 Difference]: With dead ends: 2647 [2019-11-15 20:24:06,141 INFO L226 Difference]: Without dead ends: 977 [2019-11-15 20:24:06,142 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 20:24:06,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-11-15 20:24:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2019-11-15 20:24:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-11-15 20:24:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1096 transitions. [2019-11-15 20:24:06,164 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1096 transitions. Word has length 322 [2019-11-15 20:24:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:06,165 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1096 transitions. [2019-11-15 20:24:06,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:24:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1096 transitions. [2019-11-15 20:24:06,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-11-15 20:24:06,171 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:06,172 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:24:06,172 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:06,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:06,172 INFO L82 PathProgramCache]: Analyzing trace with hash -2054357862, now seen corresponding path program 1 times [2019-11-15 20:24:06,173 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:06,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373527410] [2019-11-15 20:24:06,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:06,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:06,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:06,588 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 367 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:24:06,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373527410] [2019-11-15 20:24:06,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156866734] [2019-11-15 20:24:06,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_035fd684-3908-460f-9f61-0b401368a829/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-15 20:24:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:06,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:24:06,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:24:06,917 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-15 20:24:06,917 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:24:06,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-15 20:24:06,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103338758] [2019-11-15 20:24:06,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:24:06,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:06,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:24:06,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:24:06,922 INFO L87 Difference]: Start difference. First operand 977 states and 1096 transitions. Second operand 3 states. [2019-11-15 20:24:07,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:07,476 INFO L93 Difference]: Finished difference Result 2508 states and 2857 transitions. [2019-11-15 20:24:07,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:24:07,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 358 [2019-11-15 20:24:07,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:07,485 INFO L225 Difference]: With dead ends: 2508 [2019-11-15 20:24:07,485 INFO L226 Difference]: Without dead ends: 1672 [2019-11-15 20:24:07,487 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:24:07,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2019-11-15 20:24:07,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1672. [2019-11-15 20:24:07,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-11-15 20:24:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1850 transitions. [2019-11-15 20:24:07,527 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1850 transitions. Word has length 358 [2019-11-15 20:24:07,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:07,528 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 1850 transitions. [2019-11-15 20:24:07,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:24:07,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1850 transitions. [2019-11-15 20:24:07,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-11-15 20:24:07,536 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:07,537 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:24:07,749 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:24:07,749 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:07,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:07,750 INFO L82 PathProgramCache]: Analyzing trace with hash 396556598, now seen corresponding path program 1 times [2019-11-15 20:24:07,750 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:07,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477282546] [2019-11-15 20:24:07,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:07,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:07,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:08,012 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-11-15 20:24:08,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477282546] [2019-11-15 20:24:08,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:08,013 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:08,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078503414] [2019-11-15 20:24:08,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:08,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:08,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:08,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:08,015 INFO L87 Difference]: Start difference. First operand 1672 states and 1850 transitions. Second operand 4 states. [2019-11-15 20:24:09,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:09,010 INFO L93 Difference]: Finished difference Result 3896 states and 4395 transitions. [2019-11-15 20:24:09,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:09,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 371 [2019-11-15 20:24:09,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:09,011 INFO L225 Difference]: With dead ends: 3896 [2019-11-15 20:24:09,012 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:24:09,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:09,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:24:09,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:24:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:24:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:24:09,016 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 371 [2019-11-15 20:24:09,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:09,016 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:24:09,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:09,016 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:24:09,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:24:09,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:24:09,218 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 19 [2019-11-15 20:24:09,326 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 19 [2019-11-15 20:24:09,329 INFO L443 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2019-11-15 20:24:09,329 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,329 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,329 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,329 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,329 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,330 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,330 INFO L443 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2019-11-15 20:24:09,330 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2019-11-15 20:24:09,330 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-15 20:24:09,330 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-15 20:24:09,330 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-15 20:24:09,330 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-15 20:24:09,330 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-15 20:24:09,330 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-15 20:24:09,330 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2019-11-15 20:24:09,330 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2019-11-15 20:24:09,331 INFO L443 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2019-11-15 20:24:09,331 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,331 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,331 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,331 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,331 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,331 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2019-11-15 20:24:09,331 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2019-11-15 20:24:09,331 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2019-11-15 20:24:09,331 INFO L443 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2019-11-15 20:24:09,331 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-15 20:24:09,331 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-15 20:24:09,332 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-15 20:24:09,332 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-15 20:24:09,332 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-15 20:24:09,332 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2019-11-15 20:24:09,332 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2019-11-15 20:24:09,332 INFO L443 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2019-11-15 20:24:09,332 INFO L443 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2019-11-15 20:24:09,332 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2019-11-15 20:24:09,332 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,332 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,332 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,332 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,333 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,333 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2019-11-15 20:24:09,333 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-15 20:24:09,333 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-15 20:24:09,333 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-15 20:24:09,333 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-15 20:24:09,333 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-15 20:24:09,333 INFO L439 ceAbstractionStarter]: At program point L573(lines 20 574) the Hoare annotation is: (let ((.cse0 (not (= 10 ~a19~0)))) (or (and (not (= ~a19~0 6)) .cse0) (and (<= (+ ~a1~0 333899) 0) .cse0) (not (= ~a10~0 4)))) [2019-11-15 20:24:09,334 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2019-11-15 20:24:09,334 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2019-11-15 20:24:09,334 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2019-11-15 20:24:09,334 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2019-11-15 20:24:09,334 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,334 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,334 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,334 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,334 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,334 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2019-11-15 20:24:09,334 INFO L443 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2019-11-15 20:24:09,335 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2019-11-15 20:24:09,335 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-15 20:24:09,335 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-15 20:24:09,335 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-15 20:24:09,335 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-15 20:24:09,335 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-15 20:24:09,335 INFO L443 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2019-11-15 20:24:09,339 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2019-11-15 20:24:09,339 INFO L446 ceAbstractionStarter]: At program point L576(lines 576 592) the Hoare annotation is: true [2019-11-15 20:24:09,339 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2019-11-15 20:24:09,339 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2019-11-15 20:24:09,339 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2019-11-15 20:24:09,340 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,340 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,340 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,340 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,340 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,340 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-15 20:24:09,340 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-15 20:24:09,341 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-15 20:24:09,341 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-15 20:24:09,341 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-15 20:24:09,341 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2019-11-15 20:24:09,341 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2019-11-15 20:24:09,341 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2019-11-15 20:24:09,341 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2019-11-15 20:24:09,342 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,342 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,342 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,342 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,342 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,342 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2019-11-15 20:24:09,342 INFO L443 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2019-11-15 20:24:09,342 INFO L443 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2019-11-15 20:24:09,343 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2019-11-15 20:24:09,343 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-15 20:24:09,343 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-15 20:24:09,343 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-15 20:24:09,343 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-15 20:24:09,343 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-15 20:24:09,343 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2019-11-15 20:24:09,344 INFO L443 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2019-11-15 20:24:09,344 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:24:09,344 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2019-11-15 20:24:09,344 INFO L439 ceAbstractionStarter]: At program point L582-2(lines 582 591) the Hoare annotation is: (let ((.cse0 (not (= 10 ~a19~0)))) (or (and (not (= ~a19~0 6)) .cse0) (and (<= (+ ~a1~0 333899) 0) .cse0) (not (= ~a10~0 4)))) [2019-11-15 20:24:09,344 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2019-11-15 20:24:09,344 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,345 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,345 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,345 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,345 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-15 20:24:09,345 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,345 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,345 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 178) no Hoare annotation was computed. [2019-11-15 20:24:09,346 INFO L443 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2019-11-15 20:24:09,346 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2019-11-15 20:24:09,346 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2019-11-15 20:24:09,346 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-15 20:24:09,346 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-15 20:24:09,346 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-15 20:24:09,346 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-15 20:24:09,347 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-15 20:24:09,347 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-15 20:24:09,347 INFO L443 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2019-11-15 20:24:09,347 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2019-11-15 20:24:09,347 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2019-11-15 20:24:09,347 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2019-11-15 20:24:09,348 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,353 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,353 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,353 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,353 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,353 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,353 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2019-11-15 20:24:09,353 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2019-11-15 20:24:09,354 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2019-11-15 20:24:09,354 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:24:09,354 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-15 20:24:09,354 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-15 20:24:09,354 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-15 20:24:09,357 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-15 20:24:09,357 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-15 20:24:09,357 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-15 20:24:09,358 INFO L443 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2019-11-15 20:24:09,358 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2019-11-15 20:24:09,358 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2019-11-15 20:24:09,358 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2019-11-15 20:24:09,358 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2019-11-15 20:24:09,358 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2019-11-15 20:24:09,358 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,359 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,359 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,359 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,359 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,359 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,359 INFO L443 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2019-11-15 20:24:09,359 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-15 20:24:09,360 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-15 20:24:09,361 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-15 20:24:09,361 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-15 20:24:09,361 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-15 20:24:09,361 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:24:09,361 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-15 20:24:09,362 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2019-11-15 20:24:09,362 INFO L443 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2019-11-15 20:24:09,362 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2019-11-15 20:24:09,362 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2019-11-15 20:24:09,362 INFO L443 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2019-11-15 20:24:09,362 INFO L443 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2019-11-15 20:24:09,362 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,363 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,363 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,365 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,365 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,365 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,365 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2019-11-15 20:24:09,365 INFO L443 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2019-11-15 20:24:09,365 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2019-11-15 20:24:09,366 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-15 20:24:09,366 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-15 20:24:09,366 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-15 20:24:09,366 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-15 20:24:09,366 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-15 20:24:09,366 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-15 20:24:09,367 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2019-11-15 20:24:09,367 INFO L443 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2019-11-15 20:24:09,367 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 20:24:09,367 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2019-11-15 20:24:09,367 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,367 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,367 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,368 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,368 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,368 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2019-11-15 20:24:09,368 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2019-11-15 20:24:09,368 INFO L443 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2019-11-15 20:24:09,368 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2019-11-15 20:24:09,368 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-15 20:24:09,369 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-15 20:24:09,369 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-15 20:24:09,369 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 20:24:09,369 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-15 20:24:09,369 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-15 20:24:09,369 INFO L443 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2019-11-15 20:24:09,369 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2019-11-15 20:24:09,369 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2019-11-15 20:24:09,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:24:09 BoogieIcfgContainer [2019-11-15 20:24:09,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:24:09,386 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:24:09,386 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:24:09,386 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:24:09,387 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:23:57" (3/4) ... [2019-11-15 20:24:09,390 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 20:24:09,417 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 20:24:09,419 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 20:24:09,585 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_035fd684-3908-460f-9f61-0b401368a829/bin/uautomizer/witness.graphml [2019-11-15 20:24:09,585 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:24:09,586 INFO L168 Benchmark]: Toolchain (without parser) took 14314.86 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 420.0 MB). Free memory was 939.3 MB in the beginning and 835.3 MB in the end (delta: 104.0 MB). Peak memory consumption was 524.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:24:09,587 INFO L168 Benchmark]: CDTParser took 0.17 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-15 20:24:09,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 597.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -149.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:24:09,588 INFO L168 Benchmark]: Boogie Procedure Inliner took 115.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:24:09,588 INFO L168 Benchmark]: Boogie Preprocessor took 82.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:24:09,588 INFO L168 Benchmark]: RCFGBuilder took 1462.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 970.0 MB in the end (delta: 103.4 MB). Peak memory consumption was 103.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:24:09,589 INFO L168 Benchmark]: TraceAbstraction took 11853.50 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 293.1 MB). Free memory was 970.0 MB in the beginning and 851.6 MB in the end (delta: 118.4 MB). Peak memory consumption was 411.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:24:09,589 INFO L168 Benchmark]: Witness Printer took 199.13 ms. Allocated memory is still 1.4 GB. Free memory was 851.6 MB in the beginning and 835.3 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:24:09,591 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.17 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 597.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -149.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 115.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1462.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 970.0 MB in the end (delta: 103.4 MB). Peak memory consumption was 103.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11853.50 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 293.1 MB). Free memory was 970.0 MB in the beginning and 851.6 MB in the end (delta: 118.4 MB). Peak memory consumption was 411.4 MB. Max. memory is 11.5 GB. * Witness Printer took 199.13 ms. Allocated memory is still 1.4 GB. Free memory was 851.6 MB in the beginning and 835.3 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 178]: 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: 582]: Loop Invariant Derived loop invariant: ((!(a19 == 6) && !(10 == a19)) || (a1 + 333899 <= 0 && !(10 == a19))) || !(a10 == 4) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((!(a19 == 6) && !(10 == a19)) || (a1 + 333899 <= 0 && !(10 == a19))) || !(a10 == 4) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Result: SAFE, OverallTime: 11.7s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 787 SDtfs, 1781 SDslu, 105 SDs, 0 SdLazy, 5769 SolverSat, 1057 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 399 GetRequests, 369 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1672occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 848 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 52 NumberOfFragments, 49 HoareAnnotationTreeSize, 3 FomulaSimplifications, 6244 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 590 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2437 NumberOfCodeBlocks, 2437 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 2428 ConstructedInterpolants, 0 QuantifiedInterpolants, 2338396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 474 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 2365/2410 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...