./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Ackermann03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/Ackermann03.c -s /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/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 33d0641b9a339cc7e30dea71c1d04be4d72dcf57 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:48:52,233 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:48:52,234 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:48:52,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:48:52,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:48:52,242 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:48:52,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:48:52,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:48:52,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:48:52,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:48:52,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:48:52,248 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:48:52,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:48:52,249 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:48:52,250 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:48:52,250 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:48:52,251 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:48:52,252 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:48:52,253 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:48:52,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:48:52,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:48:52,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:48:52,257 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:48:52,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:48:52,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:48:52,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:48:52,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:48:52,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:48:52,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:48:52,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:48:52,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:48:52,262 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:48:52,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:48:52,263 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:48:52,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:48:52,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:48:52,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:48:52,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:48:52,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:48:52,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:48:52,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:48:52,265 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:48:52,275 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:48:52,275 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:48:52,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:48:52,276 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:48:52,276 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:48:52,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:48:52,276 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:48:52,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:48:52,276 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:48:52,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:48:52,276 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:48:52,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:48:52,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:48:52,277 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:48:52,277 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:48:52,277 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:48:52,277 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:48:52,277 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:48:52,277 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:48:52,277 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:48:52,277 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:48:52,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:48:52,278 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:48:52,278 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:48:52,278 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:48:52,278 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:48:52,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:48:52,278 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:48:52,278 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:48:52,278 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/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 -> 33d0641b9a339cc7e30dea71c1d04be4d72dcf57 [2019-12-07 11:48:52,379 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:48:52,387 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:48:52,390 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:48:52,391 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:48:52,392 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:48:52,392 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/../../sv-benchmarks/c/recursive/Ackermann03.c [2019-12-07 11:48:52,440 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/data/cf4064af1/44a61677d32841bda26c3b58f3270012/FLAGa5a9d4dea [2019-12-07 11:48:52,831 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:48:52,831 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/sv-benchmarks/c/recursive/Ackermann03.c [2019-12-07 11:48:52,835 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/data/cf4064af1/44a61677d32841bda26c3b58f3270012/FLAGa5a9d4dea [2019-12-07 11:48:53,216 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/data/cf4064af1/44a61677d32841bda26c3b58f3270012 [2019-12-07 11:48:53,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:48:53,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:48:53,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:48:53,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:48:53,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:48:53,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:48:53" (1/1) ... [2019-12-07 11:48:53,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a9a3eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:53, skipping insertion in model container [2019-12-07 11:48:53,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:48:53" (1/1) ... [2019-12-07 11:48:53,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:48:53,245 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:48:53,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:48:53,344 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:48:53,356 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:48:53,401 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:48:53,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:53 WrapperNode [2019-12-07 11:48:53,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:48:53,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:48:53,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:48:53,403 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:48:53,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:53" (1/1) ... [2019-12-07 11:48:53,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:53" (1/1) ... [2019-12-07 11:48:53,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:48:53,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:48:53,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:48:53,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:48:53,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:53" (1/1) ... [2019-12-07 11:48:53,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:53" (1/1) ... [2019-12-07 11:48:53,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:53" (1/1) ... [2019-12-07 11:48:53,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:53" (1/1) ... [2019-12-07 11:48:53,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:53" (1/1) ... [2019-12-07 11:48:53,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:53" (1/1) ... [2019-12-07 11:48:53,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:53" (1/1) ... [2019-12-07 11:48:53,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:48:53,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:48:53,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:48:53,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:48:53,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:48:53,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:48:53,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:48:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2019-12-07 11:48:53,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2019-12-07 11:48:53,589 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:48:53,589 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 11:48:53,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:48:53 BoogieIcfgContainer [2019-12-07 11:48:53,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:48:53,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:48:53,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:48:53,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:48:53,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:48:53" (1/3) ... [2019-12-07 11:48:53,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2754674b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:48:53, skipping insertion in model container [2019-12-07 11:48:53,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:53" (2/3) ... [2019-12-07 11:48:53,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2754674b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:48:53, skipping insertion in model container [2019-12-07 11:48:53,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:48:53" (3/3) ... [2019-12-07 11:48:53,596 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann03.c [2019-12-07 11:48:53,603 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:48:53,606 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:48:53,614 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:48:53,631 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:48:53,631 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:48:53,631 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:48:53,632 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:48:53,632 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:48:53,632 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:48:53,632 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:48:53,632 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:48:53,642 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-12-07 11:48:53,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:48:53,646 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:48:53,646 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:48:53,646 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:48:53,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:48:53,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1260755674, now seen corresponding path program 1 times [2019-12-07 11:48:53,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:48:53,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147083947] [2019-12-07 11:48:53,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:48:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:53,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:48:53,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147083947] [2019-12-07 11:48:53,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:48:53,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:48:53,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923189002] [2019-12-07 11:48:53,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:48:53,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:48:53,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:48:53,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:48:53,798 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2019-12-07 11:48:53,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:48:53,881 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2019-12-07 11:48:53,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:48:53,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 11:48:53,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:48:53,888 INFO L225 Difference]: With dead ends: 50 [2019-12-07 11:48:53,889 INFO L226 Difference]: Without dead ends: 24 [2019-12-07 11:48:53,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:48:53,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-07 11:48:53,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-07 11:48:53,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 11:48:53,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2019-12-07 11:48:53,919 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 11 [2019-12-07 11:48:53,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:48:53,919 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-12-07 11:48:53,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:48:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2019-12-07 11:48:53,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:48:53,921 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:48:53,921 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:48:53,922 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:48:53,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:48:53,922 INFO L82 PathProgramCache]: Analyzing trace with hash 963920485, now seen corresponding path program 1 times [2019-12-07 11:48:53,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:48:53,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506902067] [2019-12-07 11:48:53,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:48:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:54,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:48:54,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506902067] [2019-12-07 11:48:54,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132562562] [2019-12-07 11:48:54,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:48:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:54,046 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:48:54,049 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:48:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:48:54,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:48:54,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-12-07 11:48:54,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244855550] [2019-12-07 11:48:54,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:48:54,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:48:54,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:48:54,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:48:54,093 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 11 states. [2019-12-07 11:48:54,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:48:54,231 INFO L93 Difference]: Finished difference Result 53 states and 82 transitions. [2019-12-07 11:48:54,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:48:54,232 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-12-07 11:48:54,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:48:54,233 INFO L225 Difference]: With dead ends: 53 [2019-12-07 11:48:54,233 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 11:48:54,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:48:54,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 11:48:54,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-12-07 11:48:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 11:48:54,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-12-07 11:48:54,241 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2019-12-07 11:48:54,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:48:54,241 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-12-07 11:48:54,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:48:54,241 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2019-12-07 11:48:54,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 11:48:54,243 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:48:54,243 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:48:54,443 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:48:54,443 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:48:54,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:48:54,444 INFO L82 PathProgramCache]: Analyzing trace with hash 416247163, now seen corresponding path program 1 times [2019-12-07 11:48:54,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:48:54,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984952957] [2019-12-07 11:48:54,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:48:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 11:48:54,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984952957] [2019-12-07 11:48:54,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132457194] [2019-12-07 11:48:54,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:48:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:54,588 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 11:48:54,590 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:48:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:48:54,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:48:54,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2019-12-07 11:48:54,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030376255] [2019-12-07 11:48:54,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 11:48:54,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:48:54,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 11:48:54,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:48:54,630 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand 14 states. [2019-12-07 11:48:54,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:48:54,934 INFO L93 Difference]: Finished difference Result 83 states and 166 transitions. [2019-12-07 11:48:54,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 11:48:54,935 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-12-07 11:48:54,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:48:54,938 INFO L225 Difference]: With dead ends: 83 [2019-12-07 11:48:54,938 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 11:48:54,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:48:54,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 11:48:54,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2019-12-07 11:48:54,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 11:48:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2019-12-07 11:48:54,952 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 31 [2019-12-07 11:48:54,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:48:54,952 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2019-12-07 11:48:54,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 11:48:54,952 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2019-12-07 11:48:54,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 11:48:54,955 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:48:54,955 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:48:55,155 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:48:55,156 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:48:55,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:48:55,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1827824897, now seen corresponding path program 2 times [2019-12-07 11:48:55,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:48:55,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551468497] [2019-12-07 11:48:55,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:48:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:55,296 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-07 11:48:55,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551468497] [2019-12-07 11:48:55,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860228654] [2019-12-07 11:48:55,297 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:48:55,325 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 11:48:55,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:48:55,325 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 11:48:55,328 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:48:55,351 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-07 11:48:55,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:48:55,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-12-07 11:48:55,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677201550] [2019-12-07 11:48:55,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:48:55,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:48:55,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:48:55,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:48:55,353 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand 9 states. [2019-12-07 11:48:55,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:48:55,429 INFO L93 Difference]: Finished difference Result 119 states and 226 transitions. [2019-12-07 11:48:55,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:48:55,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2019-12-07 11:48:55,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:48:55,430 INFO L225 Difference]: With dead ends: 119 [2019-12-07 11:48:55,431 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 11:48:55,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:48:55,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 11:48:55,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-12-07 11:48:55,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 11:48:55,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2019-12-07 11:48:55,439 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 44 [2019-12-07 11:48:55,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:48:55,439 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2019-12-07 11:48:55,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:48:55,439 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2019-12-07 11:48:55,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 11:48:55,442 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:48:55,442 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:48:55,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:48:55,643 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:48:55,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:48:55,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1207723706, now seen corresponding path program 3 times [2019-12-07 11:48:55,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:48:55,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249601139] [2019-12-07 11:48:55,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:48:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 101 proven. 59 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-12-07 11:48:55,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249601139] [2019-12-07 11:48:55,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247826749] [2019-12-07 11:48:55,877 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:48:55,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-07 11:48:55,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:48:55,912 INFO L264 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 11:48:55,916 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:48:55,960 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 98 proven. 19 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-12-07 11:48:55,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:48:55,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 18 [2019-12-07 11:48:55,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188536789] [2019-12-07 11:48:55,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 11:48:55,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:48:55,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 11:48:55,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:48:55,962 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand 18 states. [2019-12-07 11:48:56,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:48:56,298 INFO L93 Difference]: Finished difference Result 118 states and 221 transitions. [2019-12-07 11:48:56,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 11:48:56,298 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2019-12-07 11:48:56,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:48:56,301 INFO L225 Difference]: With dead ends: 118 [2019-12-07 11:48:56,301 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 11:48:56,303 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=261, Invalid=999, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 11:48:56,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 11:48:56,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-12-07 11:48:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 11:48:56,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2019-12-07 11:48:56,315 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 78 [2019-12-07 11:48:56,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:48:56,316 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2019-12-07 11:48:56,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 11:48:56,316 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2019-12-07 11:48:56,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-12-07 11:48:56,323 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:48:56,323 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 14, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:48:56,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:48:56,524 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:48:56,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:48:56,525 INFO L82 PathProgramCache]: Analyzing trace with hash -554167378, now seen corresponding path program 4 times [2019-12-07 11:48:56,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:48:56,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009817826] [2019-12-07 11:48:56,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:48:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:57,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1245 backedges. 364 proven. 420 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2019-12-07 11:48:57,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009817826] [2019-12-07 11:48:57,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787365103] [2019-12-07 11:48:57,031 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:48:57,078 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 11:48:57,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:48:57,079 INFO L264 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 11:48:57,084 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:48:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1245 backedges. 374 proven. 140 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2019-12-07 11:48:57,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:48:57,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 8] total 28 [2019-12-07 11:48:57,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361152646] [2019-12-07 11:48:57,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 11:48:57,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:48:57,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 11:48:57,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2019-12-07 11:48:57,206 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand 28 states. [2019-12-07 11:48:59,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:48:59,251 INFO L93 Difference]: Finished difference Result 176 states and 446 transitions. [2019-12-07 11:48:59,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-12-07 11:48:59,251 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 157 [2019-12-07 11:48:59,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:48:59,253 INFO L225 Difference]: With dead ends: 176 [2019-12-07 11:48:59,253 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 11:48:59,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2280 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1700, Invalid=7420, Unknown=0, NotChecked=0, Total=9120 [2019-12-07 11:48:59,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 11:48:59,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-12-07 11:48:59,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 11:48:59,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2019-12-07 11:48:59,263 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 157 [2019-12-07 11:48:59,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:48:59,263 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2019-12-07 11:48:59,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 11:48:59,263 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2019-12-07 11:48:59,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-07 11:48:59,265 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:48:59,265 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 11, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:48:59,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:48:59,466 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:48:59,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:48:59,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1646083662, now seen corresponding path program 5 times [2019-12-07 11:48:59,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:48:59,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848353217] [2019-12-07 11:48:59,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:48:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 240 proven. 264 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-12-07 11:48:59,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848353217] [2019-12-07 11:48:59,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438916968] [2019-12-07 11:48:59,735 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:48:59,778 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-12-07 11:48:59,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:48:59,779 INFO L264 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 11:48:59,782 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:48:59,825 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 475 proven. 114 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-12-07 11:48:59,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:48:59,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 19 [2019-12-07 11:48:59,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321178462] [2019-12-07 11:48:59,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 11:48:59,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:48:59,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 11:48:59,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:48:59,826 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 19 states. [2019-12-07 11:49:00,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:00,261 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-12-07 11:49:00,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 11:49:00,261 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 130 [2019-12-07 11:49:00,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:00,263 INFO L225 Difference]: With dead ends: 121 [2019-12-07 11:49:00,263 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 11:49:00,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=364, Invalid=1528, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 11:49:00,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 11:49:00,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2019-12-07 11:49:00,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 11:49:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2019-12-07 11:49:00,271 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 130 [2019-12-07 11:49:00,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:00,271 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2019-12-07 11:49:00,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 11:49:00,271 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2019-12-07 11:49:00,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 11:49:00,272 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:00,273 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 13, 10, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:00,473 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:49:00,474 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:00,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:00,474 INFO L82 PathProgramCache]: Analyzing trace with hash -437561620, now seen corresponding path program 6 times [2019-12-07 11:49:00,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:00,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536011603] [2019-12-07 11:49:00,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 446 proven. 274 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-12-07 11:49:00,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536011603] [2019-12-07 11:49:00,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874666406] [2019-12-07 11:49:00,852 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:49:00,909 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-12-07 11:49:00,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:49:00,911 INFO L264 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 11:49:00,914 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 421 proven. 286 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2019-12-07 11:49:00,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:49:00,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 24 [2019-12-07 11:49:00,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640058952] [2019-12-07 11:49:00,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 11:49:00,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:00,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 11:49:00,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-12-07 11:49:00,967 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand 24 states. [2019-12-07 11:49:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:01,516 INFO L93 Difference]: Finished difference Result 133 states and 167 transitions. [2019-12-07 11:49:01,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 11:49:01,516 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 156 [2019-12-07 11:49:01,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:01,518 INFO L225 Difference]: With dead ends: 133 [2019-12-07 11:49:01,518 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 11:49:01,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=500, Invalid=2470, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 11:49:01,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 11:49:01,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2019-12-07 11:49:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-12-07 11:49:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2019-12-07 11:49:01,529 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 156 [2019-12-07 11:49:01,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:01,530 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2019-12-07 11:49:01,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 11:49:01,530 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2019-12-07 11:49:01,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-12-07 11:49:01,532 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:01,532 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 14, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:01,733 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:49:01,733 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:01,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:01,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1768194034, now seen corresponding path program 7 times [2019-12-07 11:49:01,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:01,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580946397] [2019-12-07 11:49:01,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:02,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 503 proven. 360 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2019-12-07 11:49:02,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580946397] [2019-12-07 11:49:02,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831141174] [2019-12-07 11:49:02,117 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:49:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:02,178 INFO L264 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-07 11:49:02,182 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:02,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2019-12-07 11:49:02,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:49:02,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 25 [2019-12-07 11:49:02,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675002681] [2019-12-07 11:49:02,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 11:49:02,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:02,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 11:49:02,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2019-12-07 11:49:02,246 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand 25 states. [2019-12-07 11:49:02,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:02,836 INFO L93 Difference]: Finished difference Result 151 states and 194 transitions. [2019-12-07 11:49:02,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-07 11:49:02,836 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 169 [2019-12-07 11:49:02,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:02,837 INFO L225 Difference]: With dead ends: 151 [2019-12-07 11:49:02,838 INFO L226 Difference]: Without dead ends: 102 [2019-12-07 11:49:02,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=619, Invalid=3041, Unknown=0, NotChecked=0, Total=3660 [2019-12-07 11:49:02,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-07 11:49:02,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 78. [2019-12-07 11:49:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 11:49:02,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2019-12-07 11:49:02,846 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 169 [2019-12-07 11:49:02,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:02,847 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2019-12-07 11:49:02,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 11:49:02,847 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2019-12-07 11:49:02,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-12-07 11:49:02,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:02,849 INFO L410 BasicCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:03,049 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:49:03,049 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:03,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:03,050 INFO L82 PathProgramCache]: Analyzing trace with hash -728546296, now seen corresponding path program 8 times [2019-12-07 11:49:03,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:03,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267565042] [2019-12-07 11:49:03,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 600 proven. 156 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2019-12-07 11:49:03,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267565042] [2019-12-07 11:49:03,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366023159] [2019-12-07 11:49:03,558 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:49:03,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 11:49:03,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:49:03,615 INFO L264 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 79 conjunts are in the unsatisfiable core [2019-12-07 11:49:03,618 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 583 proven. 158 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2019-12-07 11:49:03,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:49:03,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 25 [2019-12-07 11:49:03,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147839656] [2019-12-07 11:49:03,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 11:49:03,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:03,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 11:49:03,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2019-12-07 11:49:03,765 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand 25 states. [2019-12-07 11:49:05,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:05,142 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2019-12-07 11:49:05,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 11:49:05,142 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 182 [2019-12-07 11:49:05,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:05,144 INFO L225 Difference]: With dead ends: 125 [2019-12-07 11:49:05,144 INFO L226 Difference]: Without dead ends: 115 [2019-12-07 11:49:05,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 234 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=247, Invalid=2615, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 11:49:05,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-07 11:49:05,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 92. [2019-12-07 11:49:05,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 11:49:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2019-12-07 11:49:05,155 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 182 [2019-12-07 11:49:05,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:05,156 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2019-12-07 11:49:05,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 11:49:05,156 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2019-12-07 11:49:05,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-12-07 11:49:05,158 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:05,158 INFO L410 BasicCegarLoop]: trace histogram [29, 29, 16, 13, 12, 12, 12, 12, 12, 12, 12, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:05,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:49:05,359 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:05,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:05,359 INFO L82 PathProgramCache]: Analyzing trace with hash -215902222, now seen corresponding path program 9 times [2019-12-07 11:49:05,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:05,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107662750] [2019-12-07 11:49:05,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 665 proven. 517 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2019-12-07 11:49:05,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107662750] [2019-12-07 11:49:05,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105810222] [2019-12-07 11:49:05,759 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:49:05,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-12-07 11:49:05,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:49:05,836 INFO L264 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-07 11:49:05,838 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:05,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 647 proven. 519 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2019-12-07 11:49:05,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:49:05,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 27 [2019-12-07 11:49:05,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697676751] [2019-12-07 11:49:05,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 11:49:05,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:05,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 11:49:05,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2019-12-07 11:49:05,907 INFO L87 Difference]: Start difference. First operand 92 states and 123 transitions. Second operand 27 states. [2019-12-07 11:49:06,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:06,399 INFO L93 Difference]: Finished difference Result 206 states and 269 transitions. [2019-12-07 11:49:06,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 11:49:06,399 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 195 [2019-12-07 11:49:06,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:06,400 INFO L225 Difference]: With dead ends: 206 [2019-12-07 11:49:06,400 INFO L226 Difference]: Without dead ends: 133 [2019-12-07 11:49:06,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=439, Invalid=2213, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 11:49:06,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-12-07 11:49:06,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2019-12-07 11:49:06,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 11:49:06,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2019-12-07 11:49:06,410 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 128 transitions. Word has length 195 [2019-12-07 11:49:06,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:06,411 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 128 transitions. [2019-12-07 11:49:06,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 11:49:06,411 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 128 transitions. [2019-12-07 11:49:06,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-12-07 11:49:06,414 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:06,414 INFO L410 BasicCegarLoop]: trace histogram [31, 31, 17, 14, 13, 13, 13, 13, 13, 13, 13, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:06,614 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:49:06,615 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:06,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:06,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1299313862, now seen corresponding path program 10 times [2019-12-07 11:49:06,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:06,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854912000] [2019-12-07 11:49:06,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:06,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 268 proven. 783 refuted. 0 times theorem prover too weak. 1269 trivial. 0 not checked. [2019-12-07 11:49:06,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854912000] [2019-12-07 11:49:06,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780785693] [2019-12-07 11:49:06,948 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:49:07,015 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 11:49:07,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:49:07,017 INFO L264 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 11:49:07,020 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 1340 proven. 196 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-12-07 11:49:07,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:49:07,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 20 [2019-12-07 11:49:07,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093051040] [2019-12-07 11:49:07,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 11:49:07,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:07,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 11:49:07,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:49:07,068 INFO L87 Difference]: Start difference. First operand 97 states and 128 transitions. Second operand 20 states. [2019-12-07 11:49:07,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:07,355 INFO L93 Difference]: Finished difference Result 174 states and 226 transitions. [2019-12-07 11:49:07,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 11:49:07,355 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 208 [2019-12-07 11:49:07,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:07,356 INFO L225 Difference]: With dead ends: 174 [2019-12-07 11:49:07,356 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 11:49:07,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 11:49:07,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 11:49:07,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 92. [2019-12-07 11:49:07,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 11:49:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2019-12-07 11:49:07,365 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 208 [2019-12-07 11:49:07,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:07,366 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2019-12-07 11:49:07,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 11:49:07,366 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2019-12-07 11:49:07,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-12-07 11:49:07,368 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:07,368 INFO L410 BasicCegarLoop]: trace histogram [42, 42, 23, 19, 18, 18, 18, 18, 18, 18, 18, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:07,568 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:49:07,569 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:07,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:07,569 INFO L82 PathProgramCache]: Analyzing trace with hash -261718049, now seen corresponding path program 11 times [2019-12-07 11:49:07,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:07,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907394089] [2019-12-07 11:49:07,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:08,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 1521 proven. 761 refuted. 0 times theorem prover too weak. 2047 trivial. 0 not checked. [2019-12-07 11:49:08,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907394089] [2019-12-07 11:49:08,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187114436] [2019-12-07 11:49:08,326 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:49:08,432 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-12-07 11:49:08,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:49:08,434 INFO L264 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 53 conjunts are in the unsatisfiable core [2019-12-07 11:49:08,438 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 1483 proven. 777 refuted. 0 times theorem prover too weak. 2069 trivial. 0 not checked. [2019-12-07 11:49:08,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:49:08,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29] total 34 [2019-12-07 11:49:08,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384292337] [2019-12-07 11:49:08,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-07 11:49:08,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:08,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-07 11:49:08,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=978, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 11:49:08,524 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand 34 states. [2019-12-07 11:49:09,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:09,539 INFO L93 Difference]: Finished difference Result 191 states and 250 transitions. [2019-12-07 11:49:09,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-07 11:49:09,540 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 280 [2019-12-07 11:49:09,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:09,541 INFO L225 Difference]: With dead ends: 191 [2019-12-07 11:49:09,541 INFO L226 Difference]: Without dead ends: 126 [2019-12-07 11:49:09,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1634 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1037, Invalid=5935, Unknown=0, NotChecked=0, Total=6972 [2019-12-07 11:49:09,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-07 11:49:09,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 97. [2019-12-07 11:49:09,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 11:49:09,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2019-12-07 11:49:09,550 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 280 [2019-12-07 11:49:09,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:09,550 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2019-12-07 11:49:09,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-07 11:49:09,551 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2019-12-07 11:49:09,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-12-07 11:49:09,552 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:09,552 INFO L410 BasicCegarLoop]: trace histogram [44, 44, 24, 20, 19, 19, 19, 19, 19, 19, 19, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:09,752 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:49:09,753 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:09,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:09,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1710761897, now seen corresponding path program 12 times [2019-12-07 11:49:09,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:09,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089044621] [2019-12-07 11:49:09,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:10,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4764 backedges. 233 proven. 548 refuted. 0 times theorem prover too weak. 3983 trivial. 0 not checked. [2019-12-07 11:49:10,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089044621] [2019-12-07 11:49:10,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105314499] [2019-12-07 11:49:10,081 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:49:10,179 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-12-07 11:49:10,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:49:10,181 INFO L264 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 11:49:10,184 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:10,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4764 backedges. 215 proven. 426 refuted. 0 times theorem prover too weak. 4123 trivial. 0 not checked. [2019-12-07 11:49:10,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:49:10,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-12-07 11:49:10,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944288619] [2019-12-07 11:49:10,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:49:10,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:10,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:49:10,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:49:10,250 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand 12 states. [2019-12-07 11:49:10,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:10,357 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2019-12-07 11:49:10,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 11:49:10,357 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 293 [2019-12-07 11:49:10,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:10,358 INFO L225 Difference]: With dead ends: 97 [2019-12-07 11:49:10,358 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 11:49:10,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:49:10,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 11:49:10,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 11:49:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 11:49:10,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 11:49:10,359 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 293 [2019-12-07 11:49:10,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:10,359 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:49:10,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:49:10,359 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:49:10,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 11:49:10,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:49:10,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 11:49:11,236 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 20 [2019-12-07 11:49:12,254 WARN L192 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 177 DAG size of output: 74 [2019-12-07 11:49:12,336 INFO L246 CegarLoopResult]: For program point L33(lines 33 38) no Hoare annotation was computed. [2019-12-07 11:49:12,336 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 11:49:12,336 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 11:49:12,336 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 11:49:12,336 INFO L246 CegarLoopResult]: For program point L27(lines 27 31) no Hoare annotation was computed. [2019-12-07 11:49:12,336 INFO L249 CegarLoopResult]: At program point L25(lines 25 45) the Hoare annotation is: true [2019-12-07 11:49:12,336 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2019-12-07 11:49:12,336 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 11:49:12,337 INFO L246 CegarLoopResult]: For program point L40(lines 40 44) no Hoare annotation was computed. [2019-12-07 11:49:12,337 INFO L249 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2019-12-07 11:49:12,337 INFO L246 CegarLoopResult]: For program point L39-1(line 39) no Hoare annotation was computed. [2019-12-07 11:49:12,337 INFO L246 CegarLoopResult]: For program point ackermannEXIT(lines 14 22) no Hoare annotation was computed. [2019-12-07 11:49:12,337 INFO L249 CegarLoopResult]: At program point ackermannENTRY(lines 14 22) the Hoare annotation is: true [2019-12-07 11:49:12,337 INFO L242 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (not (= |ackermann_#in~n| 0)) (or (not (<= 0 |ackermann_#in~m|)) (not (<= 1 |ackermann_#in~n|)) (<= 1 |ackermann_#in~m|) (not (<= |ackermann_#in~n| 1)))) [2019-12-07 11:49:12,337 INFO L246 CegarLoopResult]: For program point L21-1(line 21) no Hoare annotation was computed. [2019-12-07 11:49:12,337 INFO L242 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2019-12-07 11:49:12,337 INFO L242 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: (let ((.cse12 (<= 3 |ackermann_#t~ret1|)) (.cse10 (= ackermann_~m |ackermann_#in~m|)) (.cse13 (= |ackermann_#in~n| 1)) (.cse11 (= ackermann_~n |ackermann_#in~n|)) (.cse9 (<= 2 |ackermann_#in~m|))) (let ((.cse6 (<= |ackermann_#t~ret1| 5)) (.cse3 (<= |ackermann_#t~ret1| 3)) (.cse0 (<= 3 |ackermann_#in~n|)) (.cse4 (<= 5 |ackermann_#t~ret1|)) (.cse5 (<= |ackermann_#in~n| 2)) (.cse8 (not (<= 1 |ackermann_#in~m|))) (.cse1 (<= 7 |ackermann_#t~ret1|)) (.cse14 (and .cse12 .cse10 (or (<= 2 |ackermann_#res|) (not .cse13)) .cse11 .cse9)) (.cse2 (<= |ackermann_#in~n| 1)) (.cse7 (<= ackermann_~m 1)) (.cse15 (= |ackermann_#in~m| 0))) (and (or (and .cse0 .cse1) (<= 3 |ackermann_#in~m|) (and .cse2 .cse3) (and (<= 2 |ackermann_#in~n|) .cse4 .cse5 .cse6) .cse7) (or (and .cse6 (<= 4 |ackermann_#in~n|)) .cse8 .cse9 .cse3 (and .cse0 (<= |ackermann_#t~ret1| 4)) (<= 5 |ackermann_#in~n|)) (or (and .cse10 .cse11 (<= |ackermann_#t~ret1| 6) (<= 6 |ackermann_#t~ret1|)) .cse8 (and .cse4 .cse10 .cse11 (<= |ackermann_#in~n| 4)) (and .cse12 .cse5 .cse10 .cse11) (and (<= 4 |ackermann_#t~ret1|) .cse10 (<= |ackermann_#in~n| 3) .cse11) .cse13 (and .cse10 .cse11 (<= 6 |ackermann_#in~n|)) .cse14) (or (<= |ackermann_#in~n| 5) .cse8 .cse1 .cse14) (or .cse15 (and .cse12 .cse10 .cse11 .cse9) (not .cse2) (and .cse10 .cse11 .cse7 (<= 2 |ackermann_#t~ret1|) (<= |ackermann_#t~ret1| 2))) (or .cse15 (not (<= |ackermann_#in~n| 0))) (or (not (<= |ackermann_#in~m| 0)) (and .cse10 .cse15 .cse11))))) [2019-12-07 11:49:12,337 INFO L246 CegarLoopResult]: For program point L18(lines 18 20) no Hoare annotation was computed. [2019-12-07 11:49:12,337 INFO L246 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2019-12-07 11:49:12,337 INFO L246 CegarLoopResult]: For program point L21-3(line 21) no Hoare annotation was computed. [2019-12-07 11:49:12,337 INFO L246 CegarLoopResult]: For program point L15(lines 15 17) no Hoare annotation was computed. [2019-12-07 11:49:12,337 INFO L246 CegarLoopResult]: For program point ackermannFINAL(lines 14 22) no Hoare annotation was computed. [2019-12-07 11:49:12,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:49:12 BoogieIcfgContainer [2019-12-07 11:49:12,343 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:49:12,344 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:49:12,344 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:49:12,344 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:49:12,344 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:48:53" (3/4) ... [2019-12-07 11:49:12,346 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 11:49:12,351 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2019-12-07 11:49:12,354 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 11:49:12,354 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 11:49:12,382 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_90ed7d01-f0b5-48cd-8fbe-65aa4bb33e9d/bin/uautomizer/witness.graphml [2019-12-07 11:49:12,382 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:49:12,383 INFO L168 Benchmark]: Toolchain (without parser) took 19164.02 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 425.7 MB). Free memory was 941.4 MB in the beginning and 826.7 MB in the end (delta: 114.7 MB). Peak memory consumption was 540.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:12,383 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:49:12,384 INFO L168 Benchmark]: CACSL2BoogieTranslator took 182.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -135.1 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:12,384 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.26 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:49:12,384 INFO L168 Benchmark]: Boogie Preprocessor took 12.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:12,384 INFO L168 Benchmark]: RCFGBuilder took 148.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:12,384 INFO L168 Benchmark]: TraceAbstraction took 18752.44 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 346.6 MB). Free memory was 1.1 GB in the beginning and 830.9 MB in the end (delta: 225.4 MB). Peak memory consumption was 620.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:12,385 INFO L168 Benchmark]: Witness Printer took 38.31 ms. Allocated memory is still 1.5 GB. Free memory was 830.9 MB in the beginning and 826.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:12,386 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 182.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -135.1 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.26 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 148.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18752.44 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 346.6 MB). Free memory was 1.1 GB in the beginning and 830.9 MB in the end (delta: 225.4 MB). Peak memory consumption was 620.1 MB. Max. memory is 11.5 GB. * Witness Printer took 38.31 ms. Allocated memory is still 1.5 GB. Free memory was 830.9 MB in the beginning and 826.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Result: SAFE, OverallTime: 16.9s, OverallIterations: 14, TraceHistogramMax: 44, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, HoareTripleCheckerStatistics: 365 SDtfs, 574 SDslu, 2235 SDs, 0 SdLazy, 7766 SolverSat, 1477 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3112 GetRequests, 2540 SyntacticMatches, 7 SemanticMatches, 565 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7406 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=11, 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, 14 MinimizatonAttempts, 179 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 538 PreInvPairs, 1158 NumberOfFragments, 286 HoareAnnotationTreeSize, 538 FomulaSimplifications, 258652 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 6 FomulaSimplificationsInter, 20970 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 3893 NumberOfCodeBlocks, 3758 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 3866 ConstructedInterpolants, 0 QuantifiedInterpolants, 1389250 SizeOfPredicates, 111 NumberOfNonLiveVariables, 5351 ConjunctsInSsa, 353 ConjunctsInUnsatCore, 27 InterpolantComputations, 1 PerfectInterpolantSequences, 33464/40688 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...