./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label04.c -s /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/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 e4f93eb95cdae688384271d92bae052385a66833 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 01:35:59,185 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:35:59,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:35:59,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:35:59,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:35:59,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:35:59,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:35:59,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:35:59,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:35:59,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:35:59,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:35:59,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:35:59,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:35:59,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:35:59,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:35:59,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:35:59,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:35:59,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:35:59,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:35:59,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:35:59,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:35:59,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:35:59,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:35:59,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:35:59,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:35:59,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:35:59,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:35:59,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:35:59,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:35:59,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:35:59,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:35:59,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:35:59,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:35:59,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:35:59,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:35:59,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:35:59,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:35:59,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:35:59,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:35:59,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:35:59,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:35:59,246 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 01:35:59,265 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:35:59,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:35:59,268 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:35:59,268 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:35:59,268 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:35:59,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:35:59,269 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:35:59,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:35:59,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:35:59,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:35:59,270 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 01:35:59,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:35:59,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 01:35:59,271 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:35:59,271 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:35:59,271 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:35:59,271 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 01:35:59,272 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:35:59,272 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:35:59,272 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:35:59,272 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:35:59,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:35:59,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:35:59,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:35:59,273 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 01:35:59,273 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 01:35:59,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 01:35:59,273 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 01:35:59,274 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_62d3e2d9-6121-4af0-b74a-391619736f5e/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 -> e4f93eb95cdae688384271d92bae052385a66833 [2019-11-20 01:35:59,460 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:35:59,471 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:35:59,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:35:59,476 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:35:59,476 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:35:59,477 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem14_label04.c [2019-11-20 01:35:59,530 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/bin/uautomizer/data/756743c1d/27c79e140f4845baac83cfb721cd532c/FLAGbddab3dfa [2019-11-20 01:35:59,972 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:35:59,973 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/sv-benchmarks/c/eca-rers2012/Problem14_label04.c [2019-11-20 01:35:59,988 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/bin/uautomizer/data/756743c1d/27c79e140f4845baac83cfb721cd532c/FLAGbddab3dfa [2019-11-20 01:36:00,271 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/bin/uautomizer/data/756743c1d/27c79e140f4845baac83cfb721cd532c [2019-11-20 01:36:00,274 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:36:00,275 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:36:00,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:36:00,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:36:00,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:36:00,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:36:00" (1/1) ... [2019-11-20 01:36:00,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c02f6b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:36:00, skipping insertion in model container [2019-11-20 01:36:00,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:36:00" (1/1) ... [2019-11-20 01:36:00,294 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:36:00,356 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:36:00,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:36:00,905 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:36:01,017 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:36:01,032 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:36:01,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:36:01 WrapperNode [2019-11-20 01:36:01,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:36:01,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:36:01,034 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:36:01,034 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:36:01,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:36:01" (1/1) ... [2019-11-20 01:36:01,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:36:01" (1/1) ... [2019-11-20 01:36:01,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:36:01,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:36:01,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:36:01,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:36:01,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:36:01" (1/1) ... [2019-11-20 01:36:01,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:36:01" (1/1) ... [2019-11-20 01:36:01,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:36:01" (1/1) ... [2019-11-20 01:36:01,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:36:01" (1/1) ... [2019-11-20 01:36:01,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:36:01" (1/1) ... [2019-11-20 01:36:01,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:36:01" (1/1) ... [2019-11-20 01:36:01,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:36:01" (1/1) ... [2019-11-20 01:36:01,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:36:01,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:36:01,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:36:01,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:36:01,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:36:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:36:01,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:36:01,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:36:02,753 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:36:02,754 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 01:36:02,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:36:02 BoogieIcfgContainer [2019-11-20 01:36:02,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:36:02,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:36:02,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:36:02,759 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:36:02,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:36:00" (1/3) ... [2019-11-20 01:36:02,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd91412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:36:02, skipping insertion in model container [2019-11-20 01:36:02,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:36:01" (2/3) ... [2019-11-20 01:36:02,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd91412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:36:02, skipping insertion in model container [2019-11-20 01:36:02,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:36:02" (3/3) ... [2019-11-20 01:36:02,763 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label04.c [2019-11-20 01:36:02,773 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:36:02,782 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 01:36:02,792 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 01:36:02,832 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:36:02,832 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 01:36:02,832 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:36:02,832 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:36:02,832 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:36:02,833 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:36:02,833 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:36:02,833 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:36:02,856 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-11-20 01:36:02,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 01:36:02,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:36:02,865 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:36:02,866 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:36:02,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:36:02,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1382487458, now seen corresponding path program 1 times [2019-11-20 01:36:02,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:36:02,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178297232] [2019-11-20 01:36:02,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:36:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:03,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:36:03,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178297232] [2019-11-20 01:36:03,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:36:03,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:36:03,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040547163] [2019-11-20 01:36:03,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:36:03,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:36:03,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:36:03,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:36:03,187 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-11-20 01:36:05,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:36:05,508 INFO L93 Difference]: Finished difference Result 850 states and 1558 transitions. [2019-11-20 01:36:05,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:36:05,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-20 01:36:05,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:36:05,536 INFO L225 Difference]: With dead ends: 850 [2019-11-20 01:36:05,537 INFO L226 Difference]: Without dead ends: 538 [2019-11-20 01:36:05,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:36:05,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-20 01:36:05,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-11-20 01:36:05,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-20 01:36:05,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 826 transitions. [2019-11-20 01:36:05,632 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 826 transitions. Word has length 52 [2019-11-20 01:36:05,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:36:05,633 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 826 transitions. [2019-11-20 01:36:05,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:36:05,633 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 826 transitions. [2019-11-20 01:36:05,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 01:36:05,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:36:05,644 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:36:05,645 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:36:05,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:36:05,646 INFO L82 PathProgramCache]: Analyzing trace with hash 106118808, now seen corresponding path program 1 times [2019-11-20 01:36:05,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:36:05,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238939929] [2019-11-20 01:36:05,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:36:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:36:05,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238939929] [2019-11-20 01:36:05,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:36:05,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:36:05,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943267928] [2019-11-20 01:36:05,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:36:05,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:36:05,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:36:05,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:36:05,794 INFO L87 Difference]: Start difference. First operand 538 states and 826 transitions. Second operand 4 states. [2019-11-20 01:36:07,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:36:07,158 INFO L93 Difference]: Finished difference Result 2142 states and 3296 transitions. [2019-11-20 01:36:07,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:36:07,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-20 01:36:07,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:36:07,168 INFO L225 Difference]: With dead ends: 2142 [2019-11-20 01:36:07,169 INFO L226 Difference]: Without dead ends: 1606 [2019-11-20 01:36:07,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:36:07,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-11-20 01:36:07,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2019-11-20 01:36:07,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-20 01:36:07,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 2029 transitions. [2019-11-20 01:36:07,228 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 2029 transitions. Word has length 117 [2019-11-20 01:36:07,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:36:07,229 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 2029 transitions. [2019-11-20 01:36:07,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:36:07,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 2029 transitions. [2019-11-20 01:36:07,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 01:36:07,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:36:07,234 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:36:07,234 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:36:07,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:36:07,234 INFO L82 PathProgramCache]: Analyzing trace with hash -301797236, now seen corresponding path program 1 times [2019-11-20 01:36:07,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:36:07,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146011190] [2019-11-20 01:36:07,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:36:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:07,362 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:36:07,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146011190] [2019-11-20 01:36:07,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:36:07,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:36:07,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866346023] [2019-11-20 01:36:07,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:36:07,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:36:07,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:36:07,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:36:07,365 INFO L87 Difference]: Start difference. First operand 1428 states and 2029 transitions. Second operand 4 states. [2019-11-20 01:36:08,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:36:08,824 INFO L93 Difference]: Finished difference Result 4634 states and 6631 transitions. [2019-11-20 01:36:08,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:36:08,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-20 01:36:08,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:36:08,845 INFO L225 Difference]: With dead ends: 4634 [2019-11-20 01:36:08,845 INFO L226 Difference]: Without dead ends: 3208 [2019-11-20 01:36:08,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:36:08,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2019-11-20 01:36:08,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 2852. [2019-11-20 01:36:08,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-11-20 01:36:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3754 transitions. [2019-11-20 01:36:08,930 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3754 transitions. Word has length 120 [2019-11-20 01:36:08,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:36:08,932 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 3754 transitions. [2019-11-20 01:36:08,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:36:08,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3754 transitions. [2019-11-20 01:36:08,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-11-20 01:36:08,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:36:08,958 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:36:08,958 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:36:08,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:36:08,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1455566984, now seen corresponding path program 1 times [2019-11-20 01:36:08,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:36:08,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103535868] [2019-11-20 01:36:08,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:36:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:09,389 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 246 proven. 4 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-20 01:36:09,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103535868] [2019-11-20 01:36:09,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460408947] [2019-11-20 01:36:09,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:36:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:09,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:36:09,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:36:09,734 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-11-20 01:36:09,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 01:36:09,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-20 01:36:09,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779141419] [2019-11-20 01:36:09,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:36:09,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:36:09,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:36:09,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:36:09,742 INFO L87 Difference]: Start difference. First operand 2852 states and 3754 transitions. Second operand 3 states. [2019-11-20 01:36:10,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:36:10,597 INFO L93 Difference]: Finished difference Result 6414 states and 8465 transitions. [2019-11-20 01:36:10,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:36:10,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2019-11-20 01:36:10,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:36:10,620 INFO L225 Difference]: With dead ends: 6414 [2019-11-20 01:36:10,620 INFO L226 Difference]: Without dead ends: 3742 [2019-11-20 01:36:10,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 276 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:36:10,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2019-11-20 01:36:10,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 2852. [2019-11-20 01:36:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-11-20 01:36:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3754 transitions. [2019-11-20 01:36:10,706 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3754 transitions. Word has length 277 [2019-11-20 01:36:10,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:36:10,709 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 3754 transitions. [2019-11-20 01:36:10,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:36:10,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3754 transitions. [2019-11-20 01:36:10,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-11-20 01:36:10,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:36:10,718 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:36:10,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:36:10,925 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:36:10,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:36:10,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1904800060, now seen corresponding path program 1 times [2019-11-20 01:36:10,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:36:10,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103575223] [2019-11-20 01:36:10,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:36:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:11,276 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 250 proven. 4 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-20 01:36:11,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103575223] [2019-11-20 01:36:11,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437098758] [2019-11-20 01:36:11,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/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-11-20 01:36:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:11,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 01:36:11,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:36:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-20 01:36:11,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 01:36:11,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 01:36:11,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333161538] [2019-11-20 01:36:11,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:36:11,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:36:11,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:36:11,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:36:11,597 INFO L87 Difference]: Start difference. First operand 2852 states and 3754 transitions. Second operand 4 states. [2019-11-20 01:36:12,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:36:12,649 INFO L93 Difference]: Finished difference Result 5731 states and 7565 transitions. [2019-11-20 01:36:12,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:36:12,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2019-11-20 01:36:12,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:36:12,664 INFO L225 Difference]: With dead ends: 5731 [2019-11-20 01:36:12,665 INFO L226 Difference]: Without dead ends: 3030 [2019-11-20 01:36:12,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:36:12,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2019-11-20 01:36:12,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 2852. [2019-11-20 01:36:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-11-20 01:36:12,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3227 transitions. [2019-11-20 01:36:12,730 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3227 transitions. Word has length 309 [2019-11-20 01:36:12,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:36:12,731 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 3227 transitions. [2019-11-20 01:36:12,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:36:12,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3227 transitions. [2019-11-20 01:36:12,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-11-20 01:36:12,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:36:12,738 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:36:12,941 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:36:12,941 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:36:12,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:36:12,942 INFO L82 PathProgramCache]: Analyzing trace with hash -369817949, now seen corresponding path program 1 times [2019-11-20 01:36:12,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:36:12,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475186128] [2019-11-20 01:36:12,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:36:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 337 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-20 01:36:13,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475186128] [2019-11-20 01:36:13,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072894922] [2019-11-20 01:36:13,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/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-11-20 01:36:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:13,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 01:36:13,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:36:13,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 318 proven. 23 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-20 01:36:14,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:36:14,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-20 01:36:14,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152499216] [2019-11-20 01:36:14,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:36:14,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:36:14,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:36:14,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:36:14,039 INFO L87 Difference]: Start difference. First operand 2852 states and 3227 transitions. Second operand 8 states. [2019-11-20 01:36:15,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:36:15,889 INFO L93 Difference]: Finished difference Result 5744 states and 6499 transitions. [2019-11-20 01:36:15,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 01:36:15,889 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 356 [2019-11-20 01:36:15,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:36:15,903 INFO L225 Difference]: With dead ends: 5744 [2019-11-20 01:36:15,903 INFO L226 Difference]: Without dead ends: 3072 [2019-11-20 01:36:15,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 353 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:36:15,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2019-11-20 01:36:15,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2852. [2019-11-20 01:36:15,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-11-20 01:36:15,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3222 transitions. [2019-11-20 01:36:15,967 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3222 transitions. Word has length 356 [2019-11-20 01:36:15,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:36:15,968 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 3222 transitions. [2019-11-20 01:36:15,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:36:15,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3222 transitions. [2019-11-20 01:36:15,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2019-11-20 01:36:15,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:36:15,983 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:36:16,187 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:36:16,188 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:36:16,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:36:16,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1129963505, now seen corresponding path program 1 times [2019-11-20 01:36:16,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:36:16,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763491657] [2019-11-20 01:36:16,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:36:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 797 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-11-20 01:36:17,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763491657] [2019-11-20 01:36:17,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:36:17,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 01:36:17,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163948106] [2019-11-20 01:36:17,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:36:17,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:36:17,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:36:17,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:36:17,286 INFO L87 Difference]: Start difference. First operand 2852 states and 3222 transitions. Second operand 8 states. [2019-11-20 01:36:18,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:36:18,482 INFO L93 Difference]: Finished difference Result 5530 states and 6269 transitions. [2019-11-20 01:36:18,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 01:36:18,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 574 [2019-11-20 01:36:18,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:36:18,501 INFO L225 Difference]: With dead ends: 5530 [2019-11-20 01:36:18,501 INFO L226 Difference]: Without dead ends: 2858 [2019-11-20 01:36:18,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:36:18,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2019-11-20 01:36:18,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2852. [2019-11-20 01:36:18,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-11-20 01:36:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3214 transitions. [2019-11-20 01:36:18,559 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3214 transitions. Word has length 574 [2019-11-20 01:36:18,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:36:18,560 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 3214 transitions. [2019-11-20 01:36:18,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:36:18,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3214 transitions. [2019-11-20 01:36:18,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2019-11-20 01:36:18,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:36:18,577 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:36:18,578 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:36:18,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:36:18,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1958858224, now seen corresponding path program 1 times [2019-11-20 01:36:18,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:36:18,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87500778] [2019-11-20 01:36:18,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:36:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:19,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 578 proven. 260 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2019-11-20 01:36:19,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87500778] [2019-11-20 01:36:19,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592889026] [2019-11-20 01:36:19,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/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-11-20 01:36:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:19,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:36:19,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:36:20,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2019-11-20 01:36:20,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 01:36:20,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-20 01:36:20,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991252769] [2019-11-20 01:36:20,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:36:20,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:36:20,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:36:20,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-20 01:36:20,381 INFO L87 Difference]: Start difference. First operand 2852 states and 3214 transitions. Second operand 4 states. [2019-11-20 01:36:21,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:36:21,177 INFO L93 Difference]: Finished difference Result 7304 states and 8336 transitions. [2019-11-20 01:36:21,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:36:21,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 600 [2019-11-20 01:36:21,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:36:21,198 INFO L225 Difference]: With dead ends: 7304 [2019-11-20 01:36:21,198 INFO L226 Difference]: Without dead ends: 4632 [2019-11-20 01:36:21,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 599 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-20 01:36:21,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2019-11-20 01:36:21,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4632. [2019-11-20 01:36:21,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-20 01:36:21,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 5055 transitions. [2019-11-20 01:36:21,282 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 5055 transitions. Word has length 600 [2019-11-20 01:36:21,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:36:21,283 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 5055 transitions. [2019-11-20 01:36:21,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:36:21,283 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 5055 transitions. [2019-11-20 01:36:21,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2019-11-20 01:36:21,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:36:21,290 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:36:21,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:36:21,496 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:36:21,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:36:21,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1310836641, now seen corresponding path program 1 times [2019-11-20 01:36:21,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:36:21,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228989008] [2019-11-20 01:36:21,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:36:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1316 backedges. 892 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-20 01:36:22,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228989008] [2019-11-20 01:36:22,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678323530] [2019-11-20 01:36:22,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/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-11-20 01:36:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:22,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:36:22,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:36:22,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1316 backedges. 892 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-20 01:36:22,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:36:22,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-11-20 01:36:22,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894735965] [2019-11-20 01:36:22,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 01:36:22,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:36:22,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:36:22,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:36:22,610 INFO L87 Difference]: Start difference. First operand 4632 states and 5055 transitions. Second operand 5 states. [2019-11-20 01:36:24,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:36:24,160 INFO L93 Difference]: Finished difference Result 11398 states and 12490 transitions. [2019-11-20 01:36:24,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:36:24,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 641 [2019-11-20 01:36:24,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:36:24,190 INFO L225 Difference]: With dead ends: 11398 [2019-11-20 01:36:24,190 INFO L226 Difference]: Without dead ends: 6946 [2019-11-20 01:36:24,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:36:24,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2019-11-20 01:36:24,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 5878. [2019-11-20 01:36:24,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5878 states. [2019-11-20 01:36:24,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5878 states to 5878 states and 6406 transitions. [2019-11-20 01:36:24,279 INFO L78 Accepts]: Start accepts. Automaton has 5878 states and 6406 transitions. Word has length 641 [2019-11-20 01:36:24,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:36:24,281 INFO L462 AbstractCegarLoop]: Abstraction has 5878 states and 6406 transitions. [2019-11-20 01:36:24,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 01:36:24,281 INFO L276 IsEmpty]: Start isEmpty. Operand 5878 states and 6406 transitions. [2019-11-20 01:36:24,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2019-11-20 01:36:24,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:36:24,288 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:36:24,492 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:36:24,492 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:36:24,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:36:24,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1502121497, now seen corresponding path program 1 times [2019-11-20 01:36:24,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:36:24,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876933506] [2019-11-20 01:36:24,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:36:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:25,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 1095 proven. 260 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-11-20 01:36:25,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876933506] [2019-11-20 01:36:25,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139259658] [2019-11-20 01:36:25,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/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-11-20 01:36:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:25,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:36:25,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:36:26,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 1146 proven. 0 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-11-20 01:36:26,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 01:36:26,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-11-20 01:36:26,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553618455] [2019-11-20 01:36:26,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:36:26,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:36:26,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:36:26,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:36:26,231 INFO L87 Difference]: Start difference. First operand 5878 states and 6406 transitions. Second operand 3 states. [2019-11-20 01:36:26,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:36:26,778 INFO L93 Difference]: Finished difference Result 11754 states and 12811 transitions. [2019-11-20 01:36:26,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:36:26,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 651 [2019-11-20 01:36:26,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:36:26,789 INFO L225 Difference]: With dead ends: 11754 [2019-11-20 01:36:26,789 INFO L226 Difference]: Without dead ends: 6056 [2019-11-20 01:36:26,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 652 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:36:26,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2019-11-20 01:36:26,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 5700. [2019-11-20 01:36:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5700 states. [2019-11-20 01:36:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 6162 transitions. [2019-11-20 01:36:26,853 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 6162 transitions. Word has length 651 [2019-11-20 01:36:26,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:36:26,854 INFO L462 AbstractCegarLoop]: Abstraction has 5700 states and 6162 transitions. [2019-11-20 01:36:26,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:36:26,854 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 6162 transitions. [2019-11-20 01:36:26,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2019-11-20 01:36:26,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:36:26,861 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:36:27,064 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:36:27,064 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:36:27,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:36:27,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1331694009, now seen corresponding path program 1 times [2019-11-20 01:36:27,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:36:27,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792932898] [2019-11-20 01:36:27,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:36:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 708 proven. 325 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2019-11-20 01:36:28,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792932898] [2019-11-20 01:36:28,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763075166] [2019-11-20 01:36:28,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/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-11-20 01:36:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:28,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:36:28,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:36:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 643 proven. 0 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2019-11-20 01:36:28,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 01:36:28,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-20 01:36:28,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931085363] [2019-11-20 01:36:28,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:36:28,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:36:28,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:36:28,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-20 01:36:28,967 INFO L87 Difference]: Start difference. First operand 5700 states and 6162 transitions. Second operand 4 states. [2019-11-20 01:36:29,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:36:29,721 INFO L93 Difference]: Finished difference Result 11398 states and 12323 transitions. [2019-11-20 01:36:29,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:36:29,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 695 [2019-11-20 01:36:29,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:36:29,731 INFO L225 Difference]: With dead ends: 11398 [2019-11-20 01:36:29,731 INFO L226 Difference]: Without dead ends: 5878 [2019-11-20 01:36:29,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 694 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-20 01:36:29,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2019-11-20 01:36:29,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5522. [2019-11-20 01:36:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5522 states. [2019-11-20 01:36:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 5956 transitions. [2019-11-20 01:36:29,810 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 5956 transitions. Word has length 695 [2019-11-20 01:36:29,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:36:29,811 INFO L462 AbstractCegarLoop]: Abstraction has 5522 states and 5956 transitions. [2019-11-20 01:36:29,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:36:29,811 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 5956 transitions. [2019-11-20 01:36:29,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2019-11-20 01:36:29,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:36:29,819 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:36:30,031 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:36:30,031 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:36:30,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:36:30,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1867062169, now seen corresponding path program 1 times [2019-11-20 01:36:30,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:36:30,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800884703] [2019-11-20 01:36:30,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:36:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:30,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1758 backedges. 1071 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2019-11-20 01:36:30,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800884703] [2019-11-20 01:36:30,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:36:30,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:36:30,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151590399] [2019-11-20 01:36:30,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:36:30,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:36:30,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:36:30,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:36:30,707 INFO L87 Difference]: Start difference. First operand 5522 states and 5956 transitions. Second operand 4 states. [2019-11-20 01:36:31,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:36:31,433 INFO L93 Difference]: Finished difference Result 11754 states and 12725 transitions. [2019-11-20 01:36:31,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:36:31,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 758 [2019-11-20 01:36:31,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:36:31,443 INFO L225 Difference]: With dead ends: 11754 [2019-11-20 01:36:31,444 INFO L226 Difference]: Without dead ends: 6412 [2019-11-20 01:36:31,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:36:31,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2019-11-20 01:36:31,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 5344. [2019-11-20 01:36:31,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2019-11-20 01:36:31,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5708 transitions. [2019-11-20 01:36:31,515 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5708 transitions. Word has length 758 [2019-11-20 01:36:31,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:36:31,516 INFO L462 AbstractCegarLoop]: Abstraction has 5344 states and 5708 transitions. [2019-11-20 01:36:31,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:36:31,516 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5708 transitions. [2019-11-20 01:36:31,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 809 [2019-11-20 01:36:31,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:36:31,525 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:36:31,525 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:36:31,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:36:31,525 INFO L82 PathProgramCache]: Analyzing trace with hash -540711606, now seen corresponding path program 1 times [2019-11-20 01:36:31,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:36:31,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589250849] [2019-11-20 01:36:31,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:36:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 1215 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2019-11-20 01:36:32,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589250849] [2019-11-20 01:36:32,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707055779] [2019-11-20 01:36:32,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/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-11-20 01:36:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:32,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 1006 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 01:36:32,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:36:32,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:32,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:32,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:32,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 928 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2019-11-20 01:36:33,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 01:36:33,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2019-11-20 01:36:33,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959698672] [2019-11-20 01:36:33,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:36:33,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:36:33,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:36:33,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:36:33,415 INFO L87 Difference]: Start difference. First operand 5344 states and 5708 transitions. Second operand 4 states. [2019-11-20 01:36:34,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:36:34,697 INFO L93 Difference]: Finished difference Result 11932 states and 12761 transitions. [2019-11-20 01:36:34,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:36:34,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 808 [2019-11-20 01:36:34,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:36:34,707 INFO L225 Difference]: With dead ends: 11932 [2019-11-20 01:36:34,708 INFO L226 Difference]: Without dead ends: 6768 [2019-11-20 01:36:34,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 813 GetRequests, 807 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:36:34,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6768 states. [2019-11-20 01:36:34,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6768 to 6056. [2019-11-20 01:36:34,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6056 states. [2019-11-20 01:36:34,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 6465 transitions. [2019-11-20 01:36:34,788 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 6465 transitions. Word has length 808 [2019-11-20 01:36:34,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:36:34,789 INFO L462 AbstractCegarLoop]: Abstraction has 6056 states and 6465 transitions. [2019-11-20 01:36:34,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:36:34,789 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 6465 transitions. [2019-11-20 01:36:34,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2019-11-20 01:36:34,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:36:34,798 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:36:35,001 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:36:35,001 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:36:35,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:36:35,002 INFO L82 PathProgramCache]: Analyzing trace with hash -172725225, now seen corresponding path program 1 times [2019-11-20 01:36:35,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:36:35,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666268487] [2019-11-20 01:36:35,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:36:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1954 backedges. 632 proven. 619 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-11-20 01:36:36,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666268487] [2019-11-20 01:36:36,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303197307] [2019-11-20 01:36:36,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/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-11-20 01:36:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:36,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:36:36,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:36:36,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1954 backedges. 839 proven. 0 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2019-11-20 01:36:36,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 01:36:36,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2019-11-20 01:36:36,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796318824] [2019-11-20 01:36:36,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:36:36,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:36:36,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:36:36,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-20 01:36:36,590 INFO L87 Difference]: Start difference. First operand 6056 states and 6465 transitions. Second operand 3 states. [2019-11-20 01:36:37,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:36:37,191 INFO L93 Difference]: Finished difference Result 12288 states and 13155 transitions. [2019-11-20 01:36:37,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:36:37,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 810 [2019-11-20 01:36:37,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:36:37,198 INFO L225 Difference]: With dead ends: 12288 [2019-11-20 01:36:37,199 INFO L226 Difference]: Without dead ends: 6412 [2019-11-20 01:36:37,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 824 GetRequests, 811 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-20 01:36:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2019-11-20 01:36:37,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 5700. [2019-11-20 01:36:37,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5700 states. [2019-11-20 01:36:37,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 6060 transitions. [2019-11-20 01:36:37,275 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 6060 transitions. Word has length 810 [2019-11-20 01:36:37,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:36:37,276 INFO L462 AbstractCegarLoop]: Abstraction has 5700 states and 6060 transitions. [2019-11-20 01:36:37,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:36:37,276 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 6060 transitions. [2019-11-20 01:36:37,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2019-11-20 01:36:37,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:36:37,285 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:36:37,492 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:36:37,492 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:36:37,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:36:37,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2108387026, now seen corresponding path program 1 times [2019-11-20 01:36:37,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:36:37,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028301272] [2019-11-20 01:36:37,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:36:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:38,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2267 backedges. 1251 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2019-11-20 01:36:38,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028301272] [2019-11-20 01:36:38,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737431828] [2019-11-20 01:36:38,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/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-11-20 01:36:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:38,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 01:36:38,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:36:38,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:38,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:38,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:38,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:39,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2267 backedges. 964 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2019-11-20 01:36:39,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 01:36:39,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2019-11-20 01:36:39,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649143033] [2019-11-20 01:36:39,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:36:39,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:36:39,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:36:39,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:36:39,462 INFO L87 Difference]: Start difference. First operand 5700 states and 6060 transitions. Second operand 4 states. [2019-11-20 01:36:41,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:36:41,413 INFO L93 Difference]: Finished difference Result 12466 states and 13239 transitions. [2019-11-20 01:36:41,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:36:41,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 841 [2019-11-20 01:36:41,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:36:41,418 INFO L225 Difference]: With dead ends: 12466 [2019-11-20 01:36:41,419 INFO L226 Difference]: Without dead ends: 6946 [2019-11-20 01:36:41,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 846 GetRequests, 840 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:36:41,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2019-11-20 01:36:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 5700. [2019-11-20 01:36:41,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5700 states. [2019-11-20 01:36:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 6060 transitions. [2019-11-20 01:36:41,487 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 6060 transitions. Word has length 841 [2019-11-20 01:36:41,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:36:41,488 INFO L462 AbstractCegarLoop]: Abstraction has 5700 states and 6060 transitions. [2019-11-20 01:36:41,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:36:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 6060 transitions. [2019-11-20 01:36:41,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2019-11-20 01:36:41,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:36:41,497 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:36:41,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:36:41,701 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:36:41,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:36:41,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1692043947, now seen corresponding path program 1 times [2019-11-20 01:36:41,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:36:41,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096715006] [2019-11-20 01:36:41,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:36:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:42,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2268 backedges. 1252 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2019-11-20 01:36:42,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096715006] [2019-11-20 01:36:42,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815253300] [2019-11-20 01:36:42,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/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-11-20 01:36:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:42,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 01:36:42,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:36:42,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:42,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:43,185 WARN L191 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 33 [2019-11-20 01:36:44,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2268 backedges. 1340 proven. 537 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-11-20 01:36:44,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:36:44,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-20 01:36:44,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955208072] [2019-11-20 01:36:44,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:36:44,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:36:44,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:36:44,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:36:44,240 INFO L87 Difference]: Start difference. First operand 5700 states and 6060 transitions. Second operand 8 states. [2019-11-20 01:36:47,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:36:47,498 INFO L93 Difference]: Finished difference Result 14602 states and 15496 transitions. [2019-11-20 01:36:47,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 01:36:47,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 842 [2019-11-20 01:36:47,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:36:47,504 INFO L225 Difference]: With dead ends: 14602 [2019-11-20 01:36:47,504 INFO L226 Difference]: Without dead ends: 9082 [2019-11-20 01:36:47,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 841 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:36:47,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9082 states. [2019-11-20 01:36:47,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9082 to 6768. [2019-11-20 01:36:47,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6768 states. [2019-11-20 01:36:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6768 states to 6768 states and 7166 transitions. [2019-11-20 01:36:47,588 INFO L78 Accepts]: Start accepts. Automaton has 6768 states and 7166 transitions. Word has length 842 [2019-11-20 01:36:47,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:36:47,589 INFO L462 AbstractCegarLoop]: Abstraction has 6768 states and 7166 transitions. [2019-11-20 01:36:47,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:36:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 6768 states and 7166 transitions. [2019-11-20 01:36:47,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 928 [2019-11-20 01:36:47,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:36:47,598 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:36:47,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:36:47,802 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:36:47,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:36:47,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2126525007, now seen corresponding path program 1 times [2019-11-20 01:36:47,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:36:47,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459157175] [2019-11-20 01:36:47,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:36:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2513 backedges. 219 proven. 1067 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2019-11-20 01:36:49,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459157175] [2019-11-20 01:36:49,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389516878] [2019-11-20 01:36:49,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/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-11-20 01:36:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:36:49,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 01:36:49,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:36:49,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:49,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,515 WARN L191 SmtUtils]: Spent 7.03 s on a formula simplification. DAG size of input: 131 DAG size of output: 29 [2019-11-20 01:36:57,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:57,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:36:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2513 backedges. 629 proven. 769 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2019-11-20 01:36:59,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:36:59,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-11-20 01:36:59,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570681851] [2019-11-20 01:36:59,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 01:36:59,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:36:59,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 01:36:59,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-11-20 01:36:59,980 INFO L87 Difference]: Start difference. First operand 6768 states and 7166 transitions. Second operand 16 states. [2019-11-20 01:37:00,819 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 01:37:54,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:37:54,378 INFO L93 Difference]: Finished difference Result 16967 states and 18015 transitions. [2019-11-20 01:37:54,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-20 01:37:54,378 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 927 [2019-11-20 01:37:54,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:37:54,386 INFO L225 Difference]: With dead ends: 16967 [2019-11-20 01:37:54,386 INFO L226 Difference]: Without dead ends: 10379 [2019-11-20 01:37:54,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 951 GetRequests, 922 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2019-11-20 01:37:54,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10379 states. [2019-11-20 01:37:54,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10379 to 7480. [2019-11-20 01:37:54,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7480 states. [2019-11-20 01:37:54,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7480 states to 7480 states and 7971 transitions. [2019-11-20 01:37:54,489 INFO L78 Accepts]: Start accepts. Automaton has 7480 states and 7971 transitions. Word has length 927 [2019-11-20 01:37:54,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:37:54,490 INFO L462 AbstractCegarLoop]: Abstraction has 7480 states and 7971 transitions. [2019-11-20 01:37:54,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 01:37:54,490 INFO L276 IsEmpty]: Start isEmpty. Operand 7480 states and 7971 transitions. [2019-11-20 01:37:54,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1035 [2019-11-20 01:37:54,503 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:37:54,504 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:37:54,708 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:37:54,708 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:37:54,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:37:54,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1713888931, now seen corresponding path program 1 times [2019-11-20 01:37:54,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:37:54,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590320219] [2019-11-20 01:37:54,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:37:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:37:55,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3787 backedges. 1197 proven. 0 refuted. 0 times theorem prover too weak. 2590 trivial. 0 not checked. [2019-11-20 01:37:55,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590320219] [2019-11-20 01:37:55,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:37:55,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 01:37:55,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561863510] [2019-11-20 01:37:55,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:37:55,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:37:55,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:37:55,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:37:55,940 INFO L87 Difference]: Start difference. First operand 7480 states and 7971 transitions. Second operand 6 states. [2019-11-20 01:37:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:37:56,614 INFO L93 Difference]: Finished difference Result 14824 states and 15792 transitions. [2019-11-20 01:37:56,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:37:56,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1034 [2019-11-20 01:37:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:37:56,621 INFO L225 Difference]: With dead ends: 14824 [2019-11-20 01:37:56,621 INFO L226 Difference]: Without dead ends: 7302 [2019-11-20 01:37:56,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:37:56,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7302 states. [2019-11-20 01:37:56,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7302 to 7124. [2019-11-20 01:37:56,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7124 states. [2019-11-20 01:37:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7124 states to 7124 states and 7589 transitions. [2019-11-20 01:37:56,702 INFO L78 Accepts]: Start accepts. Automaton has 7124 states and 7589 transitions. Word has length 1034 [2019-11-20 01:37:56,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:37:56,703 INFO L462 AbstractCegarLoop]: Abstraction has 7124 states and 7589 transitions. [2019-11-20 01:37:56,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:37:56,704 INFO L276 IsEmpty]: Start isEmpty. Operand 7124 states and 7589 transitions. [2019-11-20 01:37:56,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1042 [2019-11-20 01:37:56,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:37:56,718 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:37:56,718 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:37:56,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:37:56,718 INFO L82 PathProgramCache]: Analyzing trace with hash 643265044, now seen corresponding path program 1 times [2019-11-20 01:37:56,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:37:56,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841018258] [2019-11-20 01:37:56,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:37:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:37:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3829 backedges. 1839 proven. 0 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-11-20 01:37:57,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841018258] [2019-11-20 01:37:57,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:37:57,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 01:37:57,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454474456] [2019-11-20 01:37:57,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 01:37:57,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:37:57,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 01:37:57,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:37:57,944 INFO L87 Difference]: Start difference. First operand 7124 states and 7589 transitions. Second operand 7 states. [2019-11-20 01:37:58,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:37:58,566 INFO L93 Difference]: Finished difference Result 14346 states and 15273 transitions. [2019-11-20 01:37:58,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 01:37:58,567 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1041 [2019-11-20 01:37:58,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:37:58,572 INFO L225 Difference]: With dead ends: 14346 [2019-11-20 01:37:58,572 INFO L226 Difference]: Without dead ends: 7174 [2019-11-20 01:37:58,575 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:37:58,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7174 states. [2019-11-20 01:37:58,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7174 to 6996. [2019-11-20 01:37:58,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6996 states. [2019-11-20 01:37:58,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6996 states to 6996 states and 7405 transitions. [2019-11-20 01:37:58,655 INFO L78 Accepts]: Start accepts. Automaton has 6996 states and 7405 transitions. Word has length 1041 [2019-11-20 01:37:58,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:37:58,656 INFO L462 AbstractCegarLoop]: Abstraction has 6996 states and 7405 transitions. [2019-11-20 01:37:58,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 01:37:58,656 INFO L276 IsEmpty]: Start isEmpty. Operand 6996 states and 7405 transitions. [2019-11-20 01:37:58,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1057 [2019-11-20 01:37:58,666 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:37:58,667 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:37:58,667 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:37:58,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:37:58,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1886227147, now seen corresponding path program 1 times [2019-11-20 01:37:58,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:37:58,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084886845] [2019-11-20 01:37:58,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:37:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:38:00,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3342 backedges. 27 proven. 854 refuted. 0 times theorem prover too weak. 2461 trivial. 0 not checked. [2019-11-20 01:38:00,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084886845] [2019-11-20 01:38:00,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793977823] [2019-11-20 01:38:00,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/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-11-20 01:38:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:38:00,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 01:38:00,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:38:00,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:00,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:38:02,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3342 backedges. 482 proven. 399 refuted. 0 times theorem prover too weak. 2461 trivial. 0 not checked. [2019-11-20 01:38:02,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:38:02,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-11-20 01:38:02,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886310089] [2019-11-20 01:38:02,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:38:02,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:38:02,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:38:02,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:38:02,296 INFO L87 Difference]: Start difference. First operand 6996 states and 7405 transitions. Second operand 10 states. [2019-11-20 01:38:07,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:38:07,256 INFO L93 Difference]: Finished difference Result 17344 states and 18387 transitions. [2019-11-20 01:38:07,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-20 01:38:07,256 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1056 [2019-11-20 01:38:07,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:38:07,265 INFO L225 Difference]: With dead ends: 17344 [2019-11-20 01:38:07,265 INFO L226 Difference]: Without dead ends: 10022 [2019-11-20 01:38:07,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1083 GetRequests, 1053 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=232, Invalid=524, Unknown=0, NotChecked=0, Total=756 [2019-11-20 01:38:07,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10022 states. [2019-11-20 01:38:07,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10022 to 6996. [2019-11-20 01:38:07,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6996 states. [2019-11-20 01:38:07,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6996 states to 6996 states and 7374 transitions. [2019-11-20 01:38:07,371 INFO L78 Accepts]: Start accepts. Automaton has 6996 states and 7374 transitions. Word has length 1056 [2019-11-20 01:38:07,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:38:07,372 INFO L462 AbstractCegarLoop]: Abstraction has 6996 states and 7374 transitions. [2019-11-20 01:38:07,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:38:07,372 INFO L276 IsEmpty]: Start isEmpty. Operand 6996 states and 7374 transitions. [2019-11-20 01:38:07,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2108 [2019-11-20 01:38:07,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:38:07,399 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:38:07,603 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:38:07,604 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:38:07,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:38:07,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1766247281, now seen corresponding path program 1 times [2019-11-20 01:38:07,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:38:07,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17070853] [2019-11-20 01:38:07,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:38:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:38:10,836 INFO L134 CoverageAnalysis]: Checked inductivity of 14410 backedges. 3163 proven. 0 refuted. 0 times theorem prover too weak. 11247 trivial. 0 not checked. [2019-11-20 01:38:10,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17070853] [2019-11-20 01:38:10,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:38:10,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 01:38:10,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781859866] [2019-11-20 01:38:10,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 01:38:10,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:38:10,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 01:38:10,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:38:10,838 INFO L87 Difference]: Start difference. First operand 6996 states and 7374 transitions. Second operand 7 states. [2019-11-20 01:38:11,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:38:11,542 INFO L93 Difference]: Finished difference Result 13822 states and 14550 transitions. [2019-11-20 01:38:11,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 01:38:11,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 2107 [2019-11-20 01:38:11,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:38:11,548 INFO L225 Difference]: With dead ends: 13822 [2019-11-20 01:38:11,548 INFO L226 Difference]: Without dead ends: 6640 [2019-11-20 01:38:11,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:38:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6640 states. [2019-11-20 01:38:11,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6640 to 6640. [2019-11-20 01:38:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6640 states. [2019-11-20 01:38:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6640 states to 6640 states and 6970 transitions. [2019-11-20 01:38:11,628 INFO L78 Accepts]: Start accepts. Automaton has 6640 states and 6970 transitions. Word has length 2107 [2019-11-20 01:38:11,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:38:11,630 INFO L462 AbstractCegarLoop]: Abstraction has 6640 states and 6970 transitions. [2019-11-20 01:38:11,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 01:38:11,630 INFO L276 IsEmpty]: Start isEmpty. Operand 6640 states and 6970 transitions. [2019-11-20 01:38:11,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2142 [2019-11-20 01:38:11,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:38:11,659 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 12, 12, 12, 11, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:38:11,659 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:38:11,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:38:11,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1393034536, now seen corresponding path program 1 times [2019-11-20 01:38:11,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:38:11,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20904540] [2019-11-20 01:38:11,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:38:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:38:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 14857 backedges. 3538 proven. 0 refuted. 0 times theorem prover too weak. 11319 trivial. 0 not checked. [2019-11-20 01:38:14,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20904540] [2019-11-20 01:38:14,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:38:14,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:38:14,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582520302] [2019-11-20 01:38:14,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:38:14,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:38:14,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:38:14,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:38:14,508 INFO L87 Difference]: Start difference. First operand 6640 states and 6970 transitions. Second operand 4 states. [2019-11-20 01:38:15,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:38:15,276 INFO L93 Difference]: Finished difference Result 14524 states and 15183 transitions. [2019-11-20 01:38:15,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:38:15,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2141 [2019-11-20 01:38:15,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:38:15,281 INFO L225 Difference]: With dead ends: 14524 [2019-11-20 01:38:15,281 INFO L226 Difference]: Without dead ends: 5216 [2019-11-20 01:38:15,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:38:15,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5216 states. [2019-11-20 01:38:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5216 to 5216. [2019-11-20 01:38:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5216 states. [2019-11-20 01:38:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5216 states to 5216 states and 5322 transitions. [2019-11-20 01:38:15,337 INFO L78 Accepts]: Start accepts. Automaton has 5216 states and 5322 transitions. Word has length 2141 [2019-11-20 01:38:15,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:38:15,338 INFO L462 AbstractCegarLoop]: Abstraction has 5216 states and 5322 transitions. [2019-11-20 01:38:15,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:38:15,338 INFO L276 IsEmpty]: Start isEmpty. Operand 5216 states and 5322 transitions. [2019-11-20 01:38:15,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2202 [2019-11-20 01:38:15,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:38:15,366 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:38:15,366 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:38:15,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:38:15,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1047725754, now seen corresponding path program 1 times [2019-11-20 01:38:15,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:38:15,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83122724] [2019-11-20 01:38:15,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:38:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:38:19,884 INFO L134 CoverageAnalysis]: Checked inductivity of 15097 backedges. 3815 proven. 38 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2019-11-20 01:38:19,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83122724] [2019-11-20 01:38:19,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001959529] [2019-11-20 01:38:19,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:38:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:38:20,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 2621 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 01:38:20,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:38:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 15097 backedges. 3787 proven. 66 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2019-11-20 01:38:23,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:38:23,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-11-20 01:38:23,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194188521] [2019-11-20 01:38:23,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:38:23,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:38:23,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:38:23,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:38:23,625 INFO L87 Difference]: Start difference. First operand 5216 states and 5322 transitions. Second operand 12 states. [2019-11-20 01:38:26,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:38:26,575 INFO L93 Difference]: Finished difference Result 10015 states and 10226 transitions. [2019-11-20 01:38:26,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 01:38:26,575 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 2201 [2019-11-20 01:38:26,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:38:26,577 INFO L225 Difference]: With dead ends: 10015 [2019-11-20 01:38:26,577 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 01:38:26,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2222 GetRequests, 2205 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2019-11-20 01:38:26,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 01:38:26,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 01:38:26,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 01:38:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 01:38:26,582 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2201 [2019-11-20 01:38:26,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:38:26,583 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 01:38:26,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:38:26,583 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 01:38:26,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 01:38:26,787 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:38:26,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 01:38:27,491 WARN L191 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 503 DAG size of output: 400 [2019-11-20 01:38:28,148 WARN L191 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 503 DAG size of output: 400 [2019-11-20 01:38:31,482 WARN L191 SmtUtils]: Spent 3.33 s on a formula simplification. DAG size of input: 388 DAG size of output: 100 [2019-11-20 01:38:34,545 WARN L191 SmtUtils]: Spent 3.06 s on a formula simplification. DAG size of input: 388 DAG size of output: 100 [2019-11-20 01:38:34,548 INFO L444 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-11-20 01:38:34,549 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-11-20 01:38:34,549 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,549 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,549 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,549 INFO L444 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-11-20 01:38:34,549 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-20 01:38:34,549 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-20 01:38:34,549 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-20 01:38:34,549 INFO L444 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-11-20 01:38:34,549 INFO L444 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-11-20 01:38:34,549 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-11-20 01:38:34,549 INFO L444 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-11-20 01:38:34,549 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,549 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,550 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,550 INFO L444 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-11-20 01:38:34,550 INFO L444 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-11-20 01:38:34,550 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-20 01:38:34,550 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-20 01:38:34,550 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-20 01:38:34,550 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-11-20 01:38:34,550 INFO L444 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-11-20 01:38:34,550 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-11-20 01:38:34,550 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,550 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,550 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,550 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-11-20 01:38:34,550 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-20 01:38:34,550 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-20 01:38:34,551 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-20 01:38:34,551 INFO L444 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-11-20 01:38:34,551 INFO L444 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-11-20 01:38:34,551 INFO L444 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-11-20 01:38:34,551 INFO L444 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-11-20 01:38:34,551 INFO L444 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-11-20 01:38:34,551 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,551 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,551 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,551 INFO L444 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-11-20 01:38:34,551 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-20 01:38:34,551 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-20 01:38:34,552 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-20 01:38:34,552 INFO L444 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-11-20 01:38:34,552 INFO L444 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-11-20 01:38:34,552 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-11-20 01:38:34,552 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,552 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,552 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,552 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-11-20 01:38:34,552 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-20 01:38:34,552 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-20 01:38:34,552 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-20 01:38:34,552 INFO L444 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-11-20 01:38:34,552 INFO L444 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-11-20 01:38:34,552 INFO L444 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-11-20 01:38:34,552 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-11-20 01:38:34,553 INFO L444 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-11-20 01:38:34,553 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,553 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,553 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,553 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-11-20 01:38:34,553 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-20 01:38:34,553 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-20 01:38:34,553 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-20 01:38:34,553 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-11-20 01:38:34,553 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-11-20 01:38:34,553 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-11-20 01:38:34,553 INFO L444 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-11-20 01:38:34,553 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,553 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,553 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,553 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-20 01:38:34,554 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-20 01:38:34,554 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-20 01:38:34,554 INFO L444 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-11-20 01:38:34,554 INFO L444 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-11-20 01:38:34,554 INFO L444 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-11-20 01:38:34,554 INFO L444 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-11-20 01:38:34,554 INFO L444 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-11-20 01:38:34,554 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,554 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,554 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,554 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-11-20 01:38:34,554 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-11-20 01:38:34,554 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 01:38:34,554 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-20 01:38:34,554 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-20 01:38:34,554 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-20 01:38:34,554 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-11-20 01:38:34,554 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-11-20 01:38:34,554 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-11-20 01:38:34,554 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,554 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,555 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,555 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-20 01:38:34,555 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-20 01:38:34,555 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-20 01:38:34,555 INFO L444 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-11-20 01:38:34,555 INFO L444 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-11-20 01:38:34,555 INFO L444 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-11-20 01:38:34,555 INFO L444 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-11-20 01:38:34,555 INFO L444 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-11-20 01:38:34,555 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,555 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,555 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,555 INFO L444 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-11-20 01:38:34,555 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-11-20 01:38:34,555 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-20 01:38:34,555 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-20 01:38:34,555 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-20 01:38:34,555 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-11-20 01:38:34,555 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 01:38:34,556 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2019-11-20 01:38:34,556 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-11-20 01:38:34,556 INFO L444 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-11-20 01:38:34,556 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,556 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,556 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,556 INFO L444 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-20 01:38:34,556 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-20 01:38:34,556 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-20 01:38:34,556 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-20 01:38:34,556 INFO L444 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-11-20 01:38:34,557 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-11-20 01:38:34,557 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-11-20 01:38:34,557 INFO L444 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-11-20 01:38:34,557 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,557 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,557 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,557 INFO L444 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-11-20 01:38:34,557 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-20 01:38:34,557 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-20 01:38:34,557 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-20 01:38:34,557 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-11-20 01:38:34,558 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-11-20 01:38:34,558 INFO L444 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-11-20 01:38:34,558 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-11-20 01:38:34,558 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,558 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,558 INFO L444 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-11-20 01:38:34,558 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-20 01:38:34,558 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-20 01:38:34,559 INFO L444 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-11-20 01:38:34,559 INFO L444 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-11-20 01:38:34,559 INFO L444 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-11-20 01:38:34,559 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-11-20 01:38:34,559 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-11-20 01:38:34,559 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,559 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,560 INFO L444 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-11-20 01:38:34,560 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-20 01:38:34,560 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-20 01:38:34,560 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-11-20 01:38:34,560 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-11-20 01:38:34,560 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-11-20 01:38:34,560 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,561 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,561 INFO L440 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse18 (+ ~a12~0 43))) (let ((.cse17 (<= .cse18 0)) (.cse2 (<= ~a15~0 8)) (.cse8 (<= ~a21~0 9)) (.cse10 (= 8 ~a21~0)) (.cse3 (= ~a24~0 1)) (.cse12 (not (= 5 ~a15~0)))) (let ((.cse11 (= ~a21~0 6)) (.cse5 (< 80 ~a12~0)) (.cse1 (and .cse10 .cse3 .cse12)) (.cse9 (< 0 .cse18)) (.cse4 (= ~a15~0 9)) (.cse7 (<= ~a12~0 11)) (.cse6 (= ~a21~0 7)) (.cse0 (exists ((v_~a12~0_448 Int)) (and (<= 0 v_~a12~0_448) (< 80 v_~a12~0_448) (<= ~a12~0 (+ (mod v_~a12~0_448 299959) 300039))))) (.cse13 (not (= ~a15~0 8))) (.cse15 (and (or (and (not (= ~a21~0 9)) .cse17) (and .cse17 .cse12) (<= (+ ~a12~0 49) 0)) .cse2 .cse8)) (.cse14 (<= (+ ~a12~0 45156) 0)) (.cse16 (= ~a21~0 10))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse3 .cse6 .cse7 .cse2) (and .cse3 (and (and (<= ~a12~0 80) .cse8 (not .cse6) (not (= 6 ~a21~0))) .cse9) .cse2) (and (<= ~a12~0 75) .cse10 .cse3 .cse4) (and (and .cse11 (and .cse3 .cse12) .cse2) .cse13) (and .cse14 (and .cse15 (<= ~a21~0 6)) .cse13) (and .cse11 .cse5 (and .cse3 .cse2) .cse0) (and .cse1 .cse13 .cse2) (and (and (and .cse3 .cse7 .cse12) .cse9) .cse13 .cse2) (or (and .cse0 .cse3 .cse16 .cse2 .cse12 .cse9) (and .cse3 .cse16 .cse2 (<= ~a12~0 73281) .cse9)) (and .cse3 .cse16 .cse4 .cse7) (and .cse13 (and .cse3 .cse6 .cse2)) (and .cse0 .cse3 .cse13 .cse2 .cse12 .cse8) (and (= ~a15~0 7) .cse3 .cse16) (and .cse3 (or (or (and (= 8 ~a15~0) (and .cse17 (= 10 ~a21~0))) .cse15) (and .cse14 .cse16 .cse2 .cse12))))))) [2019-11-20 01:38:34,561 INFO L444 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-11-20 01:38:34,561 INFO L444 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-11-20 01:38:34,562 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-20 01:38:34,562 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-20 01:38:34,562 INFO L444 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-11-20 01:38:34,562 INFO L444 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-11-20 01:38:34,562 INFO L444 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-11-20 01:38:34,562 INFO L444 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-11-20 01:38:34,562 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,562 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,562 INFO L447 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-11-20 01:38:34,562 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-11-20 01:38:34,562 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-11-20 01:38:34,563 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-20 01:38:34,563 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-20 01:38:34,563 INFO L444 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-11-20 01:38:34,563 INFO L444 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-11-20 01:38:34,563 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-11-20 01:38:34,563 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,563 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,563 INFO L444 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-11-20 01:38:34,564 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-11-20 01:38:34,564 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-20 01:38:34,564 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-20 01:38:34,564 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 01:38:34,564 INFO L444 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-11-20 01:38:34,564 INFO L444 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-11-20 01:38:34,564 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,564 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,564 INFO L444 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-20 01:38:34,564 INFO L444 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,564 INFO L444 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-11-20 01:38:34,565 INFO L440 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse18 (+ ~a12~0 43))) (let ((.cse17 (<= .cse18 0)) (.cse2 (<= ~a15~0 8)) (.cse8 (<= ~a21~0 9)) (.cse10 (= 8 ~a21~0)) (.cse3 (= ~a24~0 1)) (.cse12 (not (= 5 ~a15~0)))) (let ((.cse11 (= ~a21~0 6)) (.cse5 (< 80 ~a12~0)) (.cse1 (and .cse10 .cse3 .cse12)) (.cse9 (< 0 .cse18)) (.cse4 (= ~a15~0 9)) (.cse7 (<= ~a12~0 11)) (.cse6 (= ~a21~0 7)) (.cse0 (exists ((v_~a12~0_448 Int)) (and (<= 0 v_~a12~0_448) (< 80 v_~a12~0_448) (<= ~a12~0 (+ (mod v_~a12~0_448 299959) 300039))))) (.cse13 (not (= ~a15~0 8))) (.cse15 (and (or (and (not (= ~a21~0 9)) .cse17) (and .cse17 .cse12) (<= (+ ~a12~0 49) 0)) .cse2 .cse8)) (.cse14 (<= (+ ~a12~0 45156) 0)) (.cse16 (= ~a21~0 10))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse3 .cse6 .cse7 .cse2) (and .cse3 (and (and (<= ~a12~0 80) .cse8 (not .cse6) (not (= 6 ~a21~0))) .cse9) .cse2) (and (<= ~a12~0 75) .cse10 .cse3 .cse4) (and (and .cse11 (and .cse3 .cse12) .cse2) .cse13) (and .cse14 (and .cse15 (<= ~a21~0 6)) .cse13) (and .cse11 .cse5 (and .cse3 .cse2) .cse0) (and .cse1 .cse13 .cse2) (and (and (and .cse3 .cse7 .cse12) .cse9) .cse13 .cse2) (or (and .cse0 .cse3 .cse16 .cse2 .cse12 .cse9) (and .cse3 .cse16 .cse2 (<= ~a12~0 73281) .cse9)) (and .cse3 .cse16 .cse4 .cse7) (and .cse13 (and .cse3 .cse6 .cse2)) (and .cse0 .cse3 .cse13 .cse2 .cse12 .cse8) (and (= ~a15~0 7) .cse3 .cse16) (and .cse3 (or (or (and (= 8 ~a15~0) (and .cse17 (= 10 ~a21~0))) .cse15) (and .cse14 .cse16 .cse2 .cse12))))))) [2019-11-20 01:38:34,565 INFO L444 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-11-20 01:38:34,565 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-11-20 01:38:34,565 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-20 01:38:34,565 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-20 01:38:34,565 INFO L444 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-20 01:38:34,565 INFO L444 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-11-20 01:38:34,565 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-11-20 01:38:34,565 INFO L444 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-11-20 01:38:34,565 INFO L444 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-11-20 01:38:34,565 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,565 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,565 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,565 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-11-20 01:38:34,566 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-20 01:38:34,566 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-20 01:38:34,566 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-20 01:38:34,566 INFO L444 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-11-20 01:38:34,566 INFO L444 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-11-20 01:38:34,566 INFO L444 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-11-20 01:38:34,566 INFO L444 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-11-20 01:38:34,566 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-11-20 01:38:34,566 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,566 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,566 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,566 INFO L444 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-11-20 01:38:34,566 INFO L444 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-11-20 01:38:34,566 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-20 01:38:34,566 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-20 01:38:34,566 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 01:38:34,567 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-20 01:38:34,567 INFO L444 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-11-20 01:38:34,567 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-11-20 01:38:34,567 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-11-20 01:38:34,567 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,567 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,567 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,567 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-11-20 01:38:34,568 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-20 01:38:34,568 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-20 01:38:34,568 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-20 01:38:34,568 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-11-20 01:38:34,568 INFO L444 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-11-20 01:38:34,568 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-11-20 01:38:34,568 INFO L444 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-11-20 01:38:34,569 INFO L444 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-11-20 01:38:34,569 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,569 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,569 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 01:38:34,569 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-11-20 01:38:34,569 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-20 01:38:34,569 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-20 01:38:34,569 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-20 01:38:34,570 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-11-20 01:38:34,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,594 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,594 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,596 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,596 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,596 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,597 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,597 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,603 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,604 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,604 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,605 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,605 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,605 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,605 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,606 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,606 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,606 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,610 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,610 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,610 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,611 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,611 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 01:38:34 BoogieIcfgContainer [2019-11-20 01:38:34,618 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 01:38:34,618 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 01:38:34,618 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 01:38:34,618 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 01:38:34,619 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:36:02" (3/4) ... [2019-11-20 01:38:34,623 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 01:38:34,647 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 01:38:34,649 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 01:38:34,679 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && (8 == a21 && a24 == 1) && !(5 == a15)) && a15 <= 8) || ((a24 == 1 && a15 == 9) && 80 < a12)) || (((a24 == 1 && a21 == 7) && a12 <= 11) && a15 <= 8)) || ((a24 == 1 && (((a12 <= 80 && a21 <= 9) && !(a21 == 7)) && !(6 == a21)) && 0 < a12 + 43) && a15 <= 8)) || (((a12 <= 75 && 8 == a21) && a24 == 1) && a15 == 9)) || (((a21 == 6 && a24 == 1 && !(5 == a15)) && a15 <= 8) && !(a15 == 8))) || ((a12 + 45156 <= 0 && (((((!(a21 == 9) && a12 + 43 <= 0) || (a12 + 43 <= 0 && !(5 == a15))) || a12 + 49 <= 0) && a15 <= 8) && a21 <= 9) && a21 <= 6) && !(a15 == 8))) || (((a21 == 6 && 80 < a12) && a24 == 1 && a15 <= 8) && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039))) || ((((8 == a21 && a24 == 1) && !(5 == a15)) && !(a15 == 8)) && a15 <= 8)) || (((((a24 == 1 && a12 <= 11) && !(5 == a15)) && 0 < a12 + 43) && !(a15 == 8)) && a15 <= 8)) || ((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && a24 == 1) && a21 == 10) && a15 <= 8) && !(5 == a15)) && 0 < a12 + 43) || ((((a24 == 1 && a21 == 10) && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11)) || (!(a15 == 8) && (a24 == 1 && a21 == 7) && a15 <= 8)) || ((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && a24 == 1) && !(a15 == 8)) && a15 <= 8) && !(5 == a15)) && a21 <= 9)) || ((a15 == 7 && a24 == 1) && a21 == 10)) || (a24 == 1 && (((8 == a15 && a12 + 43 <= 0 && 10 == a21) || (((((!(a21 == 9) && a12 + 43 <= 0) || (a12 + 43 <= 0 && !(5 == a15))) || a12 + 49 <= 0) && a15 <= 8) && a21 <= 9)) || (((a12 + 45156 <= 0 && a21 == 10) && a15 <= 8) && !(5 == a15)))) [2019-11-20 01:38:34,683 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && (8 == a21 && a24 == 1) && !(5 == a15)) && a15 <= 8) || ((a24 == 1 && a15 == 9) && 80 < a12)) || (((a24 == 1 && a21 == 7) && a12 <= 11) && a15 <= 8)) || ((a24 == 1 && (((a12 <= 80 && a21 <= 9) && !(a21 == 7)) && !(6 == a21)) && 0 < a12 + 43) && a15 <= 8)) || (((a12 <= 75 && 8 == a21) && a24 == 1) && a15 == 9)) || (((a21 == 6 && a24 == 1 && !(5 == a15)) && a15 <= 8) && !(a15 == 8))) || ((a12 + 45156 <= 0 && (((((!(a21 == 9) && a12 + 43 <= 0) || (a12 + 43 <= 0 && !(5 == a15))) || a12 + 49 <= 0) && a15 <= 8) && a21 <= 9) && a21 <= 6) && !(a15 == 8))) || (((a21 == 6 && 80 < a12) && a24 == 1 && a15 <= 8) && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039))) || ((((8 == a21 && a24 == 1) && !(5 == a15)) && !(a15 == 8)) && a15 <= 8)) || (((((a24 == 1 && a12 <= 11) && !(5 == a15)) && 0 < a12 + 43) && !(a15 == 8)) && a15 <= 8)) || ((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && a24 == 1) && a21 == 10) && a15 <= 8) && !(5 == a15)) && 0 < a12 + 43) || ((((a24 == 1 && a21 == 10) && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11)) || (!(a15 == 8) && (a24 == 1 && a21 == 7) && a15 <= 8)) || ((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && a24 == 1) && !(a15 == 8)) && a15 <= 8) && !(5 == a15)) && a21 <= 9)) || ((a15 == 7 && a24 == 1) && a21 == 10)) || (a24 == 1 && (((8 == a15 && a12 + 43 <= 0 && 10 == a21) || (((((!(a21 == 9) && a12 + 43 <= 0) || (a12 + 43 <= 0 && !(5 == a15))) || a12 + 49 <= 0) && a15 <= 8) && a21 <= 9)) || (((a12 + 45156 <= 0 && a21 == 10) && a15 <= 8) && !(5 == a15)))) [2019-11-20 01:38:34,815 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_62d3e2d9-6121-4af0-b74a-391619736f5e/bin/uautomizer/witness.graphml [2019-11-20 01:38:34,815 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 01:38:34,816 INFO L168 Benchmark]: Toolchain (without parser) took 154541.36 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.0 GB). Free memory was 943.5 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2019-11-20 01:38:34,817 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 965.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:38:34,817 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -177.1 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-20 01:38:34,817 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 01:38:34,818 INFO L168 Benchmark]: Boogie Preprocessor took 106.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:38:34,818 INFO L168 Benchmark]: RCFGBuilder took 1512.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 974.5 MB in the end (delta: 130.1 MB). Peak memory consumption was 130.1 MB. Max. memory is 11.5 GB. [2019-11-20 01:38:34,819 INFO L168 Benchmark]: TraceAbstraction took 151861.68 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 974.5 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-11-20 01:38:34,819 INFO L168 Benchmark]: Witness Printer took 197.00 ms. Allocated memory is still 5.1 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2019-11-20 01:38:34,821 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 965.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 756.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -177.1 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 106.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1512.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 974.5 MB in the end (delta: 130.1 MB). Peak memory consumption was 130.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 151861.68 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 974.5 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. * Witness Printer took 197.00 ms. Allocated memory is still 5.1 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 160]: 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: 880]: Loop Invariant [2019-11-20 01:38:34,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,837 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,837 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,837 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] Derived loop invariant: (((((((((((((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && (8 == a21 && a24 == 1) && !(5 == a15)) && a15 <= 8) || ((a24 == 1 && a15 == 9) && 80 < a12)) || (((a24 == 1 && a21 == 7) && a12 <= 11) && a15 <= 8)) || ((a24 == 1 && (((a12 <= 80 && a21 <= 9) && !(a21 == 7)) && !(6 == a21)) && 0 < a12 + 43) && a15 <= 8)) || (((a12 <= 75 && 8 == a21) && a24 == 1) && a15 == 9)) || (((a21 == 6 && a24 == 1 && !(5 == a15)) && a15 <= 8) && !(a15 == 8))) || ((a12 + 45156 <= 0 && (((((!(a21 == 9) && a12 + 43 <= 0) || (a12 + 43 <= 0 && !(5 == a15))) || a12 + 49 <= 0) && a15 <= 8) && a21 <= 9) && a21 <= 6) && !(a15 == 8))) || (((a21 == 6 && 80 < a12) && a24 == 1 && a15 <= 8) && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039))) || ((((8 == a21 && a24 == 1) && !(5 == a15)) && !(a15 == 8)) && a15 <= 8)) || (((((a24 == 1 && a12 <= 11) && !(5 == a15)) && 0 < a12 + 43) && !(a15 == 8)) && a15 <= 8)) || ((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && a24 == 1) && a21 == 10) && a15 <= 8) && !(5 == a15)) && 0 < a12 + 43) || ((((a24 == 1 && a21 == 10) && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11)) || (!(a15 == 8) && (a24 == 1 && a21 == 7) && a15 <= 8)) || ((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && a24 == 1) && !(a15 == 8)) && a15 <= 8) && !(5 == a15)) && a21 <= 9)) || ((a15 == 7 && a24 == 1) && a21 == 10)) || (a24 == 1 && (((8 == a15 && a12 + 43 <= 0 && 10 == a21) || (((((!(a21 == 9) && a12 + 43 <= 0) || (a12 + 43 <= 0 && !(5 == a15))) || a12 + 49 <= 0) && a15 <= 8) && a21 <= 9)) || (((a12 + 45156 <= 0 && a21 == 10) && a15 <= 8) && !(5 == a15)))) - InvariantResult [Line: 20]: Loop Invariant [2019-11-20 01:38:34,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,852 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,852 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,852 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,852 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,853 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,853 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,853 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,854 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,854 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,854 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,854 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,857 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,857 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,857 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-20 01:38:34,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] Derived loop invariant: (((((((((((((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && (8 == a21 && a24 == 1) && !(5 == a15)) && a15 <= 8) || ((a24 == 1 && a15 == 9) && 80 < a12)) || (((a24 == 1 && a21 == 7) && a12 <= 11) && a15 <= 8)) || ((a24 == 1 && (((a12 <= 80 && a21 <= 9) && !(a21 == 7)) && !(6 == a21)) && 0 < a12 + 43) && a15 <= 8)) || (((a12 <= 75 && 8 == a21) && a24 == 1) && a15 == 9)) || (((a21 == 6 && a24 == 1 && !(5 == a15)) && a15 <= 8) && !(a15 == 8))) || ((a12 + 45156 <= 0 && (((((!(a21 == 9) && a12 + 43 <= 0) || (a12 + 43 <= 0 && !(5 == a15))) || a12 + 49 <= 0) && a15 <= 8) && a21 <= 9) && a21 <= 6) && !(a15 == 8))) || (((a21 == 6 && 80 < a12) && a24 == 1 && a15 <= 8) && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039))) || ((((8 == a21 && a24 == 1) && !(5 == a15)) && !(a15 == 8)) && a15 <= 8)) || (((((a24 == 1 && a12 <= 11) && !(5 == a15)) && 0 < a12 + 43) && !(a15 == 8)) && a15 <= 8)) || ((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && a24 == 1) && a21 == 10) && a15 <= 8) && !(5 == a15)) && 0 < a12 + 43) || ((((a24 == 1 && a21 == 10) && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11)) || (!(a15 == 8) && (a24 == 1 && a21 == 7) && a15 <= 8)) || ((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && a24 == 1) && !(a15 == 8)) && a15 <= 8) && !(5 == a15)) && a21 <= 9)) || ((a15 == 7 && a24 == 1) && a21 == 10)) || (a24 == 1 && (((8 == a15 && a12 + 43 <= 0 && 10 == a21) || (((((!(a21 == 9) && a12 + 43 <= 0) || (a12 + 43 <= 0 && !(5 == a15))) || a12 + 49 <= 0) && a15 <= 8) && a21 <= 9)) || (((a12 + 45156 <= 0 && a21 == 10) && a15 <= 8) && !(5 == a15)))) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Result: SAFE, OverallTime: 151.7s, OverallIterations: 23, TraceHistogramMax: 18, AutomataDifference: 87.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.7s, HoareTripleCheckerStatistics: 1608 SDtfs, 16346 SDslu, 427 SDs, 0 SdLazy, 31373 SolverSat, 3158 SolverUnsat, 18 SolverUnknown, 0 SolverNotchecked, 78.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11211 GetRequests, 11017 SyntacticMatches, 19 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 12.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7480occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 15941 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 126 NumberOfFragments, 855 HoareAnnotationTreeSize, 3 FomulaSimplifications, 982974 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 349072 FormulaSimplificationTreeSizeReductionInter, 6.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 29.5s InterpolantComputationTime, 29972 NumberOfCodeBlocks, 29972 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 29935 ConstructedInterpolants, 441 QuantifiedInterpolants, 99747162 SizeOfPredicates, 20 NumberOfNonLiveVariables, 13573 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 37 InterpolantComputations, 17 PerfectInterpolantSequences, 107109/112774 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...