./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label36.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_5c1a6604-1981-4525-a94e-aecb6548c86f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5c1a6604-1981-4525-a94e-aecb6548c86f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5c1a6604-1981-4525-a94e-aecb6548c86f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5c1a6604-1981-4525-a94e-aecb6548c86f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label36.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5c1a6604-1981-4525-a94e-aecb6548c86f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5c1a6604-1981-4525-a94e-aecb6548c86f/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 1d96b5cec4d76d1edc3f261f7d8386bd0d5f58f5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 00:01:43,067 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:01:43,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:01:43,083 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:01:43,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:01:43,084 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:01:43,086 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:01:43,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:01:43,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:01:43,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:01:43,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:01:43,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:01:43,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:01:43,108 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:01:43,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:01:43,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:01:43,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:01:43,111 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:01:43,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:01:43,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:01:43,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:01:43,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:01:43,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:01:43,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:01:43,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:01:43,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:01:43,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:01:43,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:01:43,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:01:43,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:01:43,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:01:43,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:01:43,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:01:43,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:01:43,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:01:43,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:01:43,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:01:43,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:01:43,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:01:43,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:01:43,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:01:43,132 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5c1a6604-1981-4525-a94e-aecb6548c86f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 00:01:43,144 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:01:43,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:01:43,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:01:43,146 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:01:43,146 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:01:43,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:01:43,147 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:01:43,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:01:43,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:01:43,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:01:43,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:01:43,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:01:43,148 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:01:43,148 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:01:43,149 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:01:43,149 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:01:43,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:01:43,149 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:01:43,149 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:01:43,150 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:01:43,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:01:43,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:01:43,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:01:43,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:01:43,151 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:01:43,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 00:01:43,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:01:43,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:01:43,153 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_5c1a6604-1981-4525-a94e-aecb6548c86f/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 -> 1d96b5cec4d76d1edc3f261f7d8386bd0d5f58f5 [2019-11-20 00:01:43,318 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:01:43,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:01:43,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:01:43,333 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:01:43,334 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:01:43,334 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5c1a6604-1981-4525-a94e-aecb6548c86f/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label36.c [2019-11-20 00:01:43,400 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5c1a6604-1981-4525-a94e-aecb6548c86f/bin/uautomizer/data/d45c52e6a/65139fc53bf14989a2cc1e18587da9db/FLAGa3f2c8c91 [2019-11-20 00:01:43,967 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:01:43,968 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5c1a6604-1981-4525-a94e-aecb6548c86f/sv-benchmarks/c/eca-rers2012/Problem15_label36.c [2019-11-20 00:01:43,987 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5c1a6604-1981-4525-a94e-aecb6548c86f/bin/uautomizer/data/d45c52e6a/65139fc53bf14989a2cc1e18587da9db/FLAGa3f2c8c91 [2019-11-20 00:01:44,113 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5c1a6604-1981-4525-a94e-aecb6548c86f/bin/uautomizer/data/d45c52e6a/65139fc53bf14989a2cc1e18587da9db [2019-11-20 00:01:44,116 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:01:44,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:01:44,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:01:44,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:01:44,121 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:01:44,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:01:44" (1/1) ... [2019-11-20 00:01:44,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e344be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:01:44, skipping insertion in model container [2019-11-20 00:01:44,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:01:44" (1/1) ... [2019-11-20 00:01:44,130 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:01:44,216 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:01:45,051 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:01:45,055 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:01:45,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:01:45,570 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:01:45,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:01:45 WrapperNode [2019-11-20 00:01:45,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:01:45,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:01:45,572 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:01:45,572 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:01:45,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:01:45" (1/1) ... [2019-11-20 00:01:45,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:01:45" (1/1) ... [2019-11-20 00:01:45,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:01:45,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:01:45,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:01:45,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:01:45,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:01:45" (1/1) ... [2019-11-20 00:01:45,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:01:45" (1/1) ... [2019-11-20 00:01:45,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:01:45" (1/1) ... [2019-11-20 00:01:45,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:01:45" (1/1) ... [2019-11-20 00:01:45,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:01:45" (1/1) ... [2019-11-20 00:01:45,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:01:45" (1/1) ... [2019-11-20 00:01:45,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:01:45" (1/1) ... [2019-11-20 00:01:45,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:01:45,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:01:45,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:01:45,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:01:45,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:01:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c1a6604-1981-4525-a94e-aecb6548c86f/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 00:01:46,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:01:46,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:01:49,967 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:01:49,967 INFO L285 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-20 00:01:49,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:01:49 BoogieIcfgContainer [2019-11-20 00:01:49,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:01:49,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:01:49,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:01:49,973 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:01:49,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:01:44" (1/3) ... [2019-11-20 00:01:49,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6edba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:01:49, skipping insertion in model container [2019-11-20 00:01:49,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:01:45" (2/3) ... [2019-11-20 00:01:49,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6edba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:01:49, skipping insertion in model container [2019-11-20 00:01:49,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:01:49" (3/3) ... [2019-11-20 00:01:49,976 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label36.c [2019-11-20 00:01:49,986 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:01:49,993 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 00:01:50,004 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 00:01:50,033 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:01:50,033 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:01:50,034 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:01:50,034 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:01:50,034 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:01:50,034 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:01:50,034 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:01:50,035 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:01:50,063 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-20 00:01:50,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 00:01:50,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:01:50,073 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:01:50,074 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:01:50,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:01:50,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1818267785, now seen corresponding path program 1 times [2019-11-20 00:01:50,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:01:50,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488113207] [2019-11-20 00:01:50,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:01:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:01:50,397 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 00:01:50,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488113207] [2019-11-20 00:01:50,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:01:50,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:01:50,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499506008] [2019-11-20 00:01:50,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:01:50,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:01:50,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:01:50,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:01:50,420 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-20 00:01:55,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:01:55,367 INFO L93 Difference]: Finished difference Result 1466 states and 2715 transitions. [2019-11-20 00:01:55,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:01:55,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-20 00:01:55,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:01:55,390 INFO L225 Difference]: With dead ends: 1466 [2019-11-20 00:01:55,391 INFO L226 Difference]: Without dead ends: 974 [2019-11-20 00:01:55,396 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 00:01:55,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-11-20 00:01:55,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 972. [2019-11-20 00:01:55,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-11-20 00:01:55,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1407 transitions. [2019-11-20 00:01:55,481 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1407 transitions. Word has length 61 [2019-11-20 00:01:55,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:01:55,482 INFO L462 AbstractCegarLoop]: Abstraction has 972 states and 1407 transitions. [2019-11-20 00:01:55,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:01:55,482 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1407 transitions. [2019-11-20 00:01:55,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-20 00:01:55,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:01:55,489 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:01:55,489 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:01:55,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:01:55,490 INFO L82 PathProgramCache]: Analyzing trace with hash 13242671, now seen corresponding path program 1 times [2019-11-20 00:01:55,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:01:55,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864730357] [2019-11-20 00:01:55,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:01:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:01:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:01:55,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864730357] [2019-11-20 00:01:55,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:01:55,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:01:55,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207450396] [2019-11-20 00:01:55,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:01:55,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:01:55,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:01:55,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:01:55,693 INFO L87 Difference]: Start difference. First operand 972 states and 1407 transitions. Second operand 4 states. [2019-11-20 00:02:00,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:02:00,289 INFO L93 Difference]: Finished difference Result 3747 states and 5437 transitions. [2019-11-20 00:02:00,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:02:00,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-11-20 00:02:00,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:02:00,308 INFO L225 Difference]: With dead ends: 3747 [2019-11-20 00:02:00,308 INFO L226 Difference]: Without dead ends: 2777 [2019-11-20 00:02:00,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:02:00,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2019-11-20 00:02:00,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2775. [2019-11-20 00:02:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2775 states. [2019-11-20 00:02:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 3624 transitions. [2019-11-20 00:02:00,374 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 3624 transitions. Word has length 126 [2019-11-20 00:02:00,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:02:00,375 INFO L462 AbstractCegarLoop]: Abstraction has 2775 states and 3624 transitions. [2019-11-20 00:02:00,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:02:00,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 3624 transitions. [2019-11-20 00:02:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-20 00:02:00,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:02:00,382 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 00:02:00,382 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:02:00,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:02:00,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1978174500, now seen corresponding path program 1 times [2019-11-20 00:02:00,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:02:00,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605224393] [2019-11-20 00:02:00,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:02:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:02:00,654 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 117 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 00:02:00,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605224393] [2019-11-20 00:02:00,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221004927] [2019-11-20 00:02:00,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c1a6604-1981-4525-a94e-aecb6548c86f/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 00:02:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:02:00,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 00:02:00,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:02:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:02:00,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:02:00,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-11-20 00:02:00,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648360781] [2019-11-20 00:02:00,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:02:00,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:02:00,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:02:00,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:02:00,851 INFO L87 Difference]: Start difference. First operand 2775 states and 3624 transitions. Second operand 3 states. [2019-11-20 00:02:03,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:02:03,736 INFO L93 Difference]: Finished difference Result 7941 states and 10408 transitions. [2019-11-20 00:02:03,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:02:03,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-11-20 00:02:03,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:02:03,764 INFO L225 Difference]: With dead ends: 7941 [2019-11-20 00:02:03,765 INFO L226 Difference]: Without dead ends: 5168 [2019-11-20 00:02:03,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 231 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 00:02:03,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5168 states. [2019-11-20 00:02:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5168 to 3073. [2019-11-20 00:02:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2019-11-20 00:02:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 3976 transitions. [2019-11-20 00:02:03,861 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 3976 transitions. Word has length 231 [2019-11-20 00:02:03,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:02:03,862 INFO L462 AbstractCegarLoop]: Abstraction has 3073 states and 3976 transitions. [2019-11-20 00:02:03,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:02:03,863 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 3976 transitions. [2019-11-20 00:02:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-11-20 00:02:03,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:02:03,873 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:02:04,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:02:04,076 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:02:04,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:02:04,077 INFO L82 PathProgramCache]: Analyzing trace with hash 482134373, now seen corresponding path program 1 times [2019-11-20 00:02:04,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:02:04,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68292711] [2019-11-20 00:02:04,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:02:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:02:04,909 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-20 00:02:04,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68292711] [2019-11-20 00:02:04,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:02:04,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:02:04,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553734793] [2019-11-20 00:02:04,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:02:04,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:02:04,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:02:04,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:02:04,912 INFO L87 Difference]: Start difference. First operand 3073 states and 3976 transitions. Second operand 5 states. [2019-11-20 00:02:08,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:02:08,747 INFO L93 Difference]: Finished difference Result 7342 states and 9252 transitions. [2019-11-20 00:02:08,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:02:08,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 411 [2019-11-20 00:02:08,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:02:08,769 INFO L225 Difference]: With dead ends: 7342 [2019-11-20 00:02:08,770 INFO L226 Difference]: Without dead ends: 4271 [2019-11-20 00:02:08,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 00:02:08,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4271 states. [2019-11-20 00:02:08,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4271 to 3971. [2019-11-20 00:02:08,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3971 states. [2019-11-20 00:02:08,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 4928 transitions. [2019-11-20 00:02:08,849 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 4928 transitions. Word has length 411 [2019-11-20 00:02:08,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:02:08,850 INFO L462 AbstractCegarLoop]: Abstraction has 3971 states and 4928 transitions. [2019-11-20 00:02:08,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:02:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 4928 transitions. [2019-11-20 00:02:08,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2019-11-20 00:02:08,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:02:08,860 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:02:08,860 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:02:08,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:02:08,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1884331539, now seen corresponding path program 1 times [2019-11-20 00:02:08,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:02:08,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570454693] [2019-11-20 00:02:08,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:02:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:02:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 329 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 00:02:09,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570454693] [2019-11-20 00:02:09,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:02:09,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:02:09,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565429918] [2019-11-20 00:02:09,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:02:09,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:02:09,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:02:09,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:02:09,277 INFO L87 Difference]: Start difference. First operand 3971 states and 4928 transitions. Second operand 4 states. [2019-11-20 00:02:13,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:02:13,064 INFO L93 Difference]: Finished difference Result 9742 states and 12308 transitions. [2019-11-20 00:02:13,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:02:13,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 485 [2019-11-20 00:02:13,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:02:13,095 INFO L225 Difference]: With dead ends: 9742 [2019-11-20 00:02:13,095 INFO L226 Difference]: Without dead ends: 5773 [2019-11-20 00:02:13,100 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:02:13,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5773 states. [2019-11-20 00:02:13,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5773 to 5470. [2019-11-20 00:02:13,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5470 states. [2019-11-20 00:02:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5470 states to 5470 states and 6685 transitions. [2019-11-20 00:02:13,204 INFO L78 Accepts]: Start accepts. Automaton has 5470 states and 6685 transitions. Word has length 485 [2019-11-20 00:02:13,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:02:13,205 INFO L462 AbstractCegarLoop]: Abstraction has 5470 states and 6685 transitions. [2019-11-20 00:02:13,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:02:13,206 INFO L276 IsEmpty]: Start isEmpty. Operand 5470 states and 6685 transitions. [2019-11-20 00:02:13,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2019-11-20 00:02:13,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:02:13,217 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:02:13,217 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:02:13,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:02:13,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1615305343, now seen corresponding path program 1 times [2019-11-20 00:02:13,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:02:13,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952391292] [2019-11-20 00:02:13,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:02:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:02:13,630 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 351 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-11-20 00:02:13,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952391292] [2019-11-20 00:02:13,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:02:13,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:02:13,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374388055] [2019-11-20 00:02:13,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:02:13,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:02:13,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:02:13,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:02:13,633 INFO L87 Difference]: Start difference. First operand 5470 states and 6685 transitions. Second operand 4 states. [2019-11-20 00:02:16,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:02:16,575 INFO L93 Difference]: Finished difference Result 10937 states and 13389 transitions. [2019-11-20 00:02:16,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:02:16,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 491 [2019-11-20 00:02:16,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:02:16,600 INFO L225 Difference]: With dead ends: 10937 [2019-11-20 00:02:16,600 INFO L226 Difference]: Without dead ends: 5469 [2019-11-20 00:02:16,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:02:16,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5469 states. [2019-11-20 00:02:16,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5469 to 5466. [2019-11-20 00:02:16,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5466 states. [2019-11-20 00:02:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5466 states to 5466 states and 6352 transitions. [2019-11-20 00:02:16,711 INFO L78 Accepts]: Start accepts. Automaton has 5466 states and 6352 transitions. Word has length 491 [2019-11-20 00:02:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:02:16,712 INFO L462 AbstractCegarLoop]: Abstraction has 5466 states and 6352 transitions. [2019-11-20 00:02:16,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:02:16,712 INFO L276 IsEmpty]: Start isEmpty. Operand 5466 states and 6352 transitions. [2019-11-20 00:02:16,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2019-11-20 00:02:16,725 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:02:16,726 INFO L410 BasicCegarLoop]: trace histogram [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, 5, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:02:16,726 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:02:16,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:02:16,726 INFO L82 PathProgramCache]: Analyzing trace with hash -739237505, now seen corresponding path program 1 times [2019-11-20 00:02:16,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:02:16,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155294863] [2019-11-20 00:02:16,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:02:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:02:18,165 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 534 proven. 3 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-20 00:02:18,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155294863] [2019-11-20 00:02:18,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886542663] [2019-11-20 00:02:18,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c1a6604-1981-4525-a94e-aecb6548c86f/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 00:02:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:02:18,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 00:02:18,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:02:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-11-20 00:02:18,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:02:18,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-20 00:02:18,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115256975] [2019-11-20 00:02:18,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:02:18,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:02:18,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:02:18,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:02:18,543 INFO L87 Difference]: Start difference. First operand 5466 states and 6352 transitions. Second operand 3 states. [2019-11-20 00:02:21,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:02:21,025 INFO L93 Difference]: Finished difference Result 10930 states and 12702 transitions. [2019-11-20 00:02:21,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:02:21,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 514 [2019-11-20 00:02:21,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:02:21,048 INFO L225 Difference]: With dead ends: 10930 [2019-11-20 00:02:21,048 INFO L226 Difference]: Without dead ends: 5466 [2019-11-20 00:02:21,053 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 513 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:02:21,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5466 states. [2019-11-20 00:02:21,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5466 to 5466. [2019-11-20 00:02:21,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5466 states. [2019-11-20 00:02:21,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5466 states to 5466 states and 6334 transitions. [2019-11-20 00:02:21,133 INFO L78 Accepts]: Start accepts. Automaton has 5466 states and 6334 transitions. Word has length 514 [2019-11-20 00:02:21,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:02:21,134 INFO L462 AbstractCegarLoop]: Abstraction has 5466 states and 6334 transitions. [2019-11-20 00:02:21,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:02:21,135 INFO L276 IsEmpty]: Start isEmpty. Operand 5466 states and 6334 transitions. [2019-11-20 00:02:21,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-11-20 00:02:21,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:02:21,148 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:02:21,352 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:02:21,352 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:02:21,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:02:21,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1317201490, now seen corresponding path program 1 times [2019-11-20 00:02:21,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:02:21,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674891509] [2019-11-20 00:02:21,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:02:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:02:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-20 00:02:21,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674891509] [2019-11-20 00:02:21,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:02:21,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:02:21,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140976910] [2019-11-20 00:02:21,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:02:21,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:02:21,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:02:21,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:02:21,730 INFO L87 Difference]: Start difference. First operand 5466 states and 6334 transitions. Second operand 4 states. [2019-11-20 00:02:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:02:24,625 INFO L93 Difference]: Finished difference Result 10932 states and 12672 transitions. [2019-11-20 00:02:24,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:02:24,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 517 [2019-11-20 00:02:24,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:02:24,636 INFO L225 Difference]: With dead ends: 10932 [2019-11-20 00:02:24,637 INFO L226 Difference]: Without dead ends: 5468 [2019-11-20 00:02:24,642 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 00:02:24,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5468 states. [2019-11-20 00:02:24,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5468 to 5463. [2019-11-20 00:02:24,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5463 states. [2019-11-20 00:02:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5463 states to 5463 states and 6173 transitions. [2019-11-20 00:02:24,716 INFO L78 Accepts]: Start accepts. Automaton has 5463 states and 6173 transitions. Word has length 517 [2019-11-20 00:02:24,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:02:24,717 INFO L462 AbstractCegarLoop]: Abstraction has 5463 states and 6173 transitions. [2019-11-20 00:02:24,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:02:24,718 INFO L276 IsEmpty]: Start isEmpty. Operand 5463 states and 6173 transitions. [2019-11-20 00:02:24,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2019-11-20 00:02:24,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:02:24,724 INFO L410 BasicCegarLoop]: trace histogram [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, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:02:24,725 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:02:24,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:02:24,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1882152332, now seen corresponding path program 1 times [2019-11-20 00:02:24,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:02:24,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518272637] [2019-11-20 00:02:24,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:02:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:02:25,109 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-20 00:02:25,810 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 571 proven. 3 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-11-20 00:02:25,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518272637] [2019-11-20 00:02:25,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321168607] [2019-11-20 00:02:25,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c1a6604-1981-4525-a94e-aecb6548c86f/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 00:02:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:02:25,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 00:02:25,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:02:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-11-20 00:02:26,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:02:26,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-20 00:02:26,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456573880] [2019-11-20 00:02:26,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:02:26,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:02:26,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:02:26,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:02:26,286 INFO L87 Difference]: Start difference. First operand 5463 states and 6173 transitions. Second operand 3 states. [2019-11-20 00:02:28,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:02:28,098 INFO L93 Difference]: Finished difference Result 14523 states and 16465 transitions. [2019-11-20 00:02:28,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:02:28,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 549 [2019-11-20 00:02:28,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:02:28,116 INFO L225 Difference]: With dead ends: 14523 [2019-11-20 00:02:28,116 INFO L226 Difference]: Without dead ends: 9062 [2019-11-20 00:02:28,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 548 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:02:28,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9062 states. [2019-11-20 00:02:28,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9062 to 8755. [2019-11-20 00:02:28,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8755 states. [2019-11-20 00:02:28,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8755 states to 8755 states and 9759 transitions. [2019-11-20 00:02:28,227 INFO L78 Accepts]: Start accepts. Automaton has 8755 states and 9759 transitions. Word has length 549 [2019-11-20 00:02:28,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:02:28,228 INFO L462 AbstractCegarLoop]: Abstraction has 8755 states and 9759 transitions. [2019-11-20 00:02:28,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:02:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 8755 states and 9759 transitions. [2019-11-20 00:02:28,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2019-11-20 00:02:28,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:02:28,237 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:02:28,441 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:02:28,442 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:02:28,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:02:28,442 INFO L82 PathProgramCache]: Analyzing trace with hash 2096021639, now seen corresponding path program 1 times [2019-11-20 00:02:28,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:02:28,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744331329] [2019-11-20 00:02:28,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:02:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:02:28,793 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-11-20 00:02:28,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744331329] [2019-11-20 00:02:28,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:02:28,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:02:28,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661635459] [2019-11-20 00:02:28,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:02:28,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:02:28,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:02:28,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:02:28,796 INFO L87 Difference]: Start difference. First operand 8755 states and 9759 transitions. Second operand 3 states. [2019-11-20 00:02:31,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:02:31,147 INFO L93 Difference]: Finished difference Result 17805 states and 19855 transitions. [2019-11-20 00:02:31,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:02:31,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 562 [2019-11-20 00:02:31,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:02:31,167 INFO L225 Difference]: With dead ends: 17805 [2019-11-20 00:02:31,168 INFO L226 Difference]: Without dead ends: 9052 [2019-11-20 00:02:31,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:02:31,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9052 states. [2019-11-20 00:02:31,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9052 to 8753. [2019-11-20 00:02:31,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8753 states. [2019-11-20 00:02:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8753 states to 8753 states and 9755 transitions. [2019-11-20 00:02:31,274 INFO L78 Accepts]: Start accepts. Automaton has 8753 states and 9755 transitions. Word has length 562 [2019-11-20 00:02:31,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:02:31,275 INFO L462 AbstractCegarLoop]: Abstraction has 8753 states and 9755 transitions. [2019-11-20 00:02:31,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:02:31,275 INFO L276 IsEmpty]: Start isEmpty. Operand 8753 states and 9755 transitions. [2019-11-20 00:02:31,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2019-11-20 00:02:31,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:02:31,287 INFO L410 BasicCegarLoop]: trace histogram [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, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:02:31,287 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:02:31,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:02:31,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1471252033, now seen corresponding path program 1 times [2019-11-20 00:02:31,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:02:31,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928631939] [2019-11-20 00:02:31,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:02:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:02:32,573 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 647 proven. 3 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-11-20 00:02:32,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928631939] [2019-11-20 00:02:32,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629687714] [2019-11-20 00:02:32,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c1a6604-1981-4525-a94e-aecb6548c86f/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 00:02:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:02:32,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:02:32,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:02:32,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:02:33,419 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 611 proven. 39 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-11-20 00:02:33,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:02:33,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-20 00:02:33,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841854561] [2019-11-20 00:02:33,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 00:02:33,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:02:33,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 00:02:33,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-20 00:02:33,421 INFO L87 Difference]: Start difference. First operand 8753 states and 9755 transitions. Second operand 9 states. [2019-11-20 00:02:38,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:02:38,953 INFO L93 Difference]: Finished difference Result 23340 states and 25838 transitions. [2019-11-20 00:02:38,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 00:02:38,954 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 625 [2019-11-20 00:02:38,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:02:38,968 INFO L225 Difference]: With dead ends: 23340 [2019-11-20 00:02:38,968 INFO L226 Difference]: Without dead ends: 9948 [2019-11-20 00:02:38,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 622 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-11-20 00:02:38,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9948 states. [2019-11-20 00:02:39,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9948 to 9648. [2019-11-20 00:02:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9648 states. [2019-11-20 00:02:39,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9648 states to 9648 states and 10076 transitions. [2019-11-20 00:02:39,087 INFO L78 Accepts]: Start accepts. Automaton has 9648 states and 10076 transitions. Word has length 625 [2019-11-20 00:02:39,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:02:39,088 INFO L462 AbstractCegarLoop]: Abstraction has 9648 states and 10076 transitions. [2019-11-20 00:02:39,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 00:02:39,088 INFO L276 IsEmpty]: Start isEmpty. Operand 9648 states and 10076 transitions. [2019-11-20 00:02:39,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2019-11-20 00:02:39,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:02:39,098 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:02:39,302 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:02:39,306 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:02:39,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:02:39,306 INFO L82 PathProgramCache]: Analyzing trace with hash -2145955924, now seen corresponding path program 1 times [2019-11-20 00:02:39,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:02:39,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569532979] [2019-11-20 00:02:39,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:02:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:02:39,881 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2019-11-20 00:02:39,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569532979] [2019-11-20 00:02:39,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:02:39,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:02:39,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715590325] [2019-11-20 00:02:39,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:02:39,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:02:39,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:02:39,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:02:39,893 INFO L87 Difference]: Start difference. First operand 9648 states and 10076 transitions. Second operand 3 states. [2019-11-20 00:02:41,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:02:41,062 INFO L93 Difference]: Finished difference Result 22283 states and 23308 transitions. [2019-11-20 00:02:41,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:02:41,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 662 [2019-11-20 00:02:41,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:02:41,077 INFO L225 Difference]: With dead ends: 22283 [2019-11-20 00:02:41,077 INFO L226 Difference]: Without dead ends: 12338 [2019-11-20 00:02:41,085 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:02:41,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12338 states. [2019-11-20 00:02:41,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12338 to 12039. [2019-11-20 00:02:41,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12039 states. [2019-11-20 00:02:41,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12039 states to 12039 states and 12495 transitions. [2019-11-20 00:02:41,206 INFO L78 Accepts]: Start accepts. Automaton has 12039 states and 12495 transitions. Word has length 662 [2019-11-20 00:02:41,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:02:41,207 INFO L462 AbstractCegarLoop]: Abstraction has 12039 states and 12495 transitions. [2019-11-20 00:02:41,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:02:41,208 INFO L276 IsEmpty]: Start isEmpty. Operand 12039 states and 12495 transitions. [2019-11-20 00:02:41,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687 [2019-11-20 00:02:41,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:02:41,220 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 00:02:41,220 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:02:41,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:02:41,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1492551500, now seen corresponding path program 1 times [2019-11-20 00:02:41,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:02:41,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51833698] [2019-11-20 00:02:41,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:02:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:02:41,889 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-20 00:02:41,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51833698] [2019-11-20 00:02:41,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:02:41,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:02:41,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833435545] [2019-11-20 00:02:41,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:02:41,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:02:41,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:02:41,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:02:41,892 INFO L87 Difference]: Start difference. First operand 12039 states and 12495 transitions. Second operand 4 states. [2019-11-20 00:02:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:02:43,144 INFO L93 Difference]: Finished difference Result 23145 states and 24053 transitions. [2019-11-20 00:02:43,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:02:43,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 686 [2019-11-20 00:02:43,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:02:43,157 INFO L225 Difference]: With dead ends: 23145 [2019-11-20 00:02:43,158 INFO L226 Difference]: Without dead ends: 11108 [2019-11-20 00:02:43,166 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 00:02:43,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11108 states. [2019-11-20 00:02:43,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11108 to 9008. [2019-11-20 00:02:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9008 states. [2019-11-20 00:02:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9008 states to 9008 states and 9271 transitions. [2019-11-20 00:02:43,289 INFO L78 Accepts]: Start accepts. Automaton has 9008 states and 9271 transitions. Word has length 686 [2019-11-20 00:02:43,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:02:43,290 INFO L462 AbstractCegarLoop]: Abstraction has 9008 states and 9271 transitions. [2019-11-20 00:02:43,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:02:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 9008 states and 9271 transitions. [2019-11-20 00:02:43,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2019-11-20 00:02:43,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:02:43,303 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 00:02:43,303 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:02:43,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:02:43,304 INFO L82 PathProgramCache]: Analyzing trace with hash 940636783, now seen corresponding path program 1 times [2019-11-20 00:02:43,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:02:43,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339224101] [2019-11-20 00:02:43,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:02:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:02:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-11-20 00:02:43,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339224101] [2019-11-20 00:02:43,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:02:43,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:02:43,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978075643] [2019-11-20 00:02:43,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:02:43,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:02:43,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:02:43,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:02:43,908 INFO L87 Difference]: Start difference. First operand 9008 states and 9271 transitions. Second operand 3 states. [2019-11-20 00:02:44,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:02:44,647 INFO L93 Difference]: Finished difference Result 18014 states and 18546 transitions. [2019-11-20 00:02:44,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:02:44,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 691 [2019-11-20 00:02:44,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:02:44,656 INFO L225 Difference]: With dead ends: 18014 [2019-11-20 00:02:44,656 INFO L226 Difference]: Without dead ends: 9307 [2019-11-20 00:02:44,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:02:44,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9307 states. [2019-11-20 00:02:44,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9307 to 9008. [2019-11-20 00:02:44,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9008 states. [2019-11-20 00:02:44,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9008 states to 9008 states and 9268 transitions. [2019-11-20 00:02:44,726 INFO L78 Accepts]: Start accepts. Automaton has 9008 states and 9268 transitions. Word has length 691 [2019-11-20 00:02:44,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:02:44,727 INFO L462 AbstractCegarLoop]: Abstraction has 9008 states and 9268 transitions. [2019-11-20 00:02:44,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:02:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 9008 states and 9268 transitions. [2019-11-20 00:02:44,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2019-11-20 00:02:44,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:02:44,752 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 00:02:44,752 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:02:44,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:02:44,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1105372660, now seen corresponding path program 1 times [2019-11-20 00:02:44,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:02:44,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252082600] [2019-11-20 00:02:44,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:02:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:02:45,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 592 proven. 0 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2019-11-20 00:02:45,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252082600] [2019-11-20 00:02:45,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:02:45,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:02:45,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110409562] [2019-11-20 00:02:45,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:02:45,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:02:45,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:02:45,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:02:45,350 INFO L87 Difference]: Start difference. First operand 9008 states and 9268 transitions. Second operand 3 states. [2019-11-20 00:02:46,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:02:46,203 INFO L93 Difference]: Finished difference Result 18609 states and 19174 transitions. [2019-11-20 00:02:46,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:02:46,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 846 [2019-11-20 00:02:46,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:02:46,212 INFO L225 Difference]: With dead ends: 18609 [2019-11-20 00:02:46,213 INFO L226 Difference]: Without dead ends: 9902 [2019-11-20 00:02:46,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:02:46,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9902 states. [2019-11-20 00:02:46,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9902 to 9005. [2019-11-20 00:02:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9005 states. [2019-11-20 00:02:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9005 states to 9005 states and 9244 transitions. [2019-11-20 00:02:46,301 INFO L78 Accepts]: Start accepts. Automaton has 9005 states and 9244 transitions. Word has length 846 [2019-11-20 00:02:46,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:02:46,301 INFO L462 AbstractCegarLoop]: Abstraction has 9005 states and 9244 transitions. [2019-11-20 00:02:46,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:02:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 9005 states and 9244 transitions. [2019-11-20 00:02:46,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 868 [2019-11-20 00:02:46,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:02:46,315 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 00:02:46,315 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:02:46,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:02:46,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1187839850, now seen corresponding path program 1 times [2019-11-20 00:02:46,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:02:46,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147399649] [2019-11-20 00:02:46,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:02:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:02:49,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 520 proven. 504 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-20 00:02:49,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147399649] [2019-11-20 00:02:49,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933993262] [2019-11-20 00:02:49,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c1a6604-1981-4525-a94e-aecb6548c86f/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 00:02:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:02:49,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 00:02:49,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:02:49,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:49,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:49,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2019-11-20 00:02:49,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:02:49,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2019-11-20 00:02:49,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141377687] [2019-11-20 00:02:49,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:02:49,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:02:49,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:02:49,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-20 00:02:49,880 INFO L87 Difference]: Start difference. First operand 9005 states and 9244 transitions. Second operand 3 states. [2019-11-20 00:02:51,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:02:51,141 INFO L93 Difference]: Finished difference Result 20711 states and 21268 transitions. [2019-11-20 00:02:51,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:02:51,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 867 [2019-11-20 00:02:51,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:02:51,150 INFO L225 Difference]: With dead ends: 20711 [2019-11-20 00:02:51,150 INFO L226 Difference]: Without dead ends: 12007 [2019-11-20 00:02:51,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 866 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-20 00:02:51,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12007 states. [2019-11-20 00:02:51,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12007 to 10805. [2019-11-20 00:02:51,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10805 states. [2019-11-20 00:02:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10805 states to 10805 states and 11090 transitions. [2019-11-20 00:02:51,271 INFO L78 Accepts]: Start accepts. Automaton has 10805 states and 11090 transitions. Word has length 867 [2019-11-20 00:02:51,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:02:51,272 INFO L462 AbstractCegarLoop]: Abstraction has 10805 states and 11090 transitions. [2019-11-20 00:02:51,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:02:51,272 INFO L276 IsEmpty]: Start isEmpty. Operand 10805 states and 11090 transitions. [2019-11-20 00:02:51,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2019-11-20 00:02:51,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:02:51,286 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:02:51,487 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:02:51,488 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:02:51,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:02:51,488 INFO L82 PathProgramCache]: Analyzing trace with hash -568589825, now seen corresponding path program 1 times [2019-11-20 00:02:51,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:02:51,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701829898] [2019-11-20 00:02:51,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:02:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:02:54,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 676 proven. 641 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-11-20 00:02:54,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701829898] [2019-11-20 00:02:54,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209925179] [2019-11-20 00:02:54,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c1a6604-1981-4525-a94e-aecb6548c86f/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 00:02:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:02:54,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 00:02:54,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:02:54,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:02:54,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:02:54,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:02:54,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:54,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:02:55,388 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 25 [2019-11-20 00:02:57,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 988 proven. 325 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-20 00:02:57,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:02:57,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 19 [2019-11-20 00:02:57,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579804494] [2019-11-20 00:02:57,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-20 00:02:57,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:02:57,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 00:02:57,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-11-20 00:02:57,813 INFO L87 Difference]: Start difference. First operand 10805 states and 11090 transitions. Second operand 19 states. [2019-11-20 00:03:27,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:27,883 INFO L93 Difference]: Finished difference Result 32608 states and 33454 transitions. [2019-11-20 00:03:27,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-11-20 00:03:27,883 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 900 [2019-11-20 00:03:27,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:27,896 INFO L225 Difference]: With dead ends: 32608 [2019-11-20 00:03:27,897 INFO L226 Difference]: Without dead ends: 22104 [2019-11-20 00:03:27,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1033 GetRequests, 951 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2110 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1140, Invalid=5502, Unknown=0, NotChecked=0, Total=6642 [2019-11-20 00:03:27,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22104 states. [2019-11-20 00:03:28,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22104 to 10803. [2019-11-20 00:03:28,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10803 states. [2019-11-20 00:03:28,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10803 states to 10803 states and 11049 transitions. [2019-11-20 00:03:28,023 INFO L78 Accepts]: Start accepts. Automaton has 10803 states and 11049 transitions. Word has length 900 [2019-11-20 00:03:28,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:28,024 INFO L462 AbstractCegarLoop]: Abstraction has 10803 states and 11049 transitions. [2019-11-20 00:03:28,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-20 00:03:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 10803 states and 11049 transitions. [2019-11-20 00:03:28,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 917 [2019-11-20 00:03:28,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:28,041 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 00:03:28,245 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:03:28,245 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:28,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:28,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1312472755, now seen corresponding path program 1 times [2019-11-20 00:03:28,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:28,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546453099] [2019-11-20 00:03:28,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1207 backedges. 724 proven. 0 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2019-11-20 00:03:29,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546453099] [2019-11-20 00:03:29,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:29,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 00:03:29,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414753097] [2019-11-20 00:03:29,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:03:29,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:29,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:03:29,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:03:29,286 INFO L87 Difference]: Start difference. First operand 10803 states and 11049 transitions. Second operand 5 states. [2019-11-20 00:03:31,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:31,031 INFO L93 Difference]: Finished difference Result 14400 states and 14709 transitions. [2019-11-20 00:03:31,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 00:03:31,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 916 [2019-11-20 00:03:31,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:31,045 INFO L225 Difference]: With dead ends: 14400 [2019-11-20 00:03:31,045 INFO L226 Difference]: Without dead ends: 14398 [2019-11-20 00:03:31,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:03:31,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14398 states. [2019-11-20 00:03:31,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14398 to 10504. [2019-11-20 00:03:31,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10504 states. [2019-11-20 00:03:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10504 states to 10504 states and 10732 transitions. [2019-11-20 00:03:31,130 INFO L78 Accepts]: Start accepts. Automaton has 10504 states and 10732 transitions. Word has length 916 [2019-11-20 00:03:31,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:31,131 INFO L462 AbstractCegarLoop]: Abstraction has 10504 states and 10732 transitions. [2019-11-20 00:03:31,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:03:31,131 INFO L276 IsEmpty]: Start isEmpty. Operand 10504 states and 10732 transitions. [2019-11-20 00:03:31,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 925 [2019-11-20 00:03:31,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:31,143 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:03:31,143 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:31,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:31,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1065104549, now seen corresponding path program 1 times [2019-11-20 00:03:31,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:31,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119189196] [2019-11-20 00:03:31,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:32,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1147 proven. 0 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-11-20 00:03:32,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119189196] [2019-11-20 00:03:32,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:32,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 00:03:32,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240937409] [2019-11-20 00:03:32,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 00:03:32,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:32,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 00:03:32,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:03:32,552 INFO L87 Difference]: Start difference. First operand 10504 states and 10732 transitions. Second operand 7 states. [2019-11-20 00:03:33,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:33,732 INFO L93 Difference]: Finished difference Result 20792 states and 21246 transitions. [2019-11-20 00:03:33,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 00:03:33,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 924 [2019-11-20 00:03:33,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:33,739 INFO L225 Difference]: With dead ends: 20792 [2019-11-20 00:03:33,739 INFO L226 Difference]: Without dead ends: 10589 [2019-11-20 00:03:33,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-20 00:03:33,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10589 states. [2019-11-20 00:03:33,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10589 to 10203. [2019-11-20 00:03:33,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10203 states. [2019-11-20 00:03:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10203 states to 10203 states and 10427 transitions. [2019-11-20 00:03:33,814 INFO L78 Accepts]: Start accepts. Automaton has 10203 states and 10427 transitions. Word has length 924 [2019-11-20 00:03:33,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:33,814 INFO L462 AbstractCegarLoop]: Abstraction has 10203 states and 10427 transitions. [2019-11-20 00:03:33,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 00:03:33,814 INFO L276 IsEmpty]: Start isEmpty. Operand 10203 states and 10427 transitions. [2019-11-20 00:03:33,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 981 [2019-11-20 00:03:33,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:33,828 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 00:03:33,828 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:33,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:33,829 INFO L82 PathProgramCache]: Analyzing trace with hash -2073923035, now seen corresponding path program 1 times [2019-11-20 00:03:33,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:33,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116914344] [2019-11-20 00:03:33,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:34,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2019-11-20 00:03:34,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116914344] [2019-11-20 00:03:34,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:34,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:03:34,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718824790] [2019-11-20 00:03:34,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:03:34,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:34,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:03:34,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:03:34,632 INFO L87 Difference]: Start difference. First operand 10203 states and 10427 transitions. Second operand 4 states. [2019-11-20 00:03:35,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:35,987 INFO L93 Difference]: Finished difference Result 23402 states and 23899 transitions. [2019-11-20 00:03:35,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:03:35,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 980 [2019-11-20 00:03:35,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:35,995 INFO L225 Difference]: With dead ends: 23402 [2019-11-20 00:03:35,995 INFO L226 Difference]: Without dead ends: 13201 [2019-11-20 00:03:35,999 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 00:03:36,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13201 states. [2019-11-20 00:03:36,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13201 to 10200. [2019-11-20 00:03:36,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10200 states. [2019-11-20 00:03:36,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10200 states to 10200 states and 10400 transitions. [2019-11-20 00:03:36,081 INFO L78 Accepts]: Start accepts. Automaton has 10200 states and 10400 transitions. Word has length 980 [2019-11-20 00:03:36,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:36,081 INFO L462 AbstractCegarLoop]: Abstraction has 10200 states and 10400 transitions. [2019-11-20 00:03:36,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:03:36,082 INFO L276 IsEmpty]: Start isEmpty. Operand 10200 states and 10400 transitions. [2019-11-20 00:03:36,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1086 [2019-11-20 00:03:36,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:36,092 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:03:36,092 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:36,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:36,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1970281170, now seen corresponding path program 1 times [2019-11-20 00:03:36,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:36,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263845942] [2019-11-20 00:03:36,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:37,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1929 backedges. 964 proven. 0 refuted. 0 times theorem prover too weak. 965 trivial. 0 not checked. [2019-11-20 00:03:37,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263845942] [2019-11-20 00:03:37,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:37,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 00:03:37,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095831474] [2019-11-20 00:03:37,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:03:37,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:37,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:03:37,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:03:37,287 INFO L87 Difference]: Start difference. First operand 10200 states and 10400 transitions. Second operand 5 states. [2019-11-20 00:03:39,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:39,074 INFO L93 Difference]: Finished difference Result 23098 states and 23540 transitions. [2019-11-20 00:03:39,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 00:03:39,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1085 [2019-11-20 00:03:39,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:39,079 INFO L225 Difference]: With dead ends: 23098 [2019-11-20 00:03:39,079 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 00:03:39,085 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:03:39,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 00:03:39,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 00:03:39,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 00:03:39,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 00:03:39,086 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1085 [2019-11-20 00:03:39,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:39,086 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 00:03:39,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:03:39,087 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 00:03:39,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 00:03:39,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 00:03:40,223 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 564 DAG size of output: 408 [2019-11-20 00:03:41,139 WARN L191 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 564 DAG size of output: 408 [2019-11-20 00:03:41,453 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 386 DAG size of output: 298 [2019-11-20 00:03:44,611 WARN L191 SmtUtils]: Spent 3.15 s on a formula simplification. DAG size of input: 379 DAG size of output: 136 [2019-11-20 00:03:47,659 WARN L191 SmtUtils]: Spent 3.05 s on a formula simplification. DAG size of input: 379 DAG size of output: 136 [2019-11-20 00:03:49,584 WARN L191 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 279 DAG size of output: 130 [2019-11-20 00:03:49,589 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,589 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,589 INFO L444 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,589 INFO L444 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,589 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-20 00:03:49,589 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,589 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,590 INFO L444 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,590 INFO L444 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,590 INFO L444 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,590 INFO L444 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,590 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-20 00:03:49,590 INFO L444 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,590 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,590 INFO L444 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,590 INFO L444 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-20 00:03:49,590 INFO L444 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,590 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,590 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-20 00:03:49,590 INFO L444 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,590 INFO L444 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,590 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,590 INFO L444 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,590 INFO L444 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,590 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,590 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-20 00:03:49,591 INFO L444 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,591 INFO L444 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,591 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,591 INFO L444 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,591 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-20 00:03:49,591 INFO L444 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-20 00:03:49,591 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,591 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,591 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,591 INFO L444 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,591 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-20 00:03:49,591 INFO L444 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-20 00:03:49,591 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,591 INFO L444 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,591 INFO L444 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,591 INFO L444 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,591 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,591 INFO L444 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-20 00:03:49,591 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,591 INFO L444 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-20 00:03:49,591 INFO L444 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-20 00:03:49,591 INFO L444 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-20 00:03:49,592 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-20 00:03:49,592 INFO L444 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,592 INFO L444 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,592 INFO L444 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,592 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,592 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,592 INFO L444 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-20 00:03:49,592 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,592 INFO L444 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,592 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-20 00:03:49,592 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,592 INFO L444 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-20 00:03:49,592 INFO L444 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,592 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,592 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,592 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-20 00:03:49,592 INFO L444 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,592 INFO L444 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-20 00:03:49,592 INFO L444 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-20 00:03:49,592 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-20 00:03:49,592 INFO L444 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-20 00:03:49,592 INFO L444 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-20 00:03:49,593 INFO L444 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-20 00:03:49,593 INFO L444 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,593 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,593 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,593 INFO L444 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,593 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-20 00:03:49,593 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-20 00:03:49,593 INFO L444 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,593 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-20 00:03:49,593 INFO L444 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,593 INFO L444 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,593 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,593 INFO L444 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,593 INFO L444 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,593 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,593 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-20 00:03:49,593 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 00:03:49,594 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 190) no Hoare annotation was computed. [2019-11-20 00:03:49,594 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,594 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,594 INFO L444 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,594 INFO L444 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,594 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,594 INFO L444 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-20 00:03:49,594 INFO L444 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-20 00:03:49,594 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,594 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-20 00:03:49,594 INFO L444 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-20 00:03:49,595 INFO L444 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-20 00:03:49,595 INFO L444 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,595 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-20 00:03:49,595 INFO L444 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-20 00:03:49,595 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,595 INFO L444 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,595 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,595 INFO L444 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,595 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-20 00:03:49,596 INFO L444 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-20 00:03:49,596 INFO L444 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,596 INFO L444 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,596 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,596 INFO L444 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-20 00:03:49,596 INFO L444 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-20 00:03:49,596 INFO L444 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,596 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-20 00:03:49,597 INFO L444 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,597 INFO L444 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,597 INFO L444 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,597 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,597 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,597 INFO L444 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,597 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-20 00:03:49,598 INFO L444 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,598 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,598 INFO L444 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-20 00:03:49,598 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,598 INFO L444 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,598 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,598 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,598 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-20 00:03:49,599 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,599 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,599 INFO L444 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,599 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,599 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,599 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-20 00:03:49,599 INFO L444 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,600 INFO L444 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,600 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,600 INFO L444 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,600 INFO L444 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-20 00:03:49,600 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,600 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,600 INFO L444 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,600 INFO L444 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-20 00:03:49,601 INFO L444 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-20 00:03:49,601 INFO L444 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,601 INFO L444 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,601 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-20 00:03:49,601 INFO L444 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,601 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,601 INFO L444 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,602 INFO L444 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,602 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,602 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-20 00:03:49,602 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,602 INFO L444 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,602 INFO L444 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,602 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,603 INFO L444 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,603 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-20 00:03:49,603 INFO L444 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,603 INFO L444 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,603 INFO L444 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-20 00:03:49,603 INFO L444 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,603 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-20 00:03:49,603 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-20 00:03:49,604 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,604 INFO L444 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,604 INFO L444 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,604 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,604 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,604 INFO L444 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-20 00:03:49,604 INFO L444 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-20 00:03:49,605 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,605 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-20 00:03:49,605 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 00:03:49,605 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-20 00:03:49,605 INFO L444 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,605 INFO L444 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,605 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,605 INFO L444 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,606 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,606 INFO L444 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-20 00:03:49,606 INFO L444 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-20 00:03:49,606 INFO L444 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-20 00:03:49,606 INFO L444 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-20 00:03:49,606 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,606 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,607 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,607 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-20 00:03:49,607 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-20 00:03:49,607 INFO L444 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,607 INFO L444 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-20 00:03:49,607 INFO L444 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,607 INFO L444 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,608 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,608 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,608 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-20 00:03:49,608 INFO L444 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-20 00:03:49,608 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-20 00:03:49,608 INFO L444 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,608 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-20 00:03:49,608 INFO L444 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,609 INFO L444 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,609 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,609 INFO L444 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,609 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,609 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,609 INFO L444 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,609 INFO L444 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,610 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-20 00:03:49,610 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-20 00:03:49,610 INFO L444 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-20 00:03:49,610 INFO L444 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-20 00:03:49,610 INFO L444 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,610 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,610 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,610 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,611 INFO L440 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse29 (+ ~a4~0 86))) (let ((.cse8 (<= .cse29 0)) (.cse14 (<= 0 (+ ~a0~0 44))) (.cse30 (+ ~a0~0 98))) (let ((.cse20 (+ ~a0~0 147)) (.cse22 (= 4 ~a2~0)) (.cse12 (= 1 ~a2~0)) (.cse28 (+ ~a29~0 144)) (.cse21 (< 0 .cse30)) (.cse10 (<= (+ ~a4~0 42) 0)) (.cse23 (let ((.cse31 (not (= 5 ~a2~0)))) (or (and .cse8 .cse31) (and .cse31 .cse14)))) (.cse5 (= 2 ~a2~0))) (let ((.cse9 (and .cse10 .cse23 .cse5)) (.cse0 (and .cse8 .cse21)) (.cse3 (< 0 (+ ~a29~0 16))) (.cse19 (< 0 .cse28)) (.cse7 (< 43 ~a29~0)) (.cse4 (<= .cse30 0)) (.cse11 (< 0 .cse29)) (.cse15 (<= 0 .cse28)) (.cse18 (<= (+ ~a0~0 99) 0)) (.cse1 (not .cse12)) (.cse2 (not .cse22)) (.cse24 (= 3 ~a2~0)) (.cse13 (<= ~a29~0 43)) (.cse16 (<= .cse20 0)) (.cse6 (<= 0 (+ ~a0~0 600000))) (.cse17 (<= (+ ~a0~0 61) 0))) (or (and (and .cse0 .cse1 .cse2) .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse8 (not (= 3 ULTIMATE.start_calculate_output_~input)) (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse9) (and .cse10 .cse3 .cse11 .cse12 .cse13 .cse6) (and (<= (+ ~a4~0 89) 0) (and .cse12 .cse13) .cse14 (<= 0 (+ ~a29~0 127))) (and .cse9 .cse15) (and .cse10 .cse16 .cse5 .cse6) (and .cse0 .cse17) (and .cse6 .cse10 (= ~a2~0 1) .cse18 .cse19) (and .cse3 .cse6 (and .cse4 .cse10 .cse5)) (and .cse4 .cse10 .cse12 (< 0 .cse20)) (and .cse13 .cse17 .cse10 .cse12 .cse19 .cse21) (and .cse10 (<= (+ ~a29~0 17) 0) .cse16 (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse6 .cse22) (and .cse6 .cse7 .cse10 .cse18) (and .cse8 .cse16) (and .cse23 .cse17 .cse7) (and .cse10 .cse4 (not .cse5) .cse11 .cse1 .cse6 .cse2 .cse15) (and .cse10 .cse18 .cse24) (and (and .cse8 .cse1 .cse2) (<= 0 (+ ~a29~0 1))) (and .cse10 .cse13 .cse23 .cse24) (and .cse10 .cse23 .cse13 .cse22) (and (and .cse10 .cse16 (exists ((v_~a29~0_898 Int) (v_~a29~0_897 Int)) (let ((.cse25 (mod v_~a29~0_898 29))) (let ((.cse26 (mod v_~a29~0_897 299978)) (.cse27 (+ .cse25 14))) (and (= .cse25 0) (<= (+ .cse26 300022) v_~a29~0_898) (= 0 .cse26) (< 43 v_~a29~0_897) (= 0 (mod .cse25 5)) (<= 0 .cse27) (<= (div .cse27 5) ~a29~0)))))) .cse6) (and .cse23 .cse5 .cse17)))))) [2019-11-20 00:03:49,611 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-20 00:03:49,612 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-20 00:03:49,612 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,612 INFO L444 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,612 INFO L444 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,612 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,612 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,612 INFO L444 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,612 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,613 INFO L444 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-20 00:03:49,613 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,613 INFO L444 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-20 00:03:49,613 INFO L447 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-20 00:03:49,613 INFO L444 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,613 INFO L444 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-20 00:03:49,613 INFO L444 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-20 00:03:49,614 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-20 00:03:49,614 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-20 00:03:49,614 INFO L444 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,614 INFO L444 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,614 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,614 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,614 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,614 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-20 00:03:49,615 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-20 00:03:49,615 INFO L444 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,615 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-20 00:03:49,615 INFO L444 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-20 00:03:49,615 INFO L444 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,615 INFO L444 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,615 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,616 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,616 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,616 INFO L444 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,616 INFO L440 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse31 (+ ~a4~0 86))) (let ((.cse30 (+ ~a0~0 98)) (.cse0 (<= .cse31 0)) (.cse19 (<= 0 (+ ~a0~0 44)))) (let ((.cse25 (+ ~a0~0 147)) (.cse10 (<= (+ ~a4~0 42) 0)) (.cse29 (let ((.cse32 (not (= 5 ~a2~0)))) (or (and .cse0 .cse32) (and .cse32 .cse19)))) (.cse2 (= 2 ~a2~0)) (.cse26 (= 4 ~a2~0)) (.cse11 (= 1 ~a2~0)) (.cse16 (< 0 .cse30)) (.cse27 (+ ~a29~0 144))) (let ((.cse13 (< 0 .cse27)) (.cse6 (and .cse0 .cse16)) (.cse17 (< 0 .cse31)) (.cse7 (not .cse11)) (.cse8 (not .cse26)) (.cse5 (< 0 (+ ~a29~0 16))) (.cse1 (<= .cse30 0)) (.cse9 (and .cse10 .cse29 .cse2)) (.cse24 (<= 0 .cse27)) (.cse4 (<= 0 (+ ~a0~0 600000))) (.cse3 (< 43 ~a29~0)) (.cse20 (<= .cse25 0)) (.cse18 (or (and .cse11 .cse19) (and .cse0 .cse11))) (.cse12 (<= (+ ~a0~0 99) 0)) (.cse28 (= 3 ~a2~0)) (.cse14 (<= ~a29~0 43)) (.cse15 (<= (+ ~a0~0 61) 0))) (or (and (<= 0 (+ ~a29~0 1)) (and .cse0 .cse1)) (and (and (and .cse2 .cse3) .cse1) .cse4) (and .cse5 (and .cse6 .cse7 .cse8)) (and .cse0 (not (= 3 ULTIMATE.start_calculate_output_~input)) (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse9) (and .cse4 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse10 .cse11 .cse13 .cse16) (and .cse10 .cse5 .cse17 .cse11 .cse14 .cse4) (and (<= (+ ~a4~0 89) 0) (and .cse18 .cse14) .cse19 (<= 0 (+ ~a29~0 127))) (and (and .cse10 .cse20 (exists ((v_~a29~0_898 Int) (v_~a29~0_897 Int)) (let ((.cse21 (mod v_~a29~0_898 29))) (let ((.cse22 (mod v_~a29~0_897 299978)) (.cse23 (+ .cse21 14))) (and (= .cse21 0) (<= (+ .cse22 300022) v_~a29~0_898) (= 0 .cse22) (< 43 v_~a29~0_897) (= 0 (mod .cse21 5)) (<= 0 .cse23) (<= (div .cse23 5) ~a29~0)))))) .cse4) (and .cse6 .cse15) (and .cse10 .cse20 .cse4 .cse2) (and .cse10 .cse1 (not .cse2) .cse17 .cse7 .cse4 .cse8 .cse24) (and .cse1 .cse10 .cse11 (< 0 .cse25)) (and .cse5 (and (and .cse1 .cse10 .cse2) .cse4)) (and .cse10 (<= (+ ~a29~0 17) 0) .cse20 (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse4 .cse26) (and .cse9 .cse24) (and .cse4 .cse3 .cse10 .cse12) (and .cse0 .cse20) (and .cse0 .cse18 (<= .cse27 0)) (and .cse10 .cse12 .cse28) (and .cse10 .cse14 .cse29 .cse28) (and .cse10 .cse29 .cse14 .cse26) (and .cse29 .cse2 .cse15)))))) [2019-11-20 00:03:49,617 INFO L444 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,617 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-20 00:03:49,617 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-20 00:03:49,617 INFO L444 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,617 INFO L444 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,617 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,617 INFO L444 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,618 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,618 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,618 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-20 00:03:49,618 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-20 00:03:49,618 INFO L444 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,618 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,618 INFO L444 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-20 00:03:49,618 INFO L444 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,619 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,619 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,619 INFO L444 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,619 INFO L444 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,619 INFO L444 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,619 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-20 00:03:49,619 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-20 00:03:49,620 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,620 INFO L444 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,620 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,620 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,620 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,620 INFO L444 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,620 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 00:03:49,621 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-20 00:03:49,621 INFO L444 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,621 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-20 00:03:49,621 INFO L444 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,621 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,621 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,621 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,622 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,622 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,622 INFO L444 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,622 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-20 00:03:49,622 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-20 00:03:49,622 INFO L444 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,622 INFO L444 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,622 INFO L444 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,623 INFO L444 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,623 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,623 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,623 INFO L444 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,623 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-20 00:03:49,623 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-20 00:03:49,623 INFO L444 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,623 INFO L444 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,624 INFO L444 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,624 INFO L444 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,624 INFO L444 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,624 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,624 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,624 INFO L444 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-20 00:03:49,624 INFO L444 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-20 00:03:49,624 INFO L444 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,625 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-20 00:03:49,625 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-20 00:03:49,625 INFO L444 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,625 INFO L444 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,625 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,625 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,625 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,626 INFO L444 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,626 INFO L440 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse31 (+ ~a4~0 86))) (let ((.cse30 (+ ~a0~0 98)) (.cse0 (<= .cse31 0)) (.cse19 (<= 0 (+ ~a0~0 44)))) (let ((.cse25 (+ ~a0~0 147)) (.cse10 (<= (+ ~a4~0 42) 0)) (.cse29 (let ((.cse32 (not (= 5 ~a2~0)))) (or (and .cse0 .cse32) (and .cse32 .cse19)))) (.cse2 (= 2 ~a2~0)) (.cse26 (= 4 ~a2~0)) (.cse11 (= 1 ~a2~0)) (.cse16 (< 0 .cse30)) (.cse27 (+ ~a29~0 144))) (let ((.cse13 (< 0 .cse27)) (.cse6 (and .cse0 .cse16)) (.cse17 (< 0 .cse31)) (.cse7 (not .cse11)) (.cse8 (not .cse26)) (.cse5 (< 0 (+ ~a29~0 16))) (.cse1 (<= .cse30 0)) (.cse9 (and .cse10 .cse29 .cse2)) (.cse24 (<= 0 .cse27)) (.cse4 (<= 0 (+ ~a0~0 600000))) (.cse3 (< 43 ~a29~0)) (.cse20 (<= .cse25 0)) (.cse18 (or (and .cse11 .cse19) (and .cse0 .cse11))) (.cse12 (<= (+ ~a0~0 99) 0)) (.cse28 (= 3 ~a2~0)) (.cse14 (<= ~a29~0 43)) (.cse15 (<= (+ ~a0~0 61) 0))) (or (and (<= 0 (+ ~a29~0 1)) (and .cse0 .cse1)) (and (and (and .cse2 .cse3) .cse1) .cse4) (and .cse5 (and .cse6 .cse7 .cse8)) (and .cse0 (not (= 3 ULTIMATE.start_calculate_output_~input)) (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse9) (and .cse4 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse10 .cse11 .cse13 .cse16) (and .cse10 .cse5 .cse17 .cse11 .cse14 .cse4) (and (<= (+ ~a4~0 89) 0) (and .cse18 .cse14) .cse19 (<= 0 (+ ~a29~0 127))) (and (and .cse10 .cse20 (exists ((v_~a29~0_898 Int) (v_~a29~0_897 Int)) (let ((.cse21 (mod v_~a29~0_898 29))) (let ((.cse22 (mod v_~a29~0_897 299978)) (.cse23 (+ .cse21 14))) (and (= .cse21 0) (<= (+ .cse22 300022) v_~a29~0_898) (= 0 .cse22) (< 43 v_~a29~0_897) (= 0 (mod .cse21 5)) (<= 0 .cse23) (<= (div .cse23 5) ~a29~0)))))) .cse4) (and .cse6 .cse15) (and .cse10 .cse20 .cse4 .cse2) (and .cse10 .cse1 (not .cse2) .cse17 .cse7 .cse4 .cse8 .cse24) (and .cse1 .cse10 .cse11 (< 0 .cse25)) (and .cse5 (and (and .cse1 .cse10 .cse2) .cse4)) (and .cse10 (<= (+ ~a29~0 17) 0) .cse20 (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse4 .cse26) (and .cse9 .cse24) (and .cse4 .cse3 .cse10 .cse12) (and .cse0 .cse20) (and .cse0 .cse18 (<= .cse27 0)) (and .cse10 .cse12 .cse28) (and .cse10 .cse14 .cse29 .cse28) (and .cse10 .cse29 .cse14 .cse26) (and .cse29 .cse2 .cse15)))))) [2019-11-20 00:03:49,626 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-20 00:03:49,626 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-20 00:03:49,626 INFO L444 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,627 INFO L444 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,627 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,627 INFO L444 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,627 INFO L444 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,627 INFO L444 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,627 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,627 INFO L444 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,628 INFO L444 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-20 00:03:49,628 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-20 00:03:49,628 INFO L444 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,628 INFO L444 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-20 00:03:49,628 INFO L444 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-20 00:03:49,628 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,628 INFO L444 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,628 INFO L444 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,629 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,629 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,629 INFO L444 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-20 00:03:49,629 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-20 00:03:49,629 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,629 INFO L444 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,629 INFO L444 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,629 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,630 INFO L444 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-20 00:03:49,630 INFO L444 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-20 00:03:49,630 INFO L444 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-20 00:03:49,630 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,630 INFO L444 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-20 00:03:49,630 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-20 00:03:49,630 INFO L444 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,630 INFO L444 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,631 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,631 INFO L444 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,631 INFO L444 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,631 INFO L444 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,631 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,631 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-20 00:03:49,631 INFO L444 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-20 00:03:49,631 INFO L444 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,632 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,632 INFO L444 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,632 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-20 00:03:49,632 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,632 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 00:03:49,632 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,632 INFO L444 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-20 00:03:49,633 INFO L444 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,633 INFO L444 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,633 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,633 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,633 INFO L444 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,633 INFO L444 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,633 INFO L444 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,633 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-20 00:03:49,634 INFO L444 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-20 00:03:49,634 INFO L444 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,634 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-20 00:03:49,634 INFO L444 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,634 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,634 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,634 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-20 00:03:49,634 INFO L444 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,635 INFO L444 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,635 INFO L444 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,635 INFO L444 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,635 INFO L444 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-20 00:03:49,635 INFO L444 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,635 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,635 INFO L444 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-20 00:03:49,635 INFO L444 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-20 00:03:49,636 INFO L444 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,636 INFO L444 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,636 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,636 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-20 00:03:49,636 INFO L444 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,636 INFO L444 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,636 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,637 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,637 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,637 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-20 00:03:49,637 INFO L444 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,637 INFO L444 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,637 INFO L444 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-20 00:03:49,637 INFO L444 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-20 00:03:49,637 INFO L444 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,638 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 00:03:49,638 INFO L444 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-20 00:03:49,638 INFO L444 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,638 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-20 00:03:49,638 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,638 INFO L444 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-20 00:03:49,638 INFO L444 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-20 00:03:49,638 INFO L444 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,639 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,639 INFO L444 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-20 00:03:49,639 INFO L444 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-20 00:03:49,639 INFO L444 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-20 00:03:49,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:03:49 BoogieIcfgContainer [2019-11-20 00:03:49,695 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 00:03:49,695 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:03:49,695 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:03:49,696 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:03:49,696 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:01:49" (3/4) ... [2019-11-20 00:03:49,699 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 00:03:49,732 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-20 00:03:49,735 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 00:03:49,763 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((0 <= a29 + 1 && a4 + 86 <= 0 && a0 + 98 <= 0) || (((2 == a2 && 43 < a29) && a0 + 98 <= 0) && 0 <= a0 + 600000)) || (0 < a29 + 16 && ((a4 + 86 <= 0 && 0 < a0 + 98) && !(1 == a2)) && !(4 == a2))) || (((a4 + 86 <= 0 && !(3 == input)) && !(4 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || ((((0 <= a0 + 600000 && a4 + 42 <= 0) && 1 == a2) && a0 + 99 <= 0) && 0 < a29 + 144)) || (((((a29 <= 43 && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144) && 0 < a0 + 98)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a0 + 600000)) || (((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a29 <= 43) && 0 <= a0 + 44) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && (\exists v_~a29~0_898 : int, v_~a29~0_897 : int :: (((((v_~a29~0_898 % 29 == 0 && v_~a29~0_897 % 299978 + 300022 <= v_~a29~0_898) && 0 == v_~a29~0_897 % 299978) && 43 < v_~a29~0_897) && 0 == v_~a29~0_898 % 29 % 5) && 0 <= v_~a29~0_898 % 29 + 14) && (v_~a29~0_898 % 29 + 14) / 5 <= a29)) && 0 <= a0 + 600000)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 0 <= a0 + 600000) && 2 == a2)) || (((((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(2 == a2)) && 0 < a4 + 86) && !(1 == a2)) && 0 <= a0 + 600000) && !(4 == a2)) && 0 <= a29 + 144)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || (0 < a29 + 16 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 0 <= a0 + 600000)) || (((((a4 + 42 <= 0 && a29 + 17 <= 0) && a0 + 147 <= 0) && !(5 == input)) && 0 <= a0 + 600000) && 4 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 <= a29 + 144)) || (((0 <= a0 + 600000 && 43 < a29) && a4 + 42 <= 0) && a0 + 99 <= 0)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0) [2019-11-20 00:03:49,766 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((0 <= a29 + 1 && a4 + 86 <= 0 && a0 + 98 <= 0) || (((2 == a2 && 43 < a29) && a0 + 98 <= 0) && 0 <= a0 + 600000)) || (0 < a29 + 16 && ((a4 + 86 <= 0 && 0 < a0 + 98) && !(1 == a2)) && !(4 == a2))) || (((a4 + 86 <= 0 && !(3 == input)) && !(4 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || ((((0 <= a0 + 600000 && a4 + 42 <= 0) && 1 == a2) && a0 + 99 <= 0) && 0 < a29 + 144)) || (((((a29 <= 43 && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144) && 0 < a0 + 98)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a0 + 600000)) || (((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a29 <= 43) && 0 <= a0 + 44) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && (\exists v_~a29~0_898 : int, v_~a29~0_897 : int :: (((((v_~a29~0_898 % 29 == 0 && v_~a29~0_897 % 299978 + 300022 <= v_~a29~0_898) && 0 == v_~a29~0_897 % 299978) && 43 < v_~a29~0_897) && 0 == v_~a29~0_898 % 29 % 5) && 0 <= v_~a29~0_898 % 29 + 14) && (v_~a29~0_898 % 29 + 14) / 5 <= a29)) && 0 <= a0 + 600000)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 0 <= a0 + 600000) && 2 == a2)) || (((((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(2 == a2)) && 0 < a4 + 86) && !(1 == a2)) && 0 <= a0 + 600000) && !(4 == a2)) && 0 <= a29 + 144)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || (0 < a29 + 16 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 0 <= a0 + 600000)) || (((((a4 + 42 <= 0 && a29 + 17 <= 0) && a0 + 147 <= 0) && !(5 == input)) && 0 <= a0 + 600000) && 4 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 <= a29 + 144)) || (((0 <= a0 + 600000 && 43 < a29) && a4 + 42 <= 0) && a0 + 99 <= 0)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0) [2019-11-20 00:03:49,776 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((a4 + 86 <= 0 && 0 < a0 + 98) && !(1 == a2)) && !(4 == a2)) && 0 < a29 + 16) || (((a0 + 98 <= 0 && 2 == a2) && 0 <= a0 + 600000) && 43 < a29)) || (((a4 + 86 <= 0 && !(3 == input)) && !(4 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a0 + 600000)) || (((a4 + 89 <= 0 && 1 == a2 && a29 <= 43) && 0 <= a0 + 44) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 <= a29 + 144)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2) && 0 <= a0 + 600000)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || ((((0 <= a0 + 600000 && a4 + 42 <= 0) && a2 == 1) && a0 + 99 <= 0) && 0 < a29 + 144)) || ((0 < a29 + 16 && 0 <= a0 + 600000) && (a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || (((((a29 <= 43 && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144) && 0 < a0 + 98)) || (((((a4 + 42 <= 0 && a29 + 17 <= 0) && a0 + 147 <= 0) && !(5 == input)) && 0 <= a0 + 600000) && 4 == a2)) || (((0 <= a0 + 600000 && 43 < a29) && a4 + 42 <= 0) && a0 + 99 <= 0)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && a0 + 61 <= 0) && 43 < a29)) || (((((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(2 == a2)) && 0 < a4 + 86) && !(1 == a2)) && 0 <= a0 + 600000) && !(4 == a2)) && 0 <= a29 + 144)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || (((a4 + 86 <= 0 && !(1 == a2)) && !(4 == a2)) && 0 <= a29 + 1)) || (((a4 + 42 <= 0 && a29 <= 43) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && (\exists v_~a29~0_898 : int, v_~a29~0_897 : int :: (((((v_~a29~0_898 % 29 == 0 && v_~a29~0_897 % 299978 + 300022 <= v_~a29~0_898) && 0 == v_~a29~0_897 % 299978) && 43 < v_~a29~0_897) && 0 == v_~a29~0_898 % 29 % 5) && 0 <= v_~a29~0_898 % 29 + 14) && (v_~a29~0_898 % 29 + 14) / 5 <= a29)) && 0 <= a0 + 600000)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0) [2019-11-20 00:03:49,929 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5c1a6604-1981-4525-a94e-aecb6548c86f/bin/uautomizer/witness.graphml [2019-11-20 00:03:49,929 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:03:49,930 INFO L168 Benchmark]: Toolchain (without parser) took 125813.43 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 937.9 MB in the beginning and 1.9 GB in the end (delta: -975.4 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-11-20 00:03:49,930 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 964.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:03:49,931 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1453.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -126.3 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:03:49,931 INFO L168 Benchmark]: Boogie Procedure Inliner took 190.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-11-20 00:03:49,931 INFO L168 Benchmark]: Boogie Preprocessor took 171.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 999.7 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2019-11-20 00:03:49,932 INFO L168 Benchmark]: RCFGBuilder took 4035.42 ms. Allocated memory is still 1.2 GB. Free memory was 999.7 MB in the beginning and 925.2 MB in the end (delta: 74.5 MB). Peak memory consumption was 155.9 MB. Max. memory is 11.5 GB. [2019-11-20 00:03:49,932 INFO L168 Benchmark]: TraceAbstraction took 119725.50 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 922.0 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2019-11-20 00:03:49,932 INFO L168 Benchmark]: Witness Printer took 233.79 ms. Allocated memory is still 4.2 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 85.2 MB). Peak memory consumption was 85.2 MB. Max. memory is 11.5 GB. [2019-11-20 00:03:49,934 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 964.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1453.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -126.3 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 190.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 171.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 999.7 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4035.42 ms. Allocated memory is still 1.2 GB. Free memory was 999.7 MB in the beginning and 925.2 MB in the end (delta: 74.5 MB). Peak memory consumption was 155.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 119725.50 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 922.0 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. * Witness Printer took 233.79 ms. Allocated memory is still 4.2 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 85.2 MB). Peak memory consumption was 85.2 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_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 190]: 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: 1766]: Loop Invariant [2019-11-20 00:03:49,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((0 <= a29 + 1 && a4 + 86 <= 0 && a0 + 98 <= 0) || (((2 == a2 && 43 < a29) && a0 + 98 <= 0) && 0 <= a0 + 600000)) || (0 < a29 + 16 && ((a4 + 86 <= 0 && 0 < a0 + 98) && !(1 == a2)) && !(4 == a2))) || (((a4 + 86 <= 0 && !(3 == input)) && !(4 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || ((((0 <= a0 + 600000 && a4 + 42 <= 0) && 1 == a2) && a0 + 99 <= 0) && 0 < a29 + 144)) || (((((a29 <= 43 && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144) && 0 < a0 + 98)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a0 + 600000)) || (((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a29 <= 43) && 0 <= a0 + 44) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && (\exists v_~a29~0_898 : int, v_~a29~0_897 : int :: (((((v_~a29~0_898 % 29 == 0 && v_~a29~0_897 % 299978 + 300022 <= v_~a29~0_898) && 0 == v_~a29~0_897 % 299978) && 43 < v_~a29~0_897) && 0 == v_~a29~0_898 % 29 % 5) && 0 <= v_~a29~0_898 % 29 + 14) && (v_~a29~0_898 % 29 + 14) / 5 <= a29)) && 0 <= a0 + 600000)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 0 <= a0 + 600000) && 2 == a2)) || (((((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(2 == a2)) && 0 < a4 + 86) && !(1 == a2)) && 0 <= a0 + 600000) && !(4 == a2)) && 0 <= a29 + 144)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || (0 < a29 + 16 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 0 <= a0 + 600000)) || (((((a4 + 42 <= 0 && a29 + 17 <= 0) && a0 + 147 <= 0) && !(5 == input)) && 0 <= a0 + 600000) && 4 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 <= a29 + 144)) || (((0 <= a0 + 600000 && 43 < a29) && a4 + 42 <= 0) && a0 + 99 <= 0)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0) - InvariantResult [Line: 23]: Loop Invariant [2019-11-20 00:03:49,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((0 <= a29 + 1 && a4 + 86 <= 0 && a0 + 98 <= 0) || (((2 == a2 && 43 < a29) && a0 + 98 <= 0) && 0 <= a0 + 600000)) || (0 < a29 + 16 && ((a4 + 86 <= 0 && 0 < a0 + 98) && !(1 == a2)) && !(4 == a2))) || (((a4 + 86 <= 0 && !(3 == input)) && !(4 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || ((((0 <= a0 + 600000 && a4 + 42 <= 0) && 1 == a2) && a0 + 99 <= 0) && 0 < a29 + 144)) || (((((a29 <= 43 && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144) && 0 < a0 + 98)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a0 + 600000)) || (((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a29 <= 43) && 0 <= a0 + 44) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && (\exists v_~a29~0_898 : int, v_~a29~0_897 : int :: (((((v_~a29~0_898 % 29 == 0 && v_~a29~0_897 % 299978 + 300022 <= v_~a29~0_898) && 0 == v_~a29~0_897 % 299978) && 43 < v_~a29~0_897) && 0 == v_~a29~0_898 % 29 % 5) && 0 <= v_~a29~0_898 % 29 + 14) && (v_~a29~0_898 % 29 + 14) / 5 <= a29)) && 0 <= a0 + 600000)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 0 <= a0 + 600000) && 2 == a2)) || (((((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(2 == a2)) && 0 < a4 + 86) && !(1 == a2)) && 0 <= a0 + 600000) && !(4 == a2)) && 0 <= a29 + 144)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || (0 < a29 + 16 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 0 <= a0 + 600000)) || (((((a4 + 42 <= 0 && a29 + 17 <= 0) && a0 + 147 <= 0) && !(5 == input)) && 0 <= a0 + 600000) && 4 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 <= a29 + 144)) || (((0 <= a0 + 600000 && 43 < a29) && a4 + 42 <= 0) && a0 + 99 <= 0)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-20 00:03:49,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-20 00:03:49,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-20 00:03:49,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((a4 + 86 <= 0 && 0 < a0 + 98) && !(1 == a2)) && !(4 == a2)) && 0 < a29 + 16) || (((a0 + 98 <= 0 && 2 == a2) && 0 <= a0 + 600000) && 43 < a29)) || (((a4 + 86 <= 0 && !(3 == input)) && !(4 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a0 + 600000)) || (((a4 + 89 <= 0 && 1 == a2 && a29 <= 43) && 0 <= a0 + 44) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 <= a29 + 144)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2) && 0 <= a0 + 600000)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || ((((0 <= a0 + 600000 && a4 + 42 <= 0) && a2 == 1) && a0 + 99 <= 0) && 0 < a29 + 144)) || ((0 < a29 + 16 && 0 <= a0 + 600000) && (a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || (((((a29 <= 43 && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144) && 0 < a0 + 98)) || (((((a4 + 42 <= 0 && a29 + 17 <= 0) && a0 + 147 <= 0) && !(5 == input)) && 0 <= a0 + 600000) && 4 == a2)) || (((0 <= a0 + 600000 && 43 < a29) && a4 + 42 <= 0) && a0 + 99 <= 0)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && a0 + 61 <= 0) && 43 < a29)) || (((((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(2 == a2)) && 0 < a4 + 86) && !(1 == a2)) && 0 <= a0 + 600000) && !(4 == a2)) && 0 <= a29 + 144)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || (((a4 + 86 <= 0 && !(1 == a2)) && !(4 == a2)) && 0 <= a29 + 1)) || (((a4 + 42 <= 0 && a29 <= 43) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && (\exists v_~a29~0_898 : int, v_~a29~0_897 : int :: (((((v_~a29~0_898 % 29 == 0 && v_~a29~0_897 % 299978 + 300022 <= v_~a29~0_898) && 0 == v_~a29~0_897 % 299978) && 43 < v_~a29~0_897) && 0 == v_~a29~0_898 % 29 % 5) && 0 <= v_~a29~0_898 % 29 + 14) && (v_~a29~0_898 % 29 + 14) / 5 <= a29)) && 0 <= a0 + 600000)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Result: SAFE, OverallTime: 119.6s, OverallIterations: 21, TraceHistogramMax: 6, AutomataDifference: 79.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.4s, HoareTripleCheckerStatistics: 5742 SDtfs, 23571 SDslu, 1438 SDs, 0 SdLazy, 52360 SolverSat, 5173 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 65.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3929 GetRequests, 3762 SyntacticMatches, 18 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2186 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12039occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 26995 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 196 NumberOfFragments, 1902 HoareAnnotationTreeSize, 4 FomulaSimplifications, 296891 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 4 FomulaSimplificationsInter, 110882 FormulaSimplificationTreeSizeReductionInter, 8.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 16815 NumberOfCodeBlocks, 16815 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 16788 ConstructedInterpolants, 422 QuantifiedInterpolants, 56383663 SizeOfPredicates, 6 NumberOfNonLiveVariables, 4434 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 27 InterpolantComputations, 19 PerfectInterpolantSequences, 20248/21769 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...