./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i --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/working_dir_1a06f5b8-41a9-4226-b86e-1800cf1e8be0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1a06f5b8-41a9-4226-b86e-1800cf1e8be0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1a06f5b8-41a9-4226-b86e-1800cf1e8be0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1a06f5b8-41a9-4226-b86e-1800cf1e8be0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1a06f5b8-41a9-4226-b86e-1800cf1e8be0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1a06f5b8-41a9-4226-b86e-1800cf1e8be0/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 3607a70e53f56c4b4860f9fca9676a925474c3df .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:55:06,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:55:06,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:55:06,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:55:06,994 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:55:06,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:55:06,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:55:06,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:55:06,999 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:55:07,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:55:07,000 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:55:07,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:55:07,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:55:07,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:55:07,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:55:07,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:55:07,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:55:07,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:55:07,007 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:55:07,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:55:07,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:55:07,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:55:07,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:55:07,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:55:07,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:55:07,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:55:07,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:55:07,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:55:07,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:55:07,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:55:07,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:55:07,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:55:07,019 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:55:07,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:55:07,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:55:07,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:55:07,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:55:07,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:55:07,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:55:07,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:55:07,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:55:07,023 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1a06f5b8-41a9-4226-b86e-1800cf1e8be0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:55:07,034 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:55:07,035 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:55:07,036 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:55:07,036 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:55:07,036 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:55:07,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:55:07,037 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:55:07,037 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:55:07,037 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:55:07,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:55:07,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:55:07,038 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:55:07,038 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:55:07,038 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:55:07,038 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:55:07,038 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:55:07,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:55:07,039 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:55:07,039 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:55:07,039 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:55:07,039 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:55:07,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:55:07,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:55:07,040 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:55:07,040 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:55:07,040 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:55:07,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:55:07,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:55:07,040 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/working_dir_1a06f5b8-41a9-4226-b86e-1800cf1e8be0/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 -> 3607a70e53f56c4b4860f9fca9676a925474c3df [2019-10-22 08:55:07,064 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:55:07,074 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:55:07,077 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:55:07,078 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:55:07,079 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:55:07,079 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1a06f5b8-41a9-4226-b86e-1800cf1e8be0/bin/uautomizer/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2019-10-22 08:55:07,130 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1a06f5b8-41a9-4226-b86e-1800cf1e8be0/bin/uautomizer/data/acc261933/0a51020d35bb4bda95c9ffe8a785150c/FLAGf2512a9fd [2019-10-22 08:55:07,506 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:55:07,507 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1a06f5b8-41a9-4226-b86e-1800cf1e8be0/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2019-10-22 08:55:07,513 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1a06f5b8-41a9-4226-b86e-1800cf1e8be0/bin/uautomizer/data/acc261933/0a51020d35bb4bda95c9ffe8a785150c/FLAGf2512a9fd [2019-10-22 08:55:07,524 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1a06f5b8-41a9-4226-b86e-1800cf1e8be0/bin/uautomizer/data/acc261933/0a51020d35bb4bda95c9ffe8a785150c [2019-10-22 08:55:07,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:55:07,528 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:55:07,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:07,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:55:07,533 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:55:07,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:07" (1/1) ... [2019-10-22 08:55:07,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c23e08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:07, skipping insertion in model container [2019-10-22 08:55:07,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:07" (1/1) ... [2019-10-22 08:55:07,548 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:55:07,568 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:55:07,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:07,703 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:55:07,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:07,799 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:55:07,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:07 WrapperNode [2019-10-22 08:55:07,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:07,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:07,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:55:07,801 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:55:07,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:07" (1/1) ... [2019-10-22 08:55:07,812 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:07" (1/1) ... [2019-10-22 08:55:07,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:07,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:55:07,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:55:07,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:55:07,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:07" (1/1) ... [2019-10-22 08:55:07,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:07" (1/1) ... [2019-10-22 08:55:07,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:07" (1/1) ... [2019-10-22 08:55:07,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:07" (1/1) ... [2019-10-22 08:55:07,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:07" (1/1) ... [2019-10-22 08:55:07,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:07" (1/1) ... [2019-10-22 08:55:07,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:07" (1/1) ... [2019-10-22 08:55:07,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:55:07,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:55:07,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:55:07,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:55:07,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1a06f5b8-41a9-4226-b86e-1800cf1e8be0/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-10-22 08:55:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:55:07,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:55:08,317 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:55:08,317 INFO L284 CfgBuilder]: Removed 42 assume(true) statements. [2019-10-22 08:55:08,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:08 BoogieIcfgContainer [2019-10-22 08:55:08,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:55:08,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:55:08,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:55:08,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:55:08,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:55:07" (1/3) ... [2019-10-22 08:55:08,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7510432d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:55:08, skipping insertion in model container [2019-10-22 08:55:08,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:07" (2/3) ... [2019-10-22 08:55:08,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7510432d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:55:08, skipping insertion in model container [2019-10-22 08:55:08,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:08" (3/3) ... [2019-10-22 08:55:08,330 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2019-10-22 08:55:08,342 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:55:08,351 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-10-22 08:55:08,363 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-10-22 08:55:08,389 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:55:08,390 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:55:08,390 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:55:08,390 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:55:08,390 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:55:08,390 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:55:08,391 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:55:08,391 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:55:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2019-10-22 08:55:08,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 08:55:08,419 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:08,420 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:08,422 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:08,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:08,427 INFO L82 PathProgramCache]: Analyzing trace with hash -374051301, now seen corresponding path program 1 times [2019-10-22 08:55:08,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:08,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095060224] [2019-10-22 08:55:08,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:08,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095060224] [2019-10-22 08:55:08,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:08,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:08,561 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888469550] [2019-10-22 08:55:08,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:08,565 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:08,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:08,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:08,576 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 3 states. [2019-10-22 08:55:08,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:08,701 INFO L93 Difference]: Finished difference Result 171 states and 230 transitions. [2019-10-22 08:55:08,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:08,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-22 08:55:08,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:08,713 INFO L225 Difference]: With dead ends: 171 [2019-10-22 08:55:08,713 INFO L226 Difference]: Without dead ends: 83 [2019-10-22 08:55:08,716 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:08,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-22 08:55:08,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-10-22 08:55:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-22 08:55:08,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2019-10-22 08:55:08,798 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 10 [2019-10-22 08:55:08,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:08,799 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2019-10-22 08:55:08,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:08,799 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2019-10-22 08:55:08,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 08:55:08,809 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:08,809 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:08,810 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:08,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:08,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1314109022, now seen corresponding path program 1 times [2019-10-22 08:55:08,811 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:08,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53617632] [2019-10-22 08:55:08,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:08,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:08,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53617632] [2019-10-22 08:55:08,878 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:08,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:08,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315729476] [2019-10-22 08:55:08,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:55:08,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:08,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:08,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:08,881 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 5 states. [2019-10-22 08:55:09,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:09,076 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2019-10-22 08:55:09,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:55:09,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-22 08:55:09,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:09,078 INFO L225 Difference]: With dead ends: 83 [2019-10-22 08:55:09,078 INFO L226 Difference]: Without dead ends: 67 [2019-10-22 08:55:09,079 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:55:09,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-22 08:55:09,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-10-22 08:55:09,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-22 08:55:09,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-10-22 08:55:09,094 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 12 [2019-10-22 08:55:09,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:09,095 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-10-22 08:55:09,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:55:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-10-22 08:55:09,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 08:55:09,095 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:09,096 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:09,096 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:09,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:09,096 INFO L82 PathProgramCache]: Analyzing trace with hash -168637, now seen corresponding path program 1 times [2019-10-22 08:55:09,098 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:09,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652566597] [2019-10-22 08:55:09,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:09,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652566597] [2019-10-22 08:55:09,159 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:09,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:09,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922108699] [2019-10-22 08:55:09,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:09,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:09,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:09,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:09,160 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 4 states. [2019-10-22 08:55:09,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:09,323 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2019-10-22 08:55:09,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:55:09,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-22 08:55:09,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:09,324 INFO L225 Difference]: With dead ends: 88 [2019-10-22 08:55:09,324 INFO L226 Difference]: Without dead ends: 80 [2019-10-22 08:55:09,325 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:09,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-22 08:55:09,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2019-10-22 08:55:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-22 08:55:09,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2019-10-22 08:55:09,334 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 15 [2019-10-22 08:55:09,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:09,334 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2019-10-22 08:55:09,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:09,335 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2019-10-22 08:55:09,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 08:55:09,335 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:09,336 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:09,336 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:09,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:09,336 INFO L82 PathProgramCache]: Analyzing trace with hash -749433183, now seen corresponding path program 1 times [2019-10-22 08:55:09,337 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:09,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882564474] [2019-10-22 08:55:09,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:09,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:55:09,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882564474] [2019-10-22 08:55:09,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790984662] [2019-10-22 08:55:09,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1a06f5b8-41a9-4226-b86e-1800cf1e8be0/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-10-22 08:55:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:09,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-22 08:55:09,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:09,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:55:09,527 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:09,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2019-10-22 08:55:09,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157615347] [2019-10-22 08:55:09,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:55:09,528 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:09,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:55:09,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:55:09,533 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 7 states. [2019-10-22 08:55:09,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:09,731 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2019-10-22 08:55:09,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:55:09,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-10-22 08:55:09,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:09,733 INFO L225 Difference]: With dead ends: 80 [2019-10-22 08:55:09,733 INFO L226 Difference]: Without dead ends: 68 [2019-10-22 08:55:09,734 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:55:09,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-22 08:55:09,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 53. [2019-10-22 08:55:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-22 08:55:09,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-10-22 08:55:09,754 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 26 [2019-10-22 08:55:09,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:09,754 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-10-22 08:55:09,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:55:09,754 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-10-22 08:55:09,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-22 08:55:09,755 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:09,755 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] [2019-10-22 08:55:09,956 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:09,957 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:09,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:09,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1520484215, now seen corresponding path program 1 times [2019-10-22 08:55:09,957 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:09,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600539291] [2019-10-22 08:55:09,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:10,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-10-22 08:55:10,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600539291] [2019-10-22 08:55:10,021 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:10,021 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:10,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025522513] [2019-10-22 08:55:10,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:10,022 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:10,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:10,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:10,023 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 3 states. [2019-10-22 08:55:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:10,069 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2019-10-22 08:55:10,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:10,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-22 08:55:10,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:10,071 INFO L225 Difference]: With dead ends: 84 [2019-10-22 08:55:10,071 INFO L226 Difference]: Without dead ends: 53 [2019-10-22 08:55:10,071 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-22 08:55:10,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-10-22 08:55:10,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-22 08:55:10,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-10-22 08:55:10,078 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 38 [2019-10-22 08:55:10,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:10,078 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-10-22 08:55:10,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:10,079 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-10-22 08:55:10,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 08:55:10,079 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:10,080 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] [2019-10-22 08:55:10,080 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:10,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:10,084 INFO L82 PathProgramCache]: Analyzing trace with hash 550411780, now seen corresponding path program 1 times [2019-10-22 08:55:10,084 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:10,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106726065] [2019-10-22 08:55:10,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:10,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:10,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:10,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:10,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106726065] [2019-10-22 08:55:10,210 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:10,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:10,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810273716] [2019-10-22 08:55:10,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:55:10,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:10,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:10,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:10,214 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 5 states. [2019-10-22 08:55:10,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:10,315 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-10-22 08:55:10,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:55:10,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-10-22 08:55:10,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:10,317 INFO L225 Difference]: With dead ends: 64 [2019-10-22 08:55:10,317 INFO L226 Difference]: Without dead ends: 62 [2019-10-22 08:55:10,317 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:55:10,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-22 08:55:10,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-10-22 08:55:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 08:55:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2019-10-22 08:55:10,334 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 39 [2019-10-22 08:55:10,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:10,335 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2019-10-22 08:55:10,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:55:10,335 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2019-10-22 08:55:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-22 08:55:10,336 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:10,336 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] [2019-10-22 08:55:10,337 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:10,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:10,337 INFO L82 PathProgramCache]: Analyzing trace with hash 664905863, now seen corresponding path program 1 times [2019-10-22 08:55:10,337 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:10,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447707520] [2019-10-22 08:55:10,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:10,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:10,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:10,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:10,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447707520] [2019-10-22 08:55:10,435 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:10,435 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:10,435 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544721466] [2019-10-22 08:55:10,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:55:10,436 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:10,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:10,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:10,436 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 5 states. [2019-10-22 08:55:10,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:10,531 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-10-22 08:55:10,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:55:10,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-22 08:55:10,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:10,532 INFO L225 Difference]: With dead ends: 61 [2019-10-22 08:55:10,532 INFO L226 Difference]: Without dead ends: 59 [2019-10-22 08:55:10,533 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:55:10,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-22 08:55:10,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-10-22 08:55:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-22 08:55:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-10-22 08:55:10,547 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 41 [2019-10-22 08:55:10,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:10,547 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2019-10-22 08:55:10,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:55:10,547 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2019-10-22 08:55:10,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 08:55:10,549 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:10,549 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:10,549 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:10,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:10,550 INFO L82 PathProgramCache]: Analyzing trace with hash -743371514, now seen corresponding path program 1 times [2019-10-22 08:55:10,550 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:10,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066537141] [2019-10-22 08:55:10,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:10,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:10,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:10,653 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:10,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066537141] [2019-10-22 08:55:10,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143979172] [2019-10-22 08:55:10,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1a06f5b8-41a9-4226-b86e-1800cf1e8be0/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:10,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:55:10,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:10,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:10,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:55:10,723 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:55:10,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2019-10-22 08:55:10,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713252812] [2019-10-22 08:55:10,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:10,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:10,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:10,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:10,725 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 4 states. [2019-10-22 08:55:10,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:10,793 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-10-22 08:55:10,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:10,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-10-22 08:55:10,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:10,796 INFO L225 Difference]: With dead ends: 62 [2019-10-22 08:55:10,796 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:55:10,797 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:10,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:55:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:55:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:55:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:55:10,798 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2019-10-22 08:55:10,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:10,798 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:10,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:10,798 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:55:10,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:55:10,999 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:11,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:55:11,378 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-10-22 08:55:11,379 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,379 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:55:11,379 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,379 INFO L443 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-10-22 08:55:11,379 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,379 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-22 08:55:11,380 INFO L439 ceAbstractionStarter]: At program point L4-2(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-10-22 08:55:11,380 INFO L443 ceAbstractionStarter]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-10-22 08:55:11,380 INFO L439 ceAbstractionStarter]: At program point L4-5(lines 3 8) the Hoare annotation is: (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-10-22 08:55:11,380 INFO L443 ceAbstractionStarter]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-10-22 08:55:11,380 INFO L439 ceAbstractionStarter]: At program point L4-8(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-10-22 08:55:11,380 INFO L443 ceAbstractionStarter]: For program point L4-9(lines 4 6) no Hoare annotation was computed. [2019-10-22 08:55:11,380 INFO L443 ceAbstractionStarter]: For program point L4-12(lines 4 6) no Hoare annotation was computed. [2019-10-22 08:55:11,380 INFO L439 ceAbstractionStarter]: At program point L4-14(lines 3 8) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-10-22 08:55:11,380 INFO L443 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2019-10-22 08:55:11,380 INFO L443 ceAbstractionStarter]: For program point L4-15(lines 4 6) no Hoare annotation was computed. [2019-10-22 08:55:11,381 INFO L443 ceAbstractionStarter]: For program point L21-1(lines 11 69) no Hoare annotation was computed. [2019-10-22 08:55:11,381 INFO L439 ceAbstractionStarter]: At program point L4-17(lines 3 8) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 1 ULTIMATE.start_main_~cp~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-10-22 08:55:11,381 INFO L443 ceAbstractionStarter]: For program point L4-18(lines 4 6) no Hoare annotation was computed. [2019-10-22 08:55:11,381 INFO L439 ceAbstractionStarter]: At program point L4-20(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-10-22 08:55:11,381 INFO L443 ceAbstractionStarter]: For program point L4-21(lines 4 6) no Hoare annotation was computed. [2019-10-22 08:55:11,381 INFO L439 ceAbstractionStarter]: At program point L4-23(line 41) the Hoare annotation is: (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-10-22 08:55:11,381 INFO L443 ceAbstractionStarter]: For program point L4-24(lines 4 6) no Hoare annotation was computed. [2019-10-22 08:55:11,381 INFO L439 ceAbstractionStarter]: At program point L4-26(lines 3 8) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-10-22 08:55:11,382 INFO L443 ceAbstractionStarter]: For program point L4-27(lines 4 6) no Hoare annotation was computed. [2019-10-22 08:55:11,382 INFO L439 ceAbstractionStarter]: At program point L4-29(line 44) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 1 ULTIMATE.start_main_~cp~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-10-22 08:55:11,382 INFO L443 ceAbstractionStarter]: For program point L4-30(lines 4 6) no Hoare annotation was computed. [2019-10-22 08:55:11,382 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,382 INFO L443 ceAbstractionStarter]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,382 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,382 INFO L439 ceAbstractionStarter]: At program point L4-32(lines 3 8) the Hoare annotation is: (and (= ULTIMATE.start_main_~c~0 0) (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-10-22 08:55:11,382 INFO L443 ceAbstractionStarter]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,382 INFO L443 ceAbstractionStarter]: For program point L4-33(lines 4 6) no Hoare annotation was computed. [2019-10-22 08:55:11,383 INFO L443 ceAbstractionStarter]: For program point L5-3(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,383 INFO L443 ceAbstractionStarter]: For program point L5-4(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,383 INFO L443 ceAbstractionStarter]: For program point L5-5(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,383 INFO L443 ceAbstractionStarter]: For program point L4-36(lines 4 6) no Hoare annotation was computed. [2019-10-22 08:55:11,383 INFO L443 ceAbstractionStarter]: For program point L5-6(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,383 INFO L443 ceAbstractionStarter]: For program point L5-7(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,383 INFO L439 ceAbstractionStarter]: At program point L4-38(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0) (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-10-22 08:55:11,383 INFO L443 ceAbstractionStarter]: For program point L5-8(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,383 INFO L443 ceAbstractionStarter]: For program point L4-39(lines 4 6) no Hoare annotation was computed. [2019-10-22 08:55:11,383 INFO L443 ceAbstractionStarter]: For program point L5-9(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,383 INFO L443 ceAbstractionStarter]: For program point L5-10(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,384 INFO L439 ceAbstractionStarter]: At program point L4-41(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0) (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-10-22 08:55:11,384 INFO L443 ceAbstractionStarter]: For program point L5-11(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,384 INFO L443 ceAbstractionStarter]: For program point L4-42(lines 4 6) no Hoare annotation was computed. [2019-10-22 08:55:11,384 INFO L443 ceAbstractionStarter]: For program point L5-12(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,384 INFO L443 ceAbstractionStarter]: For program point L5-13(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,384 INFO L439 ceAbstractionStarter]: At program point L4-44(lines 3 8) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-10-22 08:55:11,384 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 61) no Hoare annotation was computed. [2019-10-22 08:55:11,384 INFO L443 ceAbstractionStarter]: For program point L5-14(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,384 INFO L443 ceAbstractionStarter]: For program point L4-45(lines 4 6) no Hoare annotation was computed. [2019-10-22 08:55:11,384 INFO L443 ceAbstractionStarter]: For program point L22(lines 11 69) no Hoare annotation was computed. [2019-10-22 08:55:11,384 INFO L443 ceAbstractionStarter]: For program point L5-15(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,389 INFO L439 ceAbstractionStarter]: At program point L55-1(lines 55 61) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-10-22 08:55:11,389 INFO L439 ceAbstractionStarter]: At program point L4-47(lines 3 8) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-10-22 08:55:11,389 INFO L443 ceAbstractionStarter]: For program point L5-16(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,389 INFO L443 ceAbstractionStarter]: For program point L4-48(lines 4 6) no Hoare annotation was computed. [2019-10-22 08:55:11,389 INFO L443 ceAbstractionStarter]: For program point L5-17(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,390 INFO L439 ceAbstractionStarter]: At program point L4-50(lines 3 8) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-10-22 08:55:11,390 INFO L443 ceAbstractionStarter]: For program point L4-51(lines 4 6) no Hoare annotation was computed. [2019-10-22 08:55:11,390 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,390 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,390 INFO L443 ceAbstractionStarter]: For program point L23(lines 11 69) no Hoare annotation was computed. [2019-10-22 08:55:11,390 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,390 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:55:11,390 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,390 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:55:11,391 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,391 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,391 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,391 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 66) no Hoare annotation was computed. [2019-10-22 08:55:11,391 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 65) no Hoare annotation was computed. [2019-10-22 08:55:11,391 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,391 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,391 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,391 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,392 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,392 INFO L439 ceAbstractionStarter]: At program point L33-1(lines 3 38) the Hoare annotation is: (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-10-22 08:55:11,392 INFO L443 ceAbstractionStarter]: For program point L33-2(lines 33 38) no Hoare annotation was computed. [2019-10-22 08:55:11,392 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,392 INFO L446 ceAbstractionStarter]: At program point L67(lines 11 69) the Hoare annotation is: true [2019-10-22 08:55:11,392 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-10-22 08:55:11,392 INFO L443 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2019-10-22 08:55:11,392 INFO L439 ceAbstractionStarter]: At program point L51-1(lines 3 63) the Hoare annotation is: (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-10-22 08:55:11,394 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 08:55:11,394 INFO L446 ceAbstractionStarter]: At program point L68(lines 10 69) the Hoare annotation is: true [2019-10-22 08:55:11,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:55:11 BoogieIcfgContainer [2019-10-22 08:55:11,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:55:11,424 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:55:11,424 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:55:11,424 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:55:11,437 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:08" (3/4) ... [2019-10-22 08:55:11,442 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:55:11,452 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-10-22 08:55:11,452 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 08:55:11,520 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1a06f5b8-41a9-4226-b86e-1800cf1e8be0/bin/uautomizer/witness.graphml [2019-10-22 08:55:11,520 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:55:11,522 INFO L168 Benchmark]: Toolchain (without parser) took 3993.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -105.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:11,522 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:11,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:11,523 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:11,523 INFO L168 Benchmark]: Boogie Preprocessor took 36.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:11,523 INFO L168 Benchmark]: RCFGBuilder took 434.96 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:11,524 INFO L168 Benchmark]: TraceAbstraction took 3104.33 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: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:11,524 INFO L168 Benchmark]: Witness Printer took 95.72 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: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:11,525 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 270.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 434.96 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3104.33 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: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. * Witness Printer took 95.72 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: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cp + 1 <= urilen && 1 <= cp) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((c + 2 <= tokenlen && cp + 1 < urilen) && !(0 == cond)) && 1 <= cp) && 0 <= c) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cp + 1 <= urilen && 1 <= cp) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: ((cp + 1 < urilen && !(0 == cond)) && 1 <= cp) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((cp + 1 < urilen && 1 <= cp) && 0 <= c) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((!(0 == cond) && cp + 1 <= urilen) && 1 <= cp) && 0 <= c) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cp + 1 < urilen && !(0 == cond)) && 1 <= cp) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((c + 2 <= tokenlen && cp + 1 < urilen) && 1 <= cp) && 0 <= c) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((!(0 == cond) && cp + 1 <= urilen) && 1 <= cp) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cp + 1 < urilen && 1 <= cp) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((cp + 1 < urilen && !(0 == cond)) && 1 <= cp) && 0 <= c) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((!(0 == cond) && cp + 1 <= urilen) && 1 <= cp) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cp + 1 < urilen && 1 <= cp) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((cp + 1 < urilen && !(0 == cond)) && 1 <= cp) && 0 <= c) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cp + 1 <= urilen && 1 <= cp) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: ((!(0 == cond) && cp + 1 <= urilen) && 1 <= cp) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((cp + 1 < urilen && 1 <= cp) && 0 <= c) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((c == 0 && cp + 1 < urilen) && 1 <= cp) && 1 == cond) && 0 < scheme + 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 89 locations, 18 error locations. Result: SAFE, OverallTime: 3.0s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 423 SDtfs, 276 SDslu, 366 SDs, 0 SdLazy, 368 SolverSat, 224 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 51 NumberOfFragments, 352 HoareAnnotationTreeSize, 20 FomulaSimplifications, 265 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 500 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 313 NumberOfCodeBlocks, 313 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 303 ConstructedInterpolants, 0 QuantifiedInterpolants, 22318 SizeOfPredicates, 11 NumberOfNonLiveVariables, 237 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 10/20 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...