./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label30.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d9d78236-16b1-4b5b-a1df-ae223e78dc70/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d9d78236-16b1-4b5b-a1df-ae223e78dc70/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d9d78236-16b1-4b5b-a1df-ae223e78dc70/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d9d78236-16b1-4b5b-a1df-ae223e78dc70/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label30.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d9d78236-16b1-4b5b-a1df-ae223e78dc70/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d9d78236-16b1-4b5b-a1df-ae223e78dc70/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 8d242fd154f76fbbdca66276c5caf34f74dcc939 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:29:18,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:29:18,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:29:18,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:29:18,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:29:18,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:29:18,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:29:18,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:29:18,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:29:18,242 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:29:18,243 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:29:18,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:29:18,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:29:18,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:29:18,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:29:18,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:29:18,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:29:18,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:29:18,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:29:18,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:29:18,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:29:18,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:29:18,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:29:18,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:29:18,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:29:18,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:29:18,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:29:18,257 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:29:18,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:29:18,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:29:18,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:29:18,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:29:18,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:29:18,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:29:18,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:29:18,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:29:18,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:29:18,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:29:18,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:29:18,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:29:18,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:29:18,263 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d9d78236-16b1-4b5b-a1df-ae223e78dc70/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:29:18,276 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:29:18,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:29:18,277 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:29:18,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:29:18,277 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:29:18,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:29:18,277 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:29:18,278 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:29:18,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:29:18,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:29:18,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:29:18,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:29:18,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:29:18,278 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:29:18,278 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:29:18,279 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:29:18,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:29:18,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:29:18,279 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:29:18,279 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:29:18,279 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:29:18,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:29:18,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:29:18,280 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:29:18,280 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:29:18,280 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:29:18,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:29:18,280 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:29:18,280 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:29:18,280 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_d9d78236-16b1-4b5b-a1df-ae223e78dc70/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 -> 8d242fd154f76fbbdca66276c5caf34f74dcc939 [2019-12-07 17:29:18,381 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:29:18,391 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:29:18,394 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:29:18,395 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:29:18,396 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:29:18,396 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d9d78236-16b1-4b5b-a1df-ae223e78dc70/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label30.c [2019-12-07 17:29:18,439 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d9d78236-16b1-4b5b-a1df-ae223e78dc70/bin/uautomizer/data/e73b8c569/aefa1b2f743b421394c60aa41fc586e8/FLAG13ef8e5d5 [2019-12-07 17:29:18,905 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:29:18,906 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d9d78236-16b1-4b5b-a1df-ae223e78dc70/sv-benchmarks/c/eca-rers2012/Problem11_label30.c [2019-12-07 17:29:18,917 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d9d78236-16b1-4b5b-a1df-ae223e78dc70/bin/uautomizer/data/e73b8c569/aefa1b2f743b421394c60aa41fc586e8/FLAG13ef8e5d5 [2019-12-07 17:29:18,926 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d9d78236-16b1-4b5b-a1df-ae223e78dc70/bin/uautomizer/data/e73b8c569/aefa1b2f743b421394c60aa41fc586e8 [2019-12-07 17:29:18,928 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:29:18,929 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:29:18,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:29:18,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:29:18,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:29:18,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:29:18" (1/1) ... [2019-12-07 17:29:18,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f60ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:18, skipping insertion in model container [2019-12-07 17:29:18,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:29:18" (1/1) ... [2019-12-07 17:29:18,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:29:18,981 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:29:19,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:29:19,299 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:29:19,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:29:19,397 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:29:19,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19 WrapperNode [2019-12-07 17:29:19,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:29:19,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:29:19,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:29:19,399 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:29:19,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19" (1/1) ... [2019-12-07 17:29:19,418 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19" (1/1) ... [2019-12-07 17:29:19,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:29:19,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:29:19,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:29:19,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:29:19,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19" (1/1) ... [2019-12-07 17:29:19,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19" (1/1) ... [2019-12-07 17:29:19,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19" (1/1) ... [2019-12-07 17:29:19,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19" (1/1) ... [2019-12-07 17:29:19,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19" (1/1) ... [2019-12-07 17:29:19,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19" (1/1) ... [2019-12-07 17:29:19,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19" (1/1) ... [2019-12-07 17:29:19,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:29:19,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:29:19,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:29:19,574 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:29:19,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9d78236-16b1-4b5b-a1df-ae223e78dc70/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:29:19,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:29:19,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:29:20,634 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:29:20,634 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 17:29:20,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:29:20 BoogieIcfgContainer [2019-12-07 17:29:20,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:29:20,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:29:20,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:29:20,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:29:20,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:29:18" (1/3) ... [2019-12-07 17:29:20,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21635dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:29:20, skipping insertion in model container [2019-12-07 17:29:20,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19" (2/3) ... [2019-12-07 17:29:20,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21635dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:29:20, skipping insertion in model container [2019-12-07 17:29:20,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:29:20" (3/3) ... [2019-12-07 17:29:20,642 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label30.c [2019-12-07 17:29:20,651 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:29:20,658 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:29:20,669 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:29:20,693 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:29:20,694 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:29:20,694 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:29:20,694 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:29:20,694 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:29:20,694 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:29:20,694 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:29:20,694 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:29:20,712 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-12-07 17:29:20,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 17:29:20,717 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:20,718 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] [2019-12-07 17:29:20,718 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:20,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:20,722 INFO L82 PathProgramCache]: Analyzing trace with hash -748286455, now seen corresponding path program 1 times [2019-12-07 17:29:20,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:20,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966285037] [2019-12-07 17:29:20,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:20,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966285037] [2019-12-07 17:29:20,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:20,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:29:20,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466038369] [2019-12-07 17:29:20,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:29:20,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:20,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:29:20,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:29:20,927 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-12-07 17:29:22,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:22,124 INFO L93 Difference]: Finished difference Result 973 states and 1743 transitions. [2019-12-07 17:29:22,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:29:22,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-07 17:29:22,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:22,138 INFO L225 Difference]: With dead ends: 973 [2019-12-07 17:29:22,138 INFO L226 Difference]: Without dead ends: 607 [2019-12-07 17:29:22,142 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-12-07 17:29:22,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-12-07 17:29:22,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 604. [2019-12-07 17:29:22,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-07 17:29:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 874 transitions. [2019-12-07 17:29:22,194 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 874 transitions. Word has length 29 [2019-12-07 17:29:22,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:22,194 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 874 transitions. [2019-12-07 17:29:22,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:29:22,194 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 874 transitions. [2019-12-07 17:29:22,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 17:29:22,197 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:22,198 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:29:22,198 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:22,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:22,198 INFO L82 PathProgramCache]: Analyzing trace with hash -618924976, now seen corresponding path program 1 times [2019-12-07 17:29:22,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:22,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350416743] [2019-12-07 17:29:22,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:22,290 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:22,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350416743] [2019-12-07 17:29:22,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:22,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:29:22,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399272109] [2019-12-07 17:29:22,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:29:22,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:22,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:29:22,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:29:22,293 INFO L87 Difference]: Start difference. First operand 604 states and 874 transitions. Second operand 4 states. [2019-12-07 17:29:23,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:23,321 INFO L93 Difference]: Finished difference Result 2328 states and 3390 transitions. [2019-12-07 17:29:23,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:29:23,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 17:29:23,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:23,329 INFO L225 Difference]: With dead ends: 2328 [2019-12-07 17:29:23,329 INFO L226 Difference]: Without dead ends: 1726 [2019-12-07 17:29:23,332 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-12-07 17:29:23,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-12-07 17:29:23,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1710. [2019-12-07 17:29:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-12-07 17:29:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2342 transitions. [2019-12-07 17:29:23,369 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2342 transitions. Word has length 97 [2019-12-07 17:29:23,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:23,370 INFO L462 AbstractCegarLoop]: Abstraction has 1710 states and 2342 transitions. [2019-12-07 17:29:23,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:29:23,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2342 transitions. [2019-12-07 17:29:23,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 17:29:23,373 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:23,373 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:29:23,374 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:23,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:23,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1171000047, now seen corresponding path program 1 times [2019-12-07 17:29:23,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:23,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333956320] [2019-12-07 17:29:23,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:23,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333956320] [2019-12-07 17:29:23,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:23,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:29:23,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272997448] [2019-12-07 17:29:23,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:29:23,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:23,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:29:23,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:29:23,486 INFO L87 Difference]: Start difference. First operand 1710 states and 2342 transitions. Second operand 3 states. [2019-12-07 17:29:24,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:24,147 INFO L93 Difference]: Finished difference Result 4707 states and 6454 transitions. [2019-12-07 17:29:24,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:29:24,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-12-07 17:29:24,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:24,158 INFO L225 Difference]: With dead ends: 4707 [2019-12-07 17:29:24,159 INFO L226 Difference]: Without dead ends: 2999 [2019-12-07 17:29:24,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-07 17:29:24,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2019-12-07 17:29:24,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 2999. [2019-12-07 17:29:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2019-12-07 17:29:24,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 3735 transitions. [2019-12-07 17:29:24,202 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 3735 transitions. Word has length 123 [2019-12-07 17:29:24,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:24,203 INFO L462 AbstractCegarLoop]: Abstraction has 2999 states and 3735 transitions. [2019-12-07 17:29:24,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:29:24,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 3735 transitions. [2019-12-07 17:29:24,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 17:29:24,205 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:24,205 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:29:24,205 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:24,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:24,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1063098843, now seen corresponding path program 1 times [2019-12-07 17:29:24,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:24,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580796449] [2019-12-07 17:29:24,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:24,330 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 17:29:24,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580796449] [2019-12-07 17:29:24,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936601156] [2019-12-07 17:29:24,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9d78236-16b1-4b5b-a1df-ae223e78dc70/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:29:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:24,381 INFO L264 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:29:24,388 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:29:24,422 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 17:29:24,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:29:24,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-12-07 17:29:24,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303291926] [2019-12-07 17:29:24,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:29:24,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:24,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:29:24,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:29:24,424 INFO L87 Difference]: Start difference. First operand 2999 states and 3735 transitions. Second operand 3 states. [2019-12-07 17:29:25,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:25,093 INFO L93 Difference]: Finished difference Result 7658 states and 9369 transitions. [2019-12-07 17:29:25,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:29:25,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-12-07 17:29:25,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:25,110 INFO L225 Difference]: With dead ends: 7658 [2019-12-07 17:29:25,110 INFO L226 Difference]: Without dead ends: 4661 [2019-12-07 17:29:25,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 151 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-12-07 17:29:25,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4661 states. [2019-12-07 17:29:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4661 to 4660. [2019-12-07 17:29:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-12-07 17:29:25,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 5631 transitions. [2019-12-07 17:29:25,175 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 5631 transitions. Word has length 151 [2019-12-07 17:29:25,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:25,176 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 5631 transitions. [2019-12-07 17:29:25,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:29:25,176 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 5631 transitions. [2019-12-07 17:29:25,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 17:29:25,177 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:25,177 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:29:25,378 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:29:25,378 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:25,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:25,379 INFO L82 PathProgramCache]: Analyzing trace with hash 786326133, now seen corresponding path program 1 times [2019-12-07 17:29:25,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:25,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808317847] [2019-12-07 17:29:25,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:25,456 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:25,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808317847] [2019-12-07 17:29:25,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:25,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:29:25,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057073463] [2019-12-07 17:29:25,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:29:25,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:25,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:29:25,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:29:25,458 INFO L87 Difference]: Start difference. First operand 4660 states and 5631 transitions. Second operand 4 states. [2019-12-07 17:29:26,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:26,791 INFO L93 Difference]: Finished difference Result 10812 states and 13165 transitions. [2019-12-07 17:29:26,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:29:26,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-12-07 17:29:26,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:26,822 INFO L225 Difference]: With dead ends: 10812 [2019-12-07 17:29:26,822 INFO L226 Difference]: Without dead ends: 6338 [2019-12-07 17:29:26,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:29:26,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6338 states. [2019-12-07 17:29:26,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6338 to 5948. [2019-12-07 17:29:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5948 states. [2019-12-07 17:29:26,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5948 states to 5948 states and 7113 transitions. [2019-12-07 17:29:26,912 INFO L78 Accepts]: Start accepts. Automaton has 5948 states and 7113 transitions. Word has length 156 [2019-12-07 17:29:26,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:26,913 INFO L462 AbstractCegarLoop]: Abstraction has 5948 states and 7113 transitions. [2019-12-07 17:29:26,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:29:26,913 INFO L276 IsEmpty]: Start isEmpty. Operand 5948 states and 7113 transitions. [2019-12-07 17:29:26,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-12-07 17:29:26,917 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:26,917 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 17:29:26,917 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:26,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:26,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1660657955, now seen corresponding path program 1 times [2019-12-07 17:29:26,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:26,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531401232] [2019-12-07 17:29:26,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:27,180 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:27,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531401232] [2019-12-07 17:29:27,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228033959] [2019-12-07 17:29:27,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9d78236-16b1-4b5b-a1df-ae223e78dc70/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:29:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:27,253 INFO L264 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:29:27,260 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:29:27,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:29:27,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:29:27,569 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 53 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:27,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:29:27,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2019-12-07 17:29:27,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002273658] [2019-12-07 17:29:27,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:29:27,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:27,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:29:27,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:29:27,571 INFO L87 Difference]: Start difference. First operand 5948 states and 7113 transitions. Second operand 9 states. [2019-12-07 17:29:37,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:37,873 INFO L93 Difference]: Finished difference Result 22413 states and 26718 transitions. [2019-12-07 17:29:37,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 17:29:37,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 241 [2019-12-07 17:29:37,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:37,917 INFO L225 Difference]: With dead ends: 22413 [2019-12-07 17:29:37,917 INFO L226 Difference]: Without dead ends: 15730 [2019-12-07 17:29:37,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2019-12-07 17:29:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15730 states. [2019-12-07 17:29:38,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15730 to 13135. [2019-12-07 17:29:38,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13135 states. [2019-12-07 17:29:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13135 states to 13135 states and 15300 transitions. [2019-12-07 17:29:38,056 INFO L78 Accepts]: Start accepts. Automaton has 13135 states and 15300 transitions. Word has length 241 [2019-12-07 17:29:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:38,057 INFO L462 AbstractCegarLoop]: Abstraction has 13135 states and 15300 transitions. [2019-12-07 17:29:38,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:29:38,057 INFO L276 IsEmpty]: Start isEmpty. Operand 13135 states and 15300 transitions. [2019-12-07 17:29:38,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-12-07 17:29:38,063 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:38,064 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:29:38,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:29:38,264 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:38,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:38,265 INFO L82 PathProgramCache]: Analyzing trace with hash 378186544, now seen corresponding path program 1 times [2019-12-07 17:29:38,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:38,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496091945] [2019-12-07 17:29:38,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:38,411 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-12-07 17:29:38,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496091945] [2019-12-07 17:29:38,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:38,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:29:38,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83779686] [2019-12-07 17:29:38,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:29:38,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:38,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:29:38,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:29:38,412 INFO L87 Difference]: Start difference. First operand 13135 states and 15300 transitions. Second operand 4 states. [2019-12-07 17:29:39,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:39,426 INFO L93 Difference]: Finished difference Result 29031 states and 34020 transitions. [2019-12-07 17:29:39,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:29:39,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2019-12-07 17:29:39,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:39,449 INFO L225 Difference]: With dead ends: 29031 [2019-12-07 17:29:39,449 INFO L226 Difference]: Without dead ends: 16266 [2019-12-07 17:29:39,458 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-12-07 17:29:39,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16266 states. [2019-12-07 17:29:39,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16266 to 14608. [2019-12-07 17:29:39,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14608 states. [2019-12-07 17:29:39,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14608 states to 14608 states and 16863 transitions. [2019-12-07 17:29:39,604 INFO L78 Accepts]: Start accepts. Automaton has 14608 states and 16863 transitions. Word has length 306 [2019-12-07 17:29:39,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:39,605 INFO L462 AbstractCegarLoop]: Abstraction has 14608 states and 16863 transitions. [2019-12-07 17:29:39,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:29:39,605 INFO L276 IsEmpty]: Start isEmpty. Operand 14608 states and 16863 transitions. [2019-12-07 17:29:39,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-12-07 17:29:39,612 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:39,613 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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-12-07 17:29:39,613 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:39,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:39,613 INFO L82 PathProgramCache]: Analyzing trace with hash -2019684113, now seen corresponding path program 1 times [2019-12-07 17:29:39,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:39,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017524892] [2019-12-07 17:29:39,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-12-07 17:29:39,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017524892] [2019-12-07 17:29:39,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:39,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:29:39,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196459187] [2019-12-07 17:29:39,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:29:39,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:39,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:29:39,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:29:39,799 INFO L87 Difference]: Start difference. First operand 14608 states and 16863 transitions. Second operand 4 states. [2019-12-07 17:29:40,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:40,810 INFO L93 Difference]: Finished difference Result 32002 states and 37013 transitions. [2019-12-07 17:29:40,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:29:40,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 311 [2019-12-07 17:29:40,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:40,824 INFO L225 Difference]: With dead ends: 32002 [2019-12-07 17:29:40,825 INFO L226 Difference]: Without dead ends: 17764 [2019-12-07 17:29:40,834 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-12-07 17:29:40,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17764 states. [2019-12-07 17:29:40,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17764 to 15896. [2019-12-07 17:29:40,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15896 states. [2019-12-07 17:29:40,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15896 states to 15896 states and 18199 transitions. [2019-12-07 17:29:40,968 INFO L78 Accepts]: Start accepts. Automaton has 15896 states and 18199 transitions. Word has length 311 [2019-12-07 17:29:40,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:40,969 INFO L462 AbstractCegarLoop]: Abstraction has 15896 states and 18199 transitions. [2019-12-07 17:29:40,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:29:40,969 INFO L276 IsEmpty]: Start isEmpty. Operand 15896 states and 18199 transitions. [2019-12-07 17:29:40,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-12-07 17:29:40,974 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:40,975 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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-12-07 17:29:40,975 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:40,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:40,975 INFO L82 PathProgramCache]: Analyzing trace with hash 586529090, now seen corresponding path program 1 times [2019-12-07 17:29:40,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:40,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769325513] [2019-12-07 17:29:40,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:41,156 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 17:29:41,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769325513] [2019-12-07 17:29:41,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:41,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:29:41,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488902846] [2019-12-07 17:29:41,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:29:41,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:41,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:29:41,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:29:41,157 INFO L87 Difference]: Start difference. First operand 15896 states and 18199 transitions. Second operand 4 states. [2019-12-07 17:29:42,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:42,037 INFO L93 Difference]: Finished difference Result 29964 states and 34514 transitions. [2019-12-07 17:29:42,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:29:42,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 315 [2019-12-07 17:29:42,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:42,051 INFO L225 Difference]: With dead ends: 29964 [2019-12-07 17:29:42,051 INFO L226 Difference]: Without dead ends: 17021 [2019-12-07 17:29:42,060 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-12-07 17:29:42,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17021 states. [2019-12-07 17:29:42,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17021 to 16453. [2019-12-07 17:29:42,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16453 states. [2019-12-07 17:29:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16453 states to 16453 states and 18773 transitions. [2019-12-07 17:29:42,180 INFO L78 Accepts]: Start accepts. Automaton has 16453 states and 18773 transitions. Word has length 315 [2019-12-07 17:29:42,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:42,180 INFO L462 AbstractCegarLoop]: Abstraction has 16453 states and 18773 transitions. [2019-12-07 17:29:42,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:29:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 16453 states and 18773 transitions. [2019-12-07 17:29:42,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-12-07 17:29:42,186 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:42,186 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:29:42,186 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:42,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:42,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1565769179, now seen corresponding path program 1 times [2019-12-07 17:29:42,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:42,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737451207] [2019-12-07 17:29:42,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-12-07 17:29:42,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737451207] [2019-12-07 17:29:42,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:42,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:29:42,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927762543] [2019-12-07 17:29:42,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:29:42,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:42,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:29:42,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:29:42,314 INFO L87 Difference]: Start difference. First operand 16453 states and 18773 transitions. Second operand 4 states. [2019-12-07 17:29:43,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:43,314 INFO L93 Difference]: Finished difference Result 34390 states and 39143 transitions. [2019-12-07 17:29:43,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:29:43,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-12-07 17:29:43,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:43,326 INFO L225 Difference]: With dead ends: 34390 [2019-12-07 17:29:43,326 INFO L226 Difference]: Without dead ends: 18123 [2019-12-07 17:29:43,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:29:43,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18123 states. [2019-12-07 17:29:43,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18123 to 16636. [2019-12-07 17:29:43,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16636 states. [2019-12-07 17:29:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16636 states to 16636 states and 18630 transitions. [2019-12-07 17:29:43,455 INFO L78 Accepts]: Start accepts. Automaton has 16636 states and 18630 transitions. Word has length 326 [2019-12-07 17:29:43,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:43,455 INFO L462 AbstractCegarLoop]: Abstraction has 16636 states and 18630 transitions. [2019-12-07 17:29:43,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:29:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 16636 states and 18630 transitions. [2019-12-07 17:29:43,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-12-07 17:29:43,461 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:43,461 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:29:43,461 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:43,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:43,461 INFO L82 PathProgramCache]: Analyzing trace with hash -139580508, now seen corresponding path program 1 times [2019-12-07 17:29:43,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:43,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916355530] [2019-12-07 17:29:43,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:43,656 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 276 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 17:29:43,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916355530] [2019-12-07 17:29:43,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129285645] [2019-12-07 17:29:43,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9d78236-16b1-4b5b-a1df-ae223e78dc70/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:29:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:43,728 INFO L264 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:29:43,733 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:29:43,831 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 17:29:43,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:29:43,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-12-07 17:29:43,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388677634] [2019-12-07 17:29:43,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:29:43,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:43,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:29:43,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:29:43,833 INFO L87 Difference]: Start difference. First operand 16636 states and 18630 transitions. Second operand 4 states. [2019-12-07 17:29:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:44,670 INFO L93 Difference]: Finished difference Result 33276 states and 37268 transitions. [2019-12-07 17:29:44,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:29:44,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 331 [2019-12-07 17:29:44,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:44,680 INFO L225 Difference]: With dead ends: 33276 [2019-12-07 17:29:44,680 INFO L226 Difference]: Without dead ends: 16642 [2019-12-07 17:29:44,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:29:44,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16642 states. [2019-12-07 17:29:44,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16642 to 15532. [2019-12-07 17:29:44,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15532 states. [2019-12-07 17:29:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15532 states to 15532 states and 17277 transitions. [2019-12-07 17:29:44,803 INFO L78 Accepts]: Start accepts. Automaton has 15532 states and 17277 transitions. Word has length 331 [2019-12-07 17:29:44,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:44,804 INFO L462 AbstractCegarLoop]: Abstraction has 15532 states and 17277 transitions. [2019-12-07 17:29:44,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:29:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 15532 states and 17277 transitions. [2019-12-07 17:29:44,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-12-07 17:29:44,809 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:44,809 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:29:45,010 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:29:45,010 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:45,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:45,011 INFO L82 PathProgramCache]: Analyzing trace with hash -2055586056, now seen corresponding path program 1 times [2019-12-07 17:29:45,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:45,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960051999] [2019-12-07 17:29:45,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:45,310 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 211 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:45,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960051999] [2019-12-07 17:29:45,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110463228] [2019-12-07 17:29:45,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9d78236-16b1-4b5b-a1df-ae223e78dc70/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:29:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:45,381 INFO L264 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:29:45,384 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:29:45,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:29:45,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:29:45,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:29:45,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:29:45,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:29:45,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:29:45,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:29:45,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:29:45,874 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 80 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 17:29:45,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:29:45,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3] total 10 [2019-12-07 17:29:45,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178515413] [2019-12-07 17:29:45,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:29:45,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:45,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:29:45,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:29:45,876 INFO L87 Difference]: Start difference. First operand 15532 states and 17277 transitions. Second operand 10 states. [2019-12-07 17:29:55,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:55,486 INFO L93 Difference]: Finished difference Result 37356 states and 41761 transitions. [2019-12-07 17:29:55,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 17:29:55,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 338 [2019-12-07 17:29:55,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:55,501 INFO L225 Difference]: With dead ends: 37356 [2019-12-07 17:29:55,501 INFO L226 Difference]: Without dead ends: 24040 [2019-12-07 17:29:55,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:29:55,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24040 states. [2019-12-07 17:29:55,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24040 to 15716. [2019-12-07 17:29:55,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15716 states. [2019-12-07 17:29:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15716 states to 15716 states and 17470 transitions. [2019-12-07 17:29:55,653 INFO L78 Accepts]: Start accepts. Automaton has 15716 states and 17470 transitions. Word has length 338 [2019-12-07 17:29:55,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:55,654 INFO L462 AbstractCegarLoop]: Abstraction has 15716 states and 17470 transitions. [2019-12-07 17:29:55,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:29:55,654 INFO L276 IsEmpty]: Start isEmpty. Operand 15716 states and 17470 transitions. [2019-12-07 17:29:55,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-12-07 17:29:55,659 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:55,660 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:55,860 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:29:55,861 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:55,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:55,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1174714697, now seen corresponding path program 1 times [2019-12-07 17:29:55,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:55,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554005842] [2019-12-07 17:29:55,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:56,067 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 17:29:56,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554005842] [2019-12-07 17:29:56,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:56,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:29:56,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609220399] [2019-12-07 17:29:56,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:29:56,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:56,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:29:56,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:29:56,068 INFO L87 Difference]: Start difference. First operand 15716 states and 17470 transitions. Second operand 5 states. [2019-12-07 17:29:57,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:57,823 INFO L93 Difference]: Finished difference Result 35857 states and 39884 transitions. [2019-12-07 17:29:57,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:29:57,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 356 [2019-12-07 17:29:57,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:57,838 INFO L225 Difference]: With dead ends: 35857 [2019-12-07 17:29:57,838 INFO L226 Difference]: Without dead ends: 21247 [2019-12-07 17:29:57,846 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-12-07 17:29:57,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21247 states. [2019-12-07 17:29:58,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21247 to 18101. [2019-12-07 17:29:58,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18101 states. [2019-12-07 17:29:58,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18101 states to 18101 states and 19801 transitions. [2019-12-07 17:29:58,023 INFO L78 Accepts]: Start accepts. Automaton has 18101 states and 19801 transitions. Word has length 356 [2019-12-07 17:29:58,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:58,023 INFO L462 AbstractCegarLoop]: Abstraction has 18101 states and 19801 transitions. [2019-12-07 17:29:58,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:29:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 18101 states and 19801 transitions. [2019-12-07 17:29:58,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-12-07 17:29:58,034 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:58,035 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 17:29:58,035 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:58,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:58,035 INFO L82 PathProgramCache]: Analyzing trace with hash -174982330, now seen corresponding path program 1 times [2019-12-07 17:29:58,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:58,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640615509] [2019-12-07 17:29:58,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:58,193 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2019-12-07 17:29:58,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640615509] [2019-12-07 17:29:58,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:58,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:29:58,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948493554] [2019-12-07 17:29:58,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:29:58,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:58,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:29:58,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:29:58,194 INFO L87 Difference]: Start difference. First operand 18101 states and 19801 transitions. Second operand 3 states. [2019-12-07 17:29:58,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:58,693 INFO L93 Difference]: Finished difference Result 21047 states and 22928 transitions. [2019-12-07 17:29:58,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:29:58,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 424 [2019-12-07 17:29:58,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:58,706 INFO L225 Difference]: With dead ends: 21047 [2019-12-07 17:29:58,706 INFO L226 Difference]: Without dead ends: 21045 [2019-12-07 17:29:58,709 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:29:58,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21045 states. [2019-12-07 17:29:58,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21045 to 18469. [2019-12-07 17:29:58,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18469 states. [2019-12-07 17:29:58,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18469 states to 18469 states and 20203 transitions. [2019-12-07 17:29:58,856 INFO L78 Accepts]: Start accepts. Automaton has 18469 states and 20203 transitions. Word has length 424 [2019-12-07 17:29:58,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:58,856 INFO L462 AbstractCegarLoop]: Abstraction has 18469 states and 20203 transitions. [2019-12-07 17:29:58,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:29:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 18469 states and 20203 transitions. [2019-12-07 17:29:58,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2019-12-07 17:29:58,867 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:58,867 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:29:58,867 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:58,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:58,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1385650959, now seen corresponding path program 1 times [2019-12-07 17:29:58,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:58,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610077443] [2019-12-07 17:29:58,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:59,487 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 299 proven. 374 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:59,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610077443] [2019-12-07 17:29:59,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207331108] [2019-12-07 17:29:59,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9d78236-16b1-4b5b-a1df-ae223e78dc70/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:29:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:59,585 INFO L264 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:29:59,589 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:29:59,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:29:59,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:29:59,723 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-12-07 17:29:59,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:29:59,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2019-12-07 17:29:59,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822859983] [2019-12-07 17:29:59,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:29:59,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:59,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:29:59,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:29:59,725 INFO L87 Difference]: Start difference. First operand 18469 states and 20203 transitions. Second operand 4 states. [2019-12-07 17:30:00,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:30:00,691 INFO L93 Difference]: Finished difference Result 42469 states and 46508 transitions. [2019-12-07 17:30:00,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:30:00,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 489 [2019-12-07 17:30:00,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:30:00,707 INFO L225 Difference]: With dead ends: 42469 [2019-12-07 17:30:00,707 INFO L226 Difference]: Without dead ends: 24370 [2019-12-07 17:30:00,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 488 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:30:00,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24370 states. [2019-12-07 17:30:00,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24370 to 21600. [2019-12-07 17:30:00,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21600 states. [2019-12-07 17:30:00,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21600 states to 21600 states and 23450 transitions. [2019-12-07 17:30:00,885 INFO L78 Accepts]: Start accepts. Automaton has 21600 states and 23450 transitions. Word has length 489 [2019-12-07 17:30:00,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:30:00,885 INFO L462 AbstractCegarLoop]: Abstraction has 21600 states and 23450 transitions. [2019-12-07 17:30:00,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:30:00,885 INFO L276 IsEmpty]: Start isEmpty. Operand 21600 states and 23450 transitions. [2019-12-07 17:30:00,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2019-12-07 17:30:00,897 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:30:00,897 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:30:01,098 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:30:01,099 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:30:01,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:01,099 INFO L82 PathProgramCache]: Analyzing trace with hash 439563746, now seen corresponding path program 1 times [2019-12-07 17:30:01,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:01,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078496767] [2019-12-07 17:30:01,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:01,400 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 646 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-12-07 17:30:01,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078496767] [2019-12-07 17:30:01,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:30:01,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:30:01,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30488845] [2019-12-07 17:30:01,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:30:01,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:30:01,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:30:01,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:30:01,402 INFO L87 Difference]: Start difference. First operand 21600 states and 23450 transitions. Second operand 4 states. [2019-12-07 17:30:02,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:30:02,352 INFO L93 Difference]: Finished difference Result 42293 states and 45938 transitions. [2019-12-07 17:30:02,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:30:02,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 541 [2019-12-07 17:30:02,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:30:02,367 INFO L225 Difference]: With dead ends: 42293 [2019-12-07 17:30:02,367 INFO L226 Difference]: Without dead ends: 22907 [2019-12-07 17:30:02,373 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-12-07 17:30:02,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22907 states. [2019-12-07 17:30:02,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22907 to 21600. [2019-12-07 17:30:02,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21600 states. [2019-12-07 17:30:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21600 states to 21600 states and 23340 transitions. [2019-12-07 17:30:02,540 INFO L78 Accepts]: Start accepts. Automaton has 21600 states and 23340 transitions. Word has length 541 [2019-12-07 17:30:02,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:30:02,540 INFO L462 AbstractCegarLoop]: Abstraction has 21600 states and 23340 transitions. [2019-12-07 17:30:02,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:30:02,540 INFO L276 IsEmpty]: Start isEmpty. Operand 21600 states and 23340 transitions. [2019-12-07 17:30:02,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2019-12-07 17:30:02,549 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:30:02,549 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:30:02,549 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:30:02,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:02,550 INFO L82 PathProgramCache]: Analyzing trace with hash 881604247, now seen corresponding path program 1 times [2019-12-07 17:30:02,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:02,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275838876] [2019-12-07 17:30:02,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:03,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 630 proven. 144 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-12-07 17:30:03,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275838876] [2019-12-07 17:30:03,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264679851] [2019-12-07 17:30:03,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9d78236-16b1-4b5b-a1df-ae223e78dc70/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:30:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:03,286 INFO L264 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 17:30:03,290 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:30:03,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:03,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:03,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:03,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:03,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 720 proven. 54 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-12-07 17:30:03,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:30:03,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-12-07 17:30:03,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388885599] [2019-12-07 17:30:03,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:30:03,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:30:03,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:30:03,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:30:03,923 INFO L87 Difference]: Start difference. First operand 21600 states and 23340 transitions. Second operand 11 states. [2019-12-07 17:30:18,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:30:18,506 INFO L93 Difference]: Finished difference Result 51142 states and 55190 transitions. [2019-12-07 17:30:18,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 17:30:18,506 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 566 [2019-12-07 17:30:18,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:30:18,536 INFO L225 Difference]: With dead ends: 51142 [2019-12-07 17:30:18,536 INFO L226 Difference]: Without dead ends: 29912 [2019-12-07 17:30:18,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 576 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2019-12-07 17:30:18,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29912 states. [2019-12-07 17:30:18,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29912 to 22888. [2019-12-07 17:30:18,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22888 states. [2019-12-07 17:30:18,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22888 states to 22888 states and 24485 transitions. [2019-12-07 17:30:18,763 INFO L78 Accepts]: Start accepts. Automaton has 22888 states and 24485 transitions. Word has length 566 [2019-12-07 17:30:18,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:30:18,764 INFO L462 AbstractCegarLoop]: Abstraction has 22888 states and 24485 transitions. [2019-12-07 17:30:18,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:30:18,764 INFO L276 IsEmpty]: Start isEmpty. Operand 22888 states and 24485 transitions. [2019-12-07 17:30:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 749 [2019-12-07 17:30:18,775 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:30:18,776 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 2, 2, 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] [2019-12-07 17:30:18,976 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:30:18,977 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:30:18,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:18,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1107746161, now seen corresponding path program 1 times [2019-12-07 17:30:18,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:18,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383265319] [2019-12-07 17:30:18,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1655 backedges. 603 proven. 0 refuted. 0 times theorem prover too weak. 1052 trivial. 0 not checked. [2019-12-07 17:30:19,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383265319] [2019-12-07 17:30:19,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:30:19,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:30:19,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292403372] [2019-12-07 17:30:19,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:30:19,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:30:19,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:30:19,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:30:19,522 INFO L87 Difference]: Start difference. First operand 22888 states and 24485 transitions. Second operand 4 states. [2019-12-07 17:30:20,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:30:20,291 INFO L93 Difference]: Finished difference Result 42463 states and 45394 transitions. [2019-12-07 17:30:20,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:30:20,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 748 [2019-12-07 17:30:20,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:30:20,303 INFO L225 Difference]: With dead ends: 42463 [2019-12-07 17:30:20,303 INFO L226 Difference]: Without dead ends: 19945 [2019-12-07 17:30:20,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:30:20,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19945 states. [2019-12-07 17:30:20,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19945 to 13304. [2019-12-07 17:30:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13304 states. [2019-12-07 17:30:20,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13304 states to 13304 states and 14191 transitions. [2019-12-07 17:30:20,436 INFO L78 Accepts]: Start accepts. Automaton has 13304 states and 14191 transitions. Word has length 748 [2019-12-07 17:30:20,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:30:20,437 INFO L462 AbstractCegarLoop]: Abstraction has 13304 states and 14191 transitions. [2019-12-07 17:30:20,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:30:20,437 INFO L276 IsEmpty]: Start isEmpty. Operand 13304 states and 14191 transitions. [2019-12-07 17:30:20,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1016 [2019-12-07 17:30:20,448 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:30:20,449 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:30:20,449 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:30:20,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:20,449 INFO L82 PathProgramCache]: Analyzing trace with hash 904594841, now seen corresponding path program 1 times [2019-12-07 17:30:20,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:20,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284439768] [2019-12-07 17:30:20,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:21,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3180 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 2965 trivial. 0 not checked. [2019-12-07 17:30:21,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284439768] [2019-12-07 17:30:21,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:30:21,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:30:21,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962184928] [2019-12-07 17:30:21,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:30:21,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:30:21,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:30:21,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:30:21,465 INFO L87 Difference]: Start difference. First operand 13304 states and 14191 transitions. Second operand 3 states. [2019-12-07 17:30:21,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:30:21,813 INFO L93 Difference]: Finished difference Result 25125 states and 26814 transitions. [2019-12-07 17:30:21,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:30:21,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1015 [2019-12-07 17:30:21,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:30:21,814 INFO L225 Difference]: With dead ends: 25125 [2019-12-07 17:30:21,814 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 17:30:21,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:30:21,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 17:30:21,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 17:30:21,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 17:30:21,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 17:30:21,820 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1015 [2019-12-07 17:30:21,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:30:21,820 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:30:21,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:30:21,820 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:30:21,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 17:30:21,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 17:30:22,451 WARN L192 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 681 DAG size of output: 481 [2019-12-07 17:30:23,013 WARN L192 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 681 DAG size of output: 481 [2019-12-07 17:30:26,264 WARN L192 SmtUtils]: Spent 3.25 s on a formula simplification. DAG size of input: 447 DAG size of output: 151 [2019-12-07 17:30:29,372 WARN L192 SmtUtils]: Spent 3.11 s on a formula simplification. DAG size of input: 447 DAG size of output: 151 [2019-12-07 17:30:29,375 INFO L246 CegarLoopResult]: For program point L168(line 168) no Hoare annotation was computed. [2019-12-07 17:30:29,375 INFO L246 CegarLoopResult]: For program point L102(line 102) no Hoare annotation was computed. [2019-12-07 17:30:29,375 INFO L246 CegarLoopResult]: For program point L36(line 36) no Hoare annotation was computed. [2019-12-07 17:30:29,375 INFO L249 CegarLoopResult]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-12-07 17:30:29,375 INFO L246 CegarLoopResult]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,375 INFO L246 CegarLoopResult]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,375 INFO L246 CegarLoopResult]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,376 INFO L246 CegarLoopResult]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,376 INFO L246 CegarLoopResult]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,376 INFO L246 CegarLoopResult]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,376 INFO L246 CegarLoopResult]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,376 INFO L246 CegarLoopResult]: For program point L171(line 171) no Hoare annotation was computed. [2019-12-07 17:30:29,376 INFO L246 CegarLoopResult]: For program point L105(line 105) no Hoare annotation was computed. [2019-12-07 17:30:29,376 INFO L246 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2019-12-07 17:30:29,376 INFO L246 CegarLoopResult]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,376 INFO L246 CegarLoopResult]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,376 INFO L246 CegarLoopResult]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,376 INFO L246 CegarLoopResult]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,376 INFO L246 CegarLoopResult]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,376 INFO L246 CegarLoopResult]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,376 INFO L246 CegarLoopResult]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,376 INFO L246 CegarLoopResult]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,376 INFO L246 CegarLoopResult]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,376 INFO L246 CegarLoopResult]: For program point L174(line 174) no Hoare annotation was computed. [2019-12-07 17:30:29,376 INFO L246 CegarLoopResult]: For program point L108(line 108) no Hoare annotation was computed. [2019-12-07 17:30:29,376 INFO L246 CegarLoopResult]: For program point L42(line 42) no Hoare annotation was computed. [2019-12-07 17:30:29,377 INFO L246 CegarLoopResult]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,377 INFO L242 CegarLoopResult]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse15 (= ~a25~0 11)) (.cse23 (+ ~a23~0 43)) (.cse13 (= ~a25~0 10))) (let ((.cse14 (exists ((v_~a23~0_474 Int)) (let ((.cse25 (div v_~a23~0_474 5))) (and (= (mod v_~a23~0_474 5) 0) (<= ~a23~0 (+ (mod (* .cse25 4) 83) 180)) (<= 312 v_~a23~0_474) (<= 0 (* 4 .cse25)))))) (.cse21 (<= 130 ~a29~0)) (.cse20 (not .cse13)) (.cse6 (< 277 ~a29~0)) (.cse12 (<= ~a29~0 245)) (.cse9 (= ~a25~0 13)) (.cse19 (<= (+ ~a29~0 (* 5 ~a23~0)) 101230)) (.cse8 (<= 260 ~a29~0)) (.cse0 (= ~a25~0 9)) (.cse5 (<= .cse23 0)) (.cse3 (not .cse15)) (.cse18 (<= (+ ~a29~0 193245) 0)) (.cse7 (<= ~a25~0 9)) (.cse4 (<= ~a25~0 12)) (.cse11 (<= ~a29~0 130)) (.cse22 (<= 141 ~a29~0)) (.cse16 (= ~a25~0 12)) (.cse10 (<= ~a23~0 312)) (.cse1 (= 15 ~a8~0)) (.cse2 (= 1 ~a4~0)) (.cse17 (< 138 ~a23~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2 .cse5) (and .cse0 .cse1 .cse6 .cse5) (and .cse7 (<= ~a29~0 275) .cse1 .cse2 .cse8) (and .cse9 (exists ((v_~a29~0_505 Int)) (and (<= v_~a29~0_505 140) (<= ~a29~0 (+ (div v_~a29~0_505 5) 206649)) (<= 0 v_~a29~0_505))) .cse1 .cse2) (and .cse3 .cse10 .cse4 .cse11 .cse1 .cse2) (and .cse10 .cse1 .cse12 .cse13) (and .cse14 .cse9 .cse11 .cse2) (and .cse1 .cse15 .cse5) (and .cse16 .cse10 .cse1 .cse17) (and .cse16 (<= ~a4~0 0) .cse18 .cse1) (and .cse16 .cse10 .cse1 (not .cse2)) (and .cse11 .cse1 .cse13) (and .cse1 .cse13 .cse5) (and .cse14 .cse9 .cse19 .cse2 .cse6 .cse20) (and (not .cse9) .cse2 .cse21 .cse5) (and (or (and .cse16 (< 140 ~a29~0) (<= ~a29~0 277) .cse2 .cse17) (and .cse22 .cse2 .cse15 .cse17)) .cse1) (and .cse12 .cse2 .cse21 .cse5) (and .cse1 (or (and .cse7 .cse2 .cse6 .cse20) (and (or (and .cse2 .cse6 .cse15 .cse20) (and .cse13 .cse6)) .cse2))) (and .cse10 .cse0 (< 0 .cse23) .cse1 .cse12) (and .cse1 .cse2 .cse13 .cse17) (and .cse9 .cse10 .cse1 (or .cse19 (<= ~a23~0 306))) (and .cse10 .cse7 .cse1 .cse2 .cse8) (and .cse0 .cse18 .cse1 .cse5) (and .cse3 (<= (+ (* 5 ~a29~0) ~a23~0) 1687) .cse18 .cse4 .cse1 .cse2) (and .cse7 .cse4 .cse11 .cse2) (and .cse22 .cse1 (let ((.cse24 (exists ((v_~a29~0_499 Int)) (and (<= ~a29~0 (+ (mod v_~a29~0_499 15) 261)) (<= 130 v_~a29~0_499) (<= 0 v_~a29~0_499))))) (or (and .cse16 .cse24) (and .cse24 .cse2 .cse15)))) (and .cse10 .cse1 .cse2 .cse15 .cse17)))) [2019-12-07 17:30:29,377 INFO L246 CegarLoopResult]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,377 INFO L246 CegarLoopResult]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,377 INFO L246 CegarLoopResult]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,377 INFO L246 CegarLoopResult]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,377 INFO L246 CegarLoopResult]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,377 INFO L246 CegarLoopResult]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,377 INFO L246 CegarLoopResult]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,377 INFO L246 CegarLoopResult]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,377 INFO L246 CegarLoopResult]: For program point L177(line 177) no Hoare annotation was computed. [2019-12-07 17:30:29,377 INFO L246 CegarLoopResult]: For program point L111(line 111) no Hoare annotation was computed. [2019-12-07 17:30:29,377 INFO L246 CegarLoopResult]: For program point L45(line 45) no Hoare annotation was computed. [2019-12-07 17:30:29,378 INFO L246 CegarLoopResult]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-12-07 17:30:29,378 INFO L246 CegarLoopResult]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-12-07 17:30:29,378 INFO L246 CegarLoopResult]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-12-07 17:30:29,378 INFO L246 CegarLoopResult]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-12-07 17:30:29,378 INFO L246 CegarLoopResult]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,378 INFO L246 CegarLoopResult]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,378 INFO L246 CegarLoopResult]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,378 INFO L246 CegarLoopResult]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,378 INFO L246 CegarLoopResult]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,378 INFO L246 CegarLoopResult]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,378 INFO L246 CegarLoopResult]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,378 INFO L246 CegarLoopResult]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,378 INFO L246 CegarLoopResult]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,378 INFO L246 CegarLoopResult]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,378 INFO L246 CegarLoopResult]: For program point L180(line 180) no Hoare annotation was computed. [2019-12-07 17:30:29,378 INFO L246 CegarLoopResult]: For program point L114(line 114) no Hoare annotation was computed. [2019-12-07 17:30:29,378 INFO L246 CegarLoopResult]: For program point L48(line 48) no Hoare annotation was computed. [2019-12-07 17:30:29,378 INFO L246 CegarLoopResult]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-12-07 17:30:29,378 INFO L246 CegarLoopResult]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,379 INFO L246 CegarLoopResult]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,379 INFO L246 CegarLoopResult]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,379 INFO L246 CegarLoopResult]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,379 INFO L246 CegarLoopResult]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,379 INFO L246 CegarLoopResult]: For program point L183(line 183) no Hoare annotation was computed. [2019-12-07 17:30:29,379 INFO L246 CegarLoopResult]: For program point L117(line 117) no Hoare annotation was computed. [2019-12-07 17:30:29,379 INFO L246 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2019-12-07 17:30:29,379 INFO L246 CegarLoopResult]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,379 INFO L246 CegarLoopResult]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,379 INFO L246 CegarLoopResult]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,379 INFO L246 CegarLoopResult]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,379 INFO L246 CegarLoopResult]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-12-07 17:30:29,379 INFO L246 CegarLoopResult]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-12-07 17:30:29,379 INFO L246 CegarLoopResult]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,379 INFO L246 CegarLoopResult]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,379 INFO L246 CegarLoopResult]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,379 INFO L246 CegarLoopResult]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,379 INFO L246 CegarLoopResult]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,379 INFO L246 CegarLoopResult]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,379 INFO L246 CegarLoopResult]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-12-07 17:30:29,379 INFO L246 CegarLoopResult]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-12-07 17:30:29,380 INFO L246 CegarLoopResult]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,380 INFO L246 CegarLoopResult]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,380 INFO L246 CegarLoopResult]: For program point L186(line 186) no Hoare annotation was computed. [2019-12-07 17:30:29,380 INFO L246 CegarLoopResult]: For program point L120(line 120) no Hoare annotation was computed. [2019-12-07 17:30:29,380 INFO L246 CegarLoopResult]: For program point L54(line 54) no Hoare annotation was computed. [2019-12-07 17:30:29,380 INFO L246 CegarLoopResult]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,380 INFO L246 CegarLoopResult]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,380 INFO L246 CegarLoopResult]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,380 INFO L246 CegarLoopResult]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,380 INFO L246 CegarLoopResult]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,380 INFO L246 CegarLoopResult]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,380 INFO L246 CegarLoopResult]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,380 INFO L246 CegarLoopResult]: For program point L189(line 189) no Hoare annotation was computed. [2019-12-07 17:30:29,380 INFO L246 CegarLoopResult]: For program point L123(line 123) no Hoare annotation was computed. [2019-12-07 17:30:29,380 INFO L246 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2019-12-07 17:30:29,380 INFO L246 CegarLoopResult]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-12-07 17:30:29,380 INFO L246 CegarLoopResult]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-12-07 17:30:29,380 INFO L246 CegarLoopResult]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-12-07 17:30:29,380 INFO L246 CegarLoopResult]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-12-07 17:30:29,380 INFO L246 CegarLoopResult]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,381 INFO L246 CegarLoopResult]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,381 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 17:30:29,381 INFO L246 CegarLoopResult]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-12-07 17:30:29,381 INFO L246 CegarLoopResult]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-12-07 17:30:29,381 INFO L246 CegarLoopResult]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,381 INFO L246 CegarLoopResult]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,381 INFO L246 CegarLoopResult]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,381 INFO L246 CegarLoopResult]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,381 INFO L246 CegarLoopResult]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,381 INFO L246 CegarLoopResult]: For program point L192(line 192) no Hoare annotation was computed. [2019-12-07 17:30:29,381 INFO L246 CegarLoopResult]: For program point L126(line 126) no Hoare annotation was computed. [2019-12-07 17:30:29,381 INFO L246 CegarLoopResult]: For program point L60(line 60) no Hoare annotation was computed. [2019-12-07 17:30:29,381 INFO L246 CegarLoopResult]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,381 INFO L246 CegarLoopResult]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,381 INFO L246 CegarLoopResult]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,381 INFO L246 CegarLoopResult]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,381 INFO L246 CegarLoopResult]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,381 INFO L246 CegarLoopResult]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,381 INFO L246 CegarLoopResult]: For program point L195(line 195) no Hoare annotation was computed. [2019-12-07 17:30:29,381 INFO L246 CegarLoopResult]: For program point L129(line 129) no Hoare annotation was computed. [2019-12-07 17:30:29,382 INFO L246 CegarLoopResult]: For program point L63(line 63) no Hoare annotation was computed. [2019-12-07 17:30:29,382 INFO L246 CegarLoopResult]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,382 INFO L246 CegarLoopResult]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,382 INFO L246 CegarLoopResult]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,382 INFO L246 CegarLoopResult]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,382 INFO L246 CegarLoopResult]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,382 INFO L246 CegarLoopResult]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,382 INFO L246 CegarLoopResult]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,382 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 17:30:29,382 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) no Hoare annotation was computed. [2019-12-07 17:30:29,382 INFO L246 CegarLoopResult]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,382 INFO L246 CegarLoopResult]: For program point L198(line 198) no Hoare annotation was computed. [2019-12-07 17:30:29,382 INFO L246 CegarLoopResult]: For program point L132(line 132) no Hoare annotation was computed. [2019-12-07 17:30:29,382 INFO L246 CegarLoopResult]: For program point L66(line 66) no Hoare annotation was computed. [2019-12-07 17:30:29,382 INFO L246 CegarLoopResult]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,382 INFO L246 CegarLoopResult]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,382 INFO L246 CegarLoopResult]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,382 INFO L246 CegarLoopResult]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,382 INFO L246 CegarLoopResult]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,382 INFO L246 CegarLoopResult]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,383 INFO L246 CegarLoopResult]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,383 INFO L246 CegarLoopResult]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,383 INFO L246 CegarLoopResult]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,383 INFO L246 CegarLoopResult]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,383 INFO L246 CegarLoopResult]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,383 INFO L246 CegarLoopResult]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-12-07 17:30:29,383 INFO L246 CegarLoopResult]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-12-07 17:30:29,383 INFO L246 CegarLoopResult]: For program point L201(line 201) no Hoare annotation was computed. [2019-12-07 17:30:29,383 INFO L246 CegarLoopResult]: For program point L135(line 135) no Hoare annotation was computed. [2019-12-07 17:30:29,383 INFO L246 CegarLoopResult]: For program point L69(line 69) no Hoare annotation was computed. [2019-12-07 17:30:29,383 INFO L246 CegarLoopResult]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,383 INFO L246 CegarLoopResult]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,383 INFO L246 CegarLoopResult]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,383 INFO L246 CegarLoopResult]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,383 INFO L246 CegarLoopResult]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,383 INFO L246 CegarLoopResult]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,383 INFO L246 CegarLoopResult]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,383 INFO L246 CegarLoopResult]: For program point L204(line 204) no Hoare annotation was computed. [2019-12-07 17:30:29,383 INFO L246 CegarLoopResult]: For program point L138(line 138) no Hoare annotation was computed. [2019-12-07 17:30:29,383 INFO L246 CegarLoopResult]: For program point L72(line 72) no Hoare annotation was computed. [2019-12-07 17:30:29,384 INFO L246 CegarLoopResult]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,384 INFO L246 CegarLoopResult]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,384 INFO L246 CegarLoopResult]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,384 INFO L246 CegarLoopResult]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-12-07 17:30:29,384 INFO L246 CegarLoopResult]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-12-07 17:30:29,384 INFO L246 CegarLoopResult]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,384 INFO L246 CegarLoopResult]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,384 INFO L246 CegarLoopResult]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,384 INFO L246 CegarLoopResult]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,384 INFO L246 CegarLoopResult]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,384 INFO L246 CegarLoopResult]: For program point L141(line 141) no Hoare annotation was computed. [2019-12-07 17:30:29,384 INFO L246 CegarLoopResult]: For program point L75(line 75) no Hoare annotation was computed. [2019-12-07 17:30:29,384 INFO L246 CegarLoopResult]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,384 INFO L246 CegarLoopResult]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,384 INFO L246 CegarLoopResult]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-12-07 17:30:29,384 INFO L246 CegarLoopResult]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-12-07 17:30:29,384 INFO L246 CegarLoopResult]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,384 INFO L246 CegarLoopResult]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,384 INFO L246 CegarLoopResult]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,384 INFO L246 CegarLoopResult]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,384 INFO L246 CegarLoopResult]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,385 INFO L246 CegarLoopResult]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,385 INFO L246 CegarLoopResult]: For program point L144(line 144) no Hoare annotation was computed. [2019-12-07 17:30:29,385 INFO L246 CegarLoopResult]: For program point L78(line 78) no Hoare annotation was computed. [2019-12-07 17:30:29,385 INFO L246 CegarLoopResult]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-12-07 17:30:29,385 INFO L246 CegarLoopResult]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-12-07 17:30:29,385 INFO L246 CegarLoopResult]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,385 INFO L246 CegarLoopResult]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,385 INFO L246 CegarLoopResult]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,385 INFO L246 CegarLoopResult]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,385 INFO L246 CegarLoopResult]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,385 INFO L246 CegarLoopResult]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,385 INFO L246 CegarLoopResult]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,385 INFO L246 CegarLoopResult]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,385 INFO L246 CegarLoopResult]: For program point L147(line 147) no Hoare annotation was computed. [2019-12-07 17:30:29,385 INFO L246 CegarLoopResult]: For program point L81(line 81) no Hoare annotation was computed. [2019-12-07 17:30:29,385 INFO L246 CegarLoopResult]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-12-07 17:30:29,385 INFO L246 CegarLoopResult]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-12-07 17:30:29,385 INFO L246 CegarLoopResult]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-12-07 17:30:29,385 INFO L246 CegarLoopResult]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-12-07 17:30:29,385 INFO L246 CegarLoopResult]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,385 INFO L246 CegarLoopResult]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,386 INFO L246 CegarLoopResult]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,386 INFO L246 CegarLoopResult]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,386 INFO L246 CegarLoopResult]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,386 INFO L246 CegarLoopResult]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,386 INFO L246 CegarLoopResult]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,386 INFO L246 CegarLoopResult]: For program point L150(line 150) no Hoare annotation was computed. [2019-12-07 17:30:29,386 INFO L246 CegarLoopResult]: For program point L84(line 84) no Hoare annotation was computed. [2019-12-07 17:30:29,386 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 17:30:29,386 INFO L246 CegarLoopResult]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,386 INFO L246 CegarLoopResult]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,386 INFO L246 CegarLoopResult]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,386 INFO L246 CegarLoopResult]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,386 INFO L246 CegarLoopResult]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,386 INFO L246 CegarLoopResult]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,386 INFO L246 CegarLoopResult]: For program point L153(line 153) no Hoare annotation was computed. [2019-12-07 17:30:29,386 INFO L246 CegarLoopResult]: For program point L87(line 87) no Hoare annotation was computed. [2019-12-07 17:30:29,386 INFO L246 CegarLoopResult]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,386 INFO L246 CegarLoopResult]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,386 INFO L246 CegarLoopResult]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,386 INFO L246 CegarLoopResult]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,387 INFO L246 CegarLoopResult]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,387 INFO L246 CegarLoopResult]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,387 INFO L246 CegarLoopResult]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,387 INFO L246 CegarLoopResult]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-12-07 17:30:29,387 INFO L246 CegarLoopResult]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,387 INFO L246 CegarLoopResult]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,387 INFO L246 CegarLoopResult]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,387 INFO L246 CegarLoopResult]: For program point L156(line 156) no Hoare annotation was computed. [2019-12-07 17:30:29,387 INFO L246 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2019-12-07 17:30:29,387 INFO L246 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2019-12-07 17:30:29,387 INFO L246 CegarLoopResult]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,387 INFO L246 CegarLoopResult]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-12-07 17:30:29,387 INFO L246 CegarLoopResult]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,387 INFO L246 CegarLoopResult]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-12-07 17:30:29,387 INFO L246 CegarLoopResult]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,387 INFO L246 CegarLoopResult]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,387 INFO L246 CegarLoopResult]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,387 INFO L246 CegarLoopResult]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,387 INFO L246 CegarLoopResult]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,387 INFO L246 CegarLoopResult]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,387 INFO L246 CegarLoopResult]: For program point L159(line 159) no Hoare annotation was computed. [2019-12-07 17:30:29,388 INFO L246 CegarLoopResult]: For program point L93(line 93) no Hoare annotation was computed. [2019-12-07 17:30:29,388 INFO L246 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2019-12-07 17:30:29,388 INFO L246 CegarLoopResult]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,388 INFO L246 CegarLoopResult]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,388 INFO L246 CegarLoopResult]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,388 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 17:30:29,388 INFO L246 CegarLoopResult]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,388 INFO L246 CegarLoopResult]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,388 INFO L246 CegarLoopResult]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,388 INFO L246 CegarLoopResult]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,388 INFO L246 CegarLoopResult]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,388 INFO L246 CegarLoopResult]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,388 INFO L246 CegarLoopResult]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,388 INFO L246 CegarLoopResult]: For program point L162(line 162) no Hoare annotation was computed. [2019-12-07 17:30:29,388 INFO L246 CegarLoopResult]: For program point L96(line 96) no Hoare annotation was computed. [2019-12-07 17:30:29,388 INFO L246 CegarLoopResult]: For program point L30(line 30) no Hoare annotation was computed. [2019-12-07 17:30:29,388 INFO L246 CegarLoopResult]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,388 INFO L246 CegarLoopResult]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-12-07 17:30:29,388 INFO L246 CegarLoopResult]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-12-07 17:30:29,389 INFO L246 CegarLoopResult]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,389 INFO L246 CegarLoopResult]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,389 INFO L246 CegarLoopResult]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,389 INFO L246 CegarLoopResult]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,389 INFO L246 CegarLoopResult]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,389 INFO L246 CegarLoopResult]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,389 INFO L246 CegarLoopResult]: For program point L165(line 165) no Hoare annotation was computed. [2019-12-07 17:30:29,389 INFO L246 CegarLoopResult]: For program point L99(line 99) no Hoare annotation was computed. [2019-12-07 17:30:29,389 INFO L246 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2019-12-07 17:30:29,389 INFO L246 CegarLoopResult]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,389 INFO L246 CegarLoopResult]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,389 INFO L246 CegarLoopResult]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,389 INFO L242 CegarLoopResult]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse15 (= ~a25~0 11)) (.cse23 (+ ~a23~0 43)) (.cse13 (= ~a25~0 10))) (let ((.cse14 (exists ((v_~a23~0_474 Int)) (let ((.cse25 (div v_~a23~0_474 5))) (and (= (mod v_~a23~0_474 5) 0) (<= ~a23~0 (+ (mod (* .cse25 4) 83) 180)) (<= 312 v_~a23~0_474) (<= 0 (* 4 .cse25)))))) (.cse21 (<= 130 ~a29~0)) (.cse20 (not .cse13)) (.cse6 (< 277 ~a29~0)) (.cse12 (<= ~a29~0 245)) (.cse9 (= ~a25~0 13)) (.cse19 (<= (+ ~a29~0 (* 5 ~a23~0)) 101230)) (.cse8 (<= 260 ~a29~0)) (.cse0 (= ~a25~0 9)) (.cse5 (<= .cse23 0)) (.cse3 (not .cse15)) (.cse18 (<= (+ ~a29~0 193245) 0)) (.cse7 (<= ~a25~0 9)) (.cse4 (<= ~a25~0 12)) (.cse11 (<= ~a29~0 130)) (.cse22 (<= 141 ~a29~0)) (.cse16 (= ~a25~0 12)) (.cse10 (<= ~a23~0 312)) (.cse1 (= 15 ~a8~0)) (.cse2 (= 1 ~a4~0)) (.cse17 (< 138 ~a23~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2 .cse5) (and .cse0 .cse1 .cse6 .cse5) (and .cse7 (<= ~a29~0 275) .cse1 .cse2 .cse8) (and .cse9 (exists ((v_~a29~0_505 Int)) (and (<= v_~a29~0_505 140) (<= ~a29~0 (+ (div v_~a29~0_505 5) 206649)) (<= 0 v_~a29~0_505))) .cse1 .cse2) (and .cse3 .cse10 .cse4 .cse11 .cse1 .cse2) (and .cse10 .cse1 .cse12 .cse13) (and .cse14 .cse9 .cse11 .cse2) (and .cse1 .cse15 .cse5) (and .cse16 .cse10 .cse1 .cse17) (and .cse16 (<= ~a4~0 0) .cse18 .cse1) (and .cse16 .cse10 .cse1 (not .cse2)) (and .cse11 .cse1 .cse13) (and .cse1 .cse13 .cse5) (and .cse14 .cse9 .cse19 .cse2 .cse6 .cse20) (and (not .cse9) .cse2 .cse21 .cse5) (and (or (and .cse16 (< 140 ~a29~0) (<= ~a29~0 277) .cse2 .cse17) (and .cse22 .cse2 .cse15 .cse17)) .cse1) (and .cse12 .cse2 .cse21 .cse5) (and .cse1 (or (and .cse7 .cse2 .cse6 .cse20) (and (or (and .cse2 .cse6 .cse15 .cse20) (and .cse13 .cse6)) .cse2))) (and .cse10 .cse0 (< 0 .cse23) .cse1 .cse12) (and .cse1 .cse2 .cse13 .cse17) (and .cse9 .cse10 .cse1 (or .cse19 (<= ~a23~0 306))) (and .cse10 .cse7 .cse1 .cse2 .cse8) (and .cse0 .cse18 .cse1 .cse5) (and .cse3 (<= (+ (* 5 ~a29~0) ~a23~0) 1687) .cse18 .cse4 .cse1 .cse2) (and .cse7 .cse4 .cse11 .cse2) (and .cse22 .cse1 (let ((.cse24 (exists ((v_~a29~0_499 Int)) (and (<= ~a29~0 (+ (mod v_~a29~0_499 15) 261)) (<= 130 v_~a29~0_499) (<= 0 v_~a29~0_499))))) (or (and .cse16 .cse24) (and .cse24 .cse2 .cse15)))) (and .cse10 .cse1 .cse2 .cse15 .cse17)))) [2019-12-07 17:30:29,390 INFO L246 CegarLoopResult]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,390 INFO L246 CegarLoopResult]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-12-07 17:30:29,390 INFO L246 CegarLoopResult]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-12-07 17:30:29,390 INFO L246 CegarLoopResult]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,390 INFO L246 CegarLoopResult]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,390 INFO L246 CegarLoopResult]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-12-07 17:30:29,390 INFO L246 CegarLoopResult]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,390 INFO L246 CegarLoopResult]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,390 INFO L246 CegarLoopResult]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 17:30:29,399 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:30:29 BoogieIcfgContainer [2019-12-07 17:30:29,425 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:30:29,426 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:30:29,426 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:30:29,426 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:30:29,426 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:29:20" (3/4) ... [2019-12-07 17:30:29,429 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 17:30:29,447 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 17:30:29,448 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 17:30:29,467 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((a25 == 9 && 15 == a8) && 1 == a4) || (((!(a25 == 11) && a25 <= 12) && 1 == a4) && a23 + 43 <= 0)) || (((a25 == 9 && 15 == a8) && 277 < a29) && a23 + 43 <= 0)) || ((((a25 <= 9 && a29 <= 275) && 15 == a8) && 1 == a4) && 260 <= a29)) || (((a25 == 13 && (\exists v_~a29~0_505 : int :: (v_~a29~0_505 <= 140 && a29 <= v_~a29~0_505 / 5 + 206649) && 0 <= v_~a29~0_505)) && 15 == a8) && 1 == a4)) || (((((!(a25 == 11) && a23 <= 312) && a25 <= 12) && a29 <= 130) && 15 == a8) && 1 == a4)) || (((a23 <= 312 && 15 == a8) && a29 <= 245) && a25 == 10)) || ((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 <= 130) && 1 == a4)) || ((15 == a8 && a25 == 11) && a23 + 43 <= 0)) || (((a25 == 12 && a23 <= 312) && 15 == a8) && 138 < a23)) || (((a25 == 12 && a4 <= 0) && a29 + 193245 <= 0) && 15 == a8)) || (((a25 == 12 && a23 <= 312) && 15 == a8) && !(1 == a4))) || ((a29 <= 130 && 15 == a8) && a25 == 10)) || ((15 == a8 && a25 == 10) && a23 + 43 <= 0)) || ((((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 + 5 * a23 <= 101230) && 1 == a4) && 277 < a29) && !(a25 == 10))) || (((!(a25 == 13) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || ((((((a25 == 12 && 140 < a29) && a29 <= 277) && 1 == a4) && 138 < a23) || (((141 <= a29 && 1 == a4) && a25 == 11) && 138 < a23)) && 15 == a8)) || (((a29 <= 245 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (15 == a8 && ((((a25 <= 9 && 1 == a4) && 277 < a29) && !(a25 == 10)) || (((((1 == a4 && 277 < a29) && a25 == 11) && !(a25 == 10)) || (a25 == 10 && 277 < a29)) && 1 == a4)))) || ((((a23 <= 312 && a25 == 9) && 0 < a23 + 43) && 15 == a8) && a29 <= 245)) || (((15 == a8 && 1 == a4) && a25 == 10) && 138 < a23)) || (((a25 == 13 && a23 <= 312) && 15 == a8) && (a29 + 5 * a23 <= 101230 || a23 <= 306))) || ((((a23 <= 312 && a25 <= 9) && 15 == a8) && 1 == a4) && 260 <= a29)) || (((a25 == 9 && a29 + 193245 <= 0) && 15 == a8) && a23 + 43 <= 0)) || (((((!(a25 == 11) && 5 * a29 + a23 <= 1687) && a29 + 193245 <= 0) && a25 <= 12) && 15 == a8) && 1 == a4)) || (((a25 <= 9 && a25 <= 12) && a29 <= 130) && 1 == a4)) || ((141 <= a29 && 15 == a8) && ((a25 == 12 && (\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499)) || (((\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499) && 1 == a4) && a25 == 11)))) || ((((a23 <= 312 && 15 == a8) && 1 == a4) && a25 == 11) && 138 < a23) [2019-12-07 17:30:29,470 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((a25 == 9 && 15 == a8) && 1 == a4) || (((!(a25 == 11) && a25 <= 12) && 1 == a4) && a23 + 43 <= 0)) || (((a25 == 9 && 15 == a8) && 277 < a29) && a23 + 43 <= 0)) || ((((a25 <= 9 && a29 <= 275) && 15 == a8) && 1 == a4) && 260 <= a29)) || (((a25 == 13 && (\exists v_~a29~0_505 : int :: (v_~a29~0_505 <= 140 && a29 <= v_~a29~0_505 / 5 + 206649) && 0 <= v_~a29~0_505)) && 15 == a8) && 1 == a4)) || (((((!(a25 == 11) && a23 <= 312) && a25 <= 12) && a29 <= 130) && 15 == a8) && 1 == a4)) || (((a23 <= 312 && 15 == a8) && a29 <= 245) && a25 == 10)) || ((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 <= 130) && 1 == a4)) || ((15 == a8 && a25 == 11) && a23 + 43 <= 0)) || (((a25 == 12 && a23 <= 312) && 15 == a8) && 138 < a23)) || (((a25 == 12 && a4 <= 0) && a29 + 193245 <= 0) && 15 == a8)) || (((a25 == 12 && a23 <= 312) && 15 == a8) && !(1 == a4))) || ((a29 <= 130 && 15 == a8) && a25 == 10)) || ((15 == a8 && a25 == 10) && a23 + 43 <= 0)) || ((((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 + 5 * a23 <= 101230) && 1 == a4) && 277 < a29) && !(a25 == 10))) || (((!(a25 == 13) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || ((((((a25 == 12 && 140 < a29) && a29 <= 277) && 1 == a4) && 138 < a23) || (((141 <= a29 && 1 == a4) && a25 == 11) && 138 < a23)) && 15 == a8)) || (((a29 <= 245 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (15 == a8 && ((((a25 <= 9 && 1 == a4) && 277 < a29) && !(a25 == 10)) || (((((1 == a4 && 277 < a29) && a25 == 11) && !(a25 == 10)) || (a25 == 10 && 277 < a29)) && 1 == a4)))) || ((((a23 <= 312 && a25 == 9) && 0 < a23 + 43) && 15 == a8) && a29 <= 245)) || (((15 == a8 && 1 == a4) && a25 == 10) && 138 < a23)) || (((a25 == 13 && a23 <= 312) && 15 == a8) && (a29 + 5 * a23 <= 101230 || a23 <= 306))) || ((((a23 <= 312 && a25 <= 9) && 15 == a8) && 1 == a4) && 260 <= a29)) || (((a25 == 9 && a29 + 193245 <= 0) && 15 == a8) && a23 + 43 <= 0)) || (((((!(a25 == 11) && 5 * a29 + a23 <= 1687) && a29 + 193245 <= 0) && a25 <= 12) && 15 == a8) && 1 == a4)) || (((a25 <= 9 && a25 <= 12) && a29 <= 130) && 1 == a4)) || ((141 <= a29 && 15 == a8) && ((a25 == 12 && (\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499)) || (((\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499) && 1 == a4) && a25 == 11)))) || ((((a23 <= 312 && 15 == a8) && 1 == a4) && a25 == 11) && 138 < a23) [2019-12-07 17:30:29,540 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d9d78236-16b1-4b5b-a1df-ae223e78dc70/bin/uautomizer/witness.graphml [2019-12-07 17:30:29,540 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:30:29,541 INFO L168 Benchmark]: Toolchain (without parser) took 70612.24 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 938.3 MB in the beginning and 986.9 MB in the end (delta: -48.6 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-12-07 17:30:29,542 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:30:29,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 468.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 938.3 MB in the beginning and 1.0 GB in the end (delta: -106.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:30:29,542 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:30:29,542 INFO L168 Benchmark]: Boogie Preprocessor took 86.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:30:29,542 INFO L168 Benchmark]: RCFGBuilder took 1061.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 842.3 MB in the end (delta: 174.2 MB). Peak memory consumption was 174.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:30:29,543 INFO L168 Benchmark]: TraceAbstraction took 68788.91 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 842.3 MB in the beginning and 999.0 MB in the end (delta: -156.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-12-07 17:30:29,543 INFO L168 Benchmark]: Witness Printer took 114.82 ms. Allocated memory is still 2.8 GB. Free memory was 999.0 MB in the beginning and 986.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:30:29,544 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 468.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 938.3 MB in the beginning and 1.0 GB in the end (delta: -106.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1061.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 842.3 MB in the end (delta: 174.2 MB). Peak memory consumption was 174.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 68788.91 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 842.3 MB in the beginning and 999.0 MB in the end (delta: -156.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 114.82 ms. Allocated memory is still 2.8 GB. Free memory was 999.0 MB in the beginning and 986.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 93]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-12-07 17:30:29,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,549 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,549 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,549 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,549 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,549 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,549 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,549 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((a25 == 9 && 15 == a8) && 1 == a4) || (((!(a25 == 11) && a25 <= 12) && 1 == a4) && a23 + 43 <= 0)) || (((a25 == 9 && 15 == a8) && 277 < a29) && a23 + 43 <= 0)) || ((((a25 <= 9 && a29 <= 275) && 15 == a8) && 1 == a4) && 260 <= a29)) || (((a25 == 13 && (\exists v_~a29~0_505 : int :: (v_~a29~0_505 <= 140 && a29 <= v_~a29~0_505 / 5 + 206649) && 0 <= v_~a29~0_505)) && 15 == a8) && 1 == a4)) || (((((!(a25 == 11) && a23 <= 312) && a25 <= 12) && a29 <= 130) && 15 == a8) && 1 == a4)) || (((a23 <= 312 && 15 == a8) && a29 <= 245) && a25 == 10)) || ((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 <= 130) && 1 == a4)) || ((15 == a8 && a25 == 11) && a23 + 43 <= 0)) || (((a25 == 12 && a23 <= 312) && 15 == a8) && 138 < a23)) || (((a25 == 12 && a4 <= 0) && a29 + 193245 <= 0) && 15 == a8)) || (((a25 == 12 && a23 <= 312) && 15 == a8) && !(1 == a4))) || ((a29 <= 130 && 15 == a8) && a25 == 10)) || ((15 == a8 && a25 == 10) && a23 + 43 <= 0)) || ((((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 + 5 * a23 <= 101230) && 1 == a4) && 277 < a29) && !(a25 == 10))) || (((!(a25 == 13) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || ((((((a25 == 12 && 140 < a29) && a29 <= 277) && 1 == a4) && 138 < a23) || (((141 <= a29 && 1 == a4) && a25 == 11) && 138 < a23)) && 15 == a8)) || (((a29 <= 245 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (15 == a8 && ((((a25 <= 9 && 1 == a4) && 277 < a29) && !(a25 == 10)) || (((((1 == a4 && 277 < a29) && a25 == 11) && !(a25 == 10)) || (a25 == 10 && 277 < a29)) && 1 == a4)))) || ((((a23 <= 312 && a25 == 9) && 0 < a23 + 43) && 15 == a8) && a29 <= 245)) || (((15 == a8 && 1 == a4) && a25 == 10) && 138 < a23)) || (((a25 == 13 && a23 <= 312) && 15 == a8) && (a29 + 5 * a23 <= 101230 || a23 <= 306))) || ((((a23 <= 312 && a25 <= 9) && 15 == a8) && 1 == a4) && 260 <= a29)) || (((a25 == 9 && a29 + 193245 <= 0) && 15 == a8) && a23 + 43 <= 0)) || (((((!(a25 == 11) && 5 * a29 + a23 <= 1687) && a29 + 193245 <= 0) && a25 <= 12) && 15 == a8) && 1 == a4)) || (((a25 <= 9 && a25 <= 12) && a29 <= 130) && 1 == a4)) || ((141 <= a29 && 15 == a8) && ((a25 == 12 && (\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499)) || (((\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499) && 1 == a4) && a25 == 11)))) || ((((a23 <= 312 && 15 == a8) && 1 == a4) && a25 == 11) && 138 < a23) - InvariantResult [Line: 22]: Loop Invariant [2019-12-07 17:30:29,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 17:30:29,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-12-07 17:30:29,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 17:30:29,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((a25 == 9 && 15 == a8) && 1 == a4) || (((!(a25 == 11) && a25 <= 12) && 1 == a4) && a23 + 43 <= 0)) || (((a25 == 9 && 15 == a8) && 277 < a29) && a23 + 43 <= 0)) || ((((a25 <= 9 && a29 <= 275) && 15 == a8) && 1 == a4) && 260 <= a29)) || (((a25 == 13 && (\exists v_~a29~0_505 : int :: (v_~a29~0_505 <= 140 && a29 <= v_~a29~0_505 / 5 + 206649) && 0 <= v_~a29~0_505)) && 15 == a8) && 1 == a4)) || (((((!(a25 == 11) && a23 <= 312) && a25 <= 12) && a29 <= 130) && 15 == a8) && 1 == a4)) || (((a23 <= 312 && 15 == a8) && a29 <= 245) && a25 == 10)) || ((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 <= 130) && 1 == a4)) || ((15 == a8 && a25 == 11) && a23 + 43 <= 0)) || (((a25 == 12 && a23 <= 312) && 15 == a8) && 138 < a23)) || (((a25 == 12 && a4 <= 0) && a29 + 193245 <= 0) && 15 == a8)) || (((a25 == 12 && a23 <= 312) && 15 == a8) && !(1 == a4))) || ((a29 <= 130 && 15 == a8) && a25 == 10)) || ((15 == a8 && a25 == 10) && a23 + 43 <= 0)) || ((((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 + 5 * a23 <= 101230) && 1 == a4) && 277 < a29) && !(a25 == 10))) || (((!(a25 == 13) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || ((((((a25 == 12 && 140 < a29) && a29 <= 277) && 1 == a4) && 138 < a23) || (((141 <= a29 && 1 == a4) && a25 == 11) && 138 < a23)) && 15 == a8)) || (((a29 <= 245 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (15 == a8 && ((((a25 <= 9 && 1 == a4) && 277 < a29) && !(a25 == 10)) || (((((1 == a4 && 277 < a29) && a25 == 11) && !(a25 == 10)) || (a25 == 10 && 277 < a29)) && 1 == a4)))) || ((((a23 <= 312 && a25 == 9) && 0 < a23 + 43) && 15 == a8) && a29 <= 245)) || (((15 == a8 && 1 == a4) && a25 == 10) && 138 < a23)) || (((a25 == 13 && a23 <= 312) && 15 == a8) && (a29 + 5 * a23 <= 101230 || a23 <= 306))) || ((((a23 <= 312 && a25 <= 9) && 15 == a8) && 1 == a4) && 260 <= a29)) || (((a25 == 9 && a29 + 193245 <= 0) && 15 == a8) && a23 + 43 <= 0)) || (((((!(a25 == 11) && 5 * a29 + a23 <= 1687) && a29 + 193245 <= 0) && a25 <= 12) && 15 == a8) && 1 == a4)) || (((a25 <= 9 && a25 <= 12) && a29 <= 130) && 1 == a4)) || ((141 <= a29 && 15 == a8) && ((a25 == 12 && (\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499)) || (((\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499) && 1 == a4) && a25 == 11)))) || ((((a23 <= 312 && 15 == a8) && 1 == a4) && a25 == 11) && 138 < a23) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 61.1s, OverallIterations: 19, TraceHistogramMax: 9, AutomataDifference: 49.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.5s, HoareTripleCheckerStatistics: 2876 SDtfs, 12471 SDslu, 1381 SDs, 0 SdLazy, 44178 SolverSat, 4466 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 39.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2262 GetRequests, 2151 SyntacticMatches, 8 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22888occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 41484 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 180 NumberOfFragments, 1157 HoareAnnotationTreeSize, 3 FomulaSimplifications, 72750 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 63040 FormulaSimplificationTreeSizeReductionInter, 6.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 8979 NumberOfCodeBlocks, 8979 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 8954 ConstructedInterpolants, 297 QuantifiedInterpolants, 16796626 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2864 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 11655/12788 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...